summaryrefslogtreecommitdiff
path: root/sys/lib/python/bisect.pyc
blob: 2d8af7e10871d049a900f476b23a1d92051ae41a (plain)
ofshex dumpascii
0000 b3 f2 0d 0a 9e 6c 87 4a 63 00 00 00 00 00 00 00 00 06 00 00 00 40 00 00 00 73 9a 00 00 00 64 00 .....l.Jc............@...s....d.
0020 00 5a 00 00 64 01 00 64 08 00 64 02 00 84 02 00 5a 02 00 65 02 00 5a 03 00 64 01 00 64 08 00 64 .Z..d..d..d.....Z..e..Z..d..d..d
0040 03 00 84 02 00 5a 04 00 65 04 00 5a 05 00 64 01 00 64 08 00 64 04 00 84 02 00 5a 06 00 64 01 00 .....Z..e..Z..d..d..d.....Z..d..
0060 64 08 00 64 05 00 84 02 00 5a 07 00 79 32 00 64 06 00 64 07 00 6b 08 00 6c 04 00 5a 04 00 6c 07 d..d.....Z..y2.d..d..k..l..Z..l.
0080 00 5a 07 00 6c 06 00 5a 06 00 6c 02 00 5a 02 00 6c 03 00 5a 03 00 6c 05 00 5a 05 00 01 57 6e 13 .Z..l..Z..l..Z..l..Z..l..Z...Wn.
00a0 00 04 65 09 00 6a 0a 00 6f 07 00 01 01 01 01 6e 02 00 01 58 64 08 00 53 28 09 00 00 00 73 15 00 ..e..j..o......n...Xd..S(....s..
00c0 00 00 42 69 73 65 63 74 69 6f 6e 20 61 6c 67 6f 72 69 74 68 6d 73 2e 69 00 00 00 00 63 04 00 00 ..Bisection.algorithms.i....c...
00e0 00 05 00 00 00 03 00 00 00 43 00 00 00 73 79 00 00 00 7c 03 00 64 03 00 6a 08 00 6f 10 00 01 74 .........C...sy...|..d..j..o...t
0100 01 00 7c 00 00 83 01 00 7d 03 00 6e 01 00 01 78 45 00 7c 02 00 7c 03 00 6a 00 00 6f 37 00 01 7c ..|.....}..n...xE.|..|..j..o7..|
0120 02 00 7c 03 00 17 64 01 00 1a 7d 04 00 7c 01 00 7c 00 00 7c 04 00 19 6a 00 00 6f 0a 00 01 7c 04 ..|...d...}..|..|..|...j..o...|.
0140 00 7d 03 00 71 20 00 01 7c 04 00 64 02 00 17 7d 02 00 71 20 00 01 57 7c 00 00 69 02 00 7c 02 00 .}..q...|..d...}..q...W|..i..|..
0160 7c 01 00 83 02 00 01 64 03 00 53 28 04 00 00 00 73 ef 00 00 00 49 6e 73 65 72 74 20 69 74 65 6d |......d..S(....s....Insert.item
0180 20 78 20 69 6e 20 6c 69 73 74 20 61 2c 20 61 6e 64 20 6b 65 65 70 20 69 74 20 73 6f 72 74 65 64 .x.in.list.a,.and.keep.it.sorted
01a0 20 61 73 73 75 6d 69 6e 67 20 61 20 69 73 20 73 6f 72 74 65 64 2e 0a 0a 20 20 20 20 49 66 20 78 .assuming.a.is.sorted.......If.x
01c0 20 69 73 20 61 6c 72 65 61 64 79 20 69 6e 20 61 2c 20 69 6e 73 65 72 74 20 69 74 20 74 6f 20 74 .is.already.in.a,.insert.it.to.t
01e0 68 65 20 72 69 67 68 74 20 6f 66 20 74 68 65 20 72 69 67 68 74 6d 6f 73 74 20 78 2e 0a 0a 20 20 he.right.of.the.rightmost.x.....
0200 20 20 4f 70 74 69 6f 6e 61 6c 20 61 72 67 73 20 6c 6f 20 28 64 65 66 61 75 6c 74 20 30 29 20 61 ..Optional.args.lo.(default.0).a
0220 6e 64 20 68 69 20 28 64 65 66 61 75 6c 74 20 6c 65 6e 28 61 29 29 20 62 6f 75 6e 64 20 74 68 65 nd.hi.(default.len(a)).bound.the
0240 0a 20 20 20 20 73 6c 69 63 65 20 6f 66 20 61 20 74 6f 20 62 65 20 73 65 61 72 63 68 65 64 2e 0a .....slice.of.a.to.be.searched..
0260 20 20 20 20 69 02 00 00 00 69 01 00 00 00 4e 28 03 00 00 00 74 04 00 00 00 4e 6f 6e 65 74 03 00 ....i....i....N(....t....Nonet..
0280 00 00 6c 65 6e 74 06 00 00 00 69 6e 73 65 72 74 28 05 00 00 00 74 01 00 00 00 61 74 01 00 00 00 ..lent....insert(....t....at....
02a0 78 74 02 00 00 00 6c 6f 74 02 00 00 00 68 69 74 03 00 00 00 6d 69 64 28 00 00 00 00 28 00 00 00 xt....lot....hit....mid(....(...
02c0 00 73 19 00 00 00 2f 73 79 73 2f 6c 69 62 2f 70 79 74 68 6f 6e 2f 62 69 73 65 63 74 2e 70 79 74 .s..../sys/lib/python/bisect.pyt
02e0 0c 00 00 00 69 6e 73 6f 72 74 5f 72 69 67 68 74 03 00 00 00 73 0e 00 00 00 00 09 0d 01 10 01 10 ....insort_right....s...........
0300 01 0e 01 1b 01 0f 01 63 04 00 00 00 05 00 00 00 03 00 00 00 43 00 00 00 73 69 00 00 00 7c 03 00 .......c............C...si...|..
0320 64 03 00 6a 08 00 6f 10 00 01 74 01 00 7c 00 00 83 01 00 7d 03 00 6e 01 00 01 78 45 00 7c 02 00 d..j..o...t..|.....}..n...xE.|..
0340 7c 03 00 6a 00 00 6f 37 00 01 7c 02 00 7c 03 00 17 64 01 00 1a 7d 04 00 7c 01 00 7c 00 00 7c 04 |..j..o7..|..|...d...}..|..|..|.
0360 00 19 6a 00 00 6f 0a 00 01 7c 04 00 7d 03 00 71 20 00 01 7c 04 00 64 02 00 17 7d 02 00 71 20 00 ..j..o...|..}..q...|..d...}..q..
0380 01 57 7c 02 00 53 28 04 00 00 00 73 80 01 00 00 52 65 74 75 72 6e 20 74 68 65 20 69 6e 64 65 78 .W|..S(....s....Return.the.index
03a0 20 77 68 65 72 65 20 74 6f 20 69 6e 73 65 72 74 20 69 74 65 6d 20 78 20 69 6e 20 6c 69 73 74 20 .where.to.insert.item.x.in.list.
03c0 61 2c 20 61 73 73 75 6d 69 6e 67 20 61 20 69 73 20 73 6f 72 74 65 64 2e 0a 0a 20 20 20 20 54 68 a,.assuming.a.is.sorted.......Th
03e0 65 20 72 65 74 75 72 6e 20 76 61 6c 75 65 20 69 20 69 73 20 73 75 63 68 20 74 68 61 74 20 61 6c e.return.value.i.is.such.that.al
0400 6c 20 65 20 69 6e 20 61 5b 3a 69 5d 20 68 61 76 65 20 65 20 3c 3d 20 78 2c 20 61 6e 64 20 61 6c l.e.in.a[:i].have.e.<=.x,.and.al
0420 6c 20 65 20 69 6e 0a 20 20 20 20 61 5b 69 3a 5d 20 68 61 76 65 20 65 20 3e 20 78 2e 20 20 53 6f l.e.in.....a[i:].have.e.>.x...So
0440 20 69 66 20 78 20 61 6c 72 65 61 64 79 20 61 70 70 65 61 72 73 20 69 6e 20 74 68 65 20 6c 69 73 .if.x.already.appears.in.the.lis
0460 74 2c 20 61 2e 69 6e 73 65 72 74 28 78 29 20 77 69 6c 6c 0a 20 20 20 20 69 6e 73 65 72 74 20 6a t,.a.insert(x).will.....insert.j
0480 75 73 74 20 61 66 74 65 72 20 74 68 65 20 72 69 67 68 74 6d 6f 73 74 20 78 20 61 6c 72 65 61 64 ust.after.the.rightmost.x.alread
04a0 79 20 74 68 65 72 65 2e 0a 0a 20 20 20 20 4f 70 74 69 6f 6e 61 6c 20 61 72 67 73 20 6c 6f 20 28 y.there.......Optional.args.lo.(
04c0 64 65 66 61 75 6c 74 20 30 29 20 61 6e 64 20 68 69 20 28 64 65 66 61 75 6c 74 20 6c 65 6e 28 61 default.0).and.hi.(default.len(a
04e0 29 29 20 62 6f 75 6e 64 20 74 68 65 0a 20 20 20 20 73 6c 69 63 65 20 6f 66 20 61 20 74 6f 20 62 )).bound.the.....slice.of.a.to.b
0500 65 20 73 65 61 72 63 68 65 64 2e 0a 20 20 20 20 69 02 00 00 00 69 01 00 00 00 4e 28 02 00 00 00 e.searched......i....i....N(....
0520 52 00 00 00 00 52 01 00 00 00 28 05 00 00 00 52 03 00 00 00 52 04 00 00 00 52 05 00 00 00 52 06 R....R....(....R....R....R....R.
0540 00 00 00 52 07 00 00 00 28 00 00 00 00 28 00 00 00 00 73 19 00 00 00 2f 73 79 73 2f 6c 69 62 2f ...R....(....(....s..../sys/lib/
0560 70 79 74 68 6f 6e 2f 62 69 73 65 63 74 2e 70 79 74 0c 00 00 00 62 69 73 65 63 74 5f 72 69 67 68 python/bisect.pyt....bisect_righ
0580 74 16 00 00 00 73 0e 00 00 00 00 0b 0d 01 10 01 10 01 0e 01 1b 01 0f 01 63 04 00 00 00 05 00 00 t....s..................c.......
05a0 00 03 00 00 00 43 00 00 00 73 79 00 00 00 7c 03 00 64 03 00 6a 08 00 6f 10 00 01 74 01 00 7c 00 .....C...sy...|..d..j..o...t..|.
05c0 00 83 01 00 7d 03 00 6e 01 00 01 78 45 00 7c 02 00 7c 03 00 6a 00 00 6f 37 00 01 7c 02 00 7c 03 ....}..n...xE.|..|..j..o7..|..|.
05e0 00 17 64 01 00 1a 7d 04 00 7c 00 00 7c 04 00 19 7c 01 00 6a 00 00 6f 0e 00 01 7c 04 00 64 02 00 ..d...}..|..|...|..j..o...|..d..
0600 17 7d 02 00 71 20 00 01 7c 04 00 7d 03 00 71 20 00 01 57 7c 00 00 69 02 00 7c 02 00 7c 01 00 83 .}..q...|..}..q...W|..i..|..|...
0620 02 00 01 64 03 00 53 28 04 00 00 00 73 ed 00 00 00 49 6e 73 65 72 74 20 69 74 65 6d 20 78 20 69 ...d..S(....s....Insert.item.x.i
0640 6e 20 6c 69 73 74 20 61 2c 20 61 6e 64 20 6b 65 65 70 20 69 74 20 73 6f 72 74 65 64 20 61 73 73 n.list.a,.and.keep.it.sorted.ass
0660 75 6d 69 6e 67 20 61 20 69 73 20 73 6f 72 74 65 64 2e 0a 0a 20 20 20 20 49 66 20 78 20 69 73 20 uming.a.is.sorted.......If.x.is.
0680 61 6c 72 65 61 64 79 20 69 6e 20 61 2c 20 69 6e 73 65 72 74 20 69 74 20 74 6f 20 74 68 65 20 6c already.in.a,.insert.it.to.the.l
06a0 65 66 74 20 6f 66 20 74 68 65 20 6c 65 66 74 6d 6f 73 74 20 78 2e 0a 0a 20 20 20 20 4f 70 74 69 eft.of.the.leftmost.x.......Opti
06c0 6f 6e 61 6c 20 61 72 67 73 20 6c 6f 20 28 64 65 66 61 75 6c 74 20 30 29 20 61 6e 64 20 68 69 20 onal.args.lo.(default.0).and.hi.
06e0 28 64 65 66 61 75 6c 74 20 6c 65 6e 28 61 29 29 20 62 6f 75 6e 64 20 74 68 65 0a 20 20 20 20 73 (default.len(a)).bound.the.....s
0700 6c 69 63 65 20 6f 66 20 61 20 74 6f 20 62 65 20 73 65 61 72 63 68 65 64 2e 0a 20 20 20 20 69 02 lice.of.a.to.be.searched......i.
0720 00 00 00 69 01 00 00 00 4e 28 03 00 00 00 52 00 00 00 00 52 01 00 00 00 52 02 00 00 00 28 05 00 ...i....N(....R....R....R....(..
0740 00 00 52 03 00 00 00 52 04 00 00 00 52 05 00 00 00 52 06 00 00 00 52 07 00 00 00 28 00 00 00 00 ..R....R....R....R....R....(....
0760 28 00 00 00 00 73 19 00 00 00 2f 73 79 73 2f 6c 69 62 2f 70 79 74 68 6f 6e 2f 62 69 73 65 63 74 (....s..../sys/lib/python/bisect
0780 2e 70 79 74 0b 00 00 00 69 6e 73 6f 72 74 5f 6c 65 66 74 2b 00 00 00 73 0e 00 00 00 00 09 0d 01 .pyt....insort_left+...s........
07a0 10 01 10 01 0e 01 1f 01 0b 01 63 04 00 00 00 05 00 00 00 02 00 00 00 43 00 00 00 73 69 00 00 00 ..........c............C...si...
07c0 7c 03 00 64 03 00 6a 08 00 6f 10 00 01 74 01 00 7c 00 00 83 01 00 7d 03 00 6e 01 00 01 78 45 00 |..d..j..o...t..|.....}..n...xE.
07e0 7c 02 00 7c 03 00 6a 00 00 6f 37 00 01 7c 02 00 7c 03 00 17 64 01 00 1a 7d 04 00 7c 00 00 7c 04 |..|..j..o7..|..|...d...}..|..|.
0800 00 19 7c 01 00 6a 00 00 6f 0e 00 01 7c 04 00 64 02 00 17 7d 02 00 71 20 00 01 7c 04 00 7d 03 00 ..|..j..o...|..d...}..q...|..}..
0820 71 20 00 01 57 7c 02 00 53 28 04 00 00 00 73 80 01 00 00 52 65 74 75 72 6e 20 74 68 65 20 69 6e q...W|..S(....s....Return.the.in
0840 64 65 78 20 77 68 65 72 65 20 74 6f 20 69 6e 73 65 72 74 20 69 74 65 6d 20 78 20 69 6e 20 6c 69 dex.where.to.insert.item.x.in.li
0860 73 74 20 61 2c 20 61 73 73 75 6d 69 6e 67 20 61 20 69 73 20 73 6f 72 74 65 64 2e 0a 0a 20 20 20 st.a,.assuming.a.is.sorted......
0880 20 54 68 65 20 72 65 74 75 72 6e 20 76 61 6c 75 65 20 69 20 69 73 20 73 75 63 68 20 74 68 61 74 .The.return.value.i.is.such.that
08a0 20 61 6c 6c 20 65 20 69 6e 20 61 5b 3a 69 5d 20 68 61 76 65 20 65 20 3c 20 78 2c 20 61 6e 64 20 .all.e.in.a[:i].have.e.<.x,.and.
08c0 61 6c 6c 20 65 20 69 6e 0a 20 20 20 20 61 5b 69 3a 5d 20 68 61 76 65 20 65 20 3e 3d 20 78 2e 20 all.e.in.....a[i:].have.e.>=.x..
08e0 20 53 6f 20 69 66 20 78 20 61 6c 72 65 61 64 79 20 61 70 70 65 61 72 73 20 69 6e 20 74 68 65 20 .So.if.x.already.appears.in.the.
0900 6c 69 73 74 2c 20 61 2e 69 6e 73 65 72 74 28 78 29 20 77 69 6c 6c 0a 20 20 20 20 69 6e 73 65 72 list,.a.insert(x).will.....inser
0920 74 20 6a 75 73 74 20 62 65 66 6f 72 65 20 74 68 65 20 6c 65 66 74 6d 6f 73 74 20 78 20 61 6c 72 t.just.before.the.leftmost.x.alr
0940 65 61 64 79 20 74 68 65 72 65 2e 0a 0a 20 20 20 20 4f 70 74 69 6f 6e 61 6c 20 61 72 67 73 20 6c eady.there.......Optional.args.l
0960 6f 20 28 64 65 66 61 75 6c 74 20 30 29 20 61 6e 64 20 68 69 20 28 64 65 66 61 75 6c 74 20 6c 65 o.(default.0).and.hi.(default.le
0980 6e 28 61 29 29 20 62 6f 75 6e 64 20 74 68 65 0a 20 20 20 20 73 6c 69 63 65 20 6f 66 20 61 20 74 n(a)).bound.the.....slice.of.a.t
09a0 6f 20 62 65 20 73 65 61 72 63 68 65 64 2e 0a 20 20 20 20 69 02 00 00 00 69 01 00 00 00 4e 28 02 o.be.searched......i....i....N(.
09c0 00 00 00 52 00 00 00 00 52 01 00 00 00 28 05 00 00 00 52 03 00 00 00 52 04 00 00 00 52 05 00 00 ...R....R....(....R....R....R...
09e0 00 52 06 00 00 00 52 07 00 00 00 28 00 00 00 00 28 00 00 00 00 73 19 00 00 00 2f 73 79 73 2f 6c .R....R....(....(....s..../sys/l
0a00 69 62 2f 70 79 74 68 6f 6e 2f 62 69 73 65 63 74 2e 70 79 74 0b 00 00 00 62 69 73 65 63 74 5f 6c ib/python/bisect.pyt....bisect_l
0a20 65 66 74 3d 00 00 00 73 0e 00 00 00 00 0b 0d 01 10 01 10 01 0e 01 1f 01 0b 01 69 ff ff ff ff 28 eft=...s..................i....(
0a40 06 00 00 00 52 09 00 00 00 52 0b 00 00 00 52 0a 00 00 00 52 08 00 00 00 74 06 00 00 00 69 6e 73 ....R....R....R....R....t....ins
0a60 6f 72 74 74 06 00 00 00 62 69 73 65 63 74 4e 28 0a 00 00 00 74 07 00 00 00 5f 5f 64 6f 63 5f 5f ortt....bisectN(....t....__doc__
0a80 52 00 00 00 00 52 08 00 00 00 52 0c 00 00 00 52 09 00 00 00 52 0d 00 00 00 52 0a 00 00 00 52 0b R....R....R....R....R....R....R.
0aa0 00 00 00 74 07 00 00 00 5f 62 69 73 65 63 74 74 0b 00 00 00 49 6d 70 6f 72 74 45 72 72 6f 72 28 ...t...._bisectt....ImportError(
0ac0 00 00 00 00 28 00 00 00 00 28 00 00 00 00 73 19 00 00 00 2f 73 79 73 2f 6c 69 62 2f 70 79 74 68 ....(....(....s..../sys/lib/pyth
0ae0 6f 6e 2f 62 69 73 65 63 74 2e 70 79 73 08 00 00 00 3c 6d 6f 64 75 6c 65 3e 01 00 00 00 73 14 00 on/bisect.pys....<module>....s..
0b00 00 00 06 02 0f 11 06 02 0f 13 06 02 0f 12 0f 14 03 01 32 01 0e 01 ..................2...