Ñò
î¡ßNc @ s¬ d Z d Z d Z d Z d Z d d k Z e i d d j o
e Z n e
Z d d k l Z l
Z
d
e f d „ ƒ YZ e e ƒ Z e e ƒ Z d e f d
„ ƒ YZ d S( sÑ Immutable integer set type.
Integer set class.
Copyright (C) 2010, David Moss.
Ported to Python 3.x.
Copyright (C) 2006, Heiko Wundram.
Released under the MIT license:
Copyright (c) 2006, Heiko Wundram.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
* The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
s Heiko Wundram s 0.2t 7s
2006-01-23iÿÿÿÿNi i ( t
_func_namet _func_doct _Infinityc B s_ e Z d Z d g Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z
d „ Z RS(
s0 Internal type used to represent infinity values.t _negc C s
| | _ d S( N( R ( t selft neg( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __init__B s c C s@ t | t t t f ƒ p t S| i o t | t ƒ o | i S( N( t
isinstancet intt _longR t NotImplementedR ( R t value( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __lt__E s
c C s% t | t t t f ƒ p t S| i S( N( R R R
R R R ( R R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __le__K s c C sA t | t t t f ƒ p t S| i p t | t ƒ o | i S( N( R R R
R R R ( R R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __gt__P s
c C s& t | t t t f ƒ p t S| i S( N( R R R
R R R ( R R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __ge__V s c C s> t | t t t f ƒ p t St | t ƒ o | i | i j S( N( R R R
R R R ( R R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __eq__[ s c C s? t | t t t f ƒ p t St | t ƒ p | i | i j S( N( R R R
R R R ( R R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __ne__` s c C s d S( Nt None( ( R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __repr__e s ( t __name__t
__module__t __doc__t __slots__R R
R R R R R R ( ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyR = s t IntSetc B sœ e Z d Z d d d d g Z d „ Z e e d „ Z d „ Z d „ Z dJ d „ Z e d
d d d
„ ƒ Z e d d d d „ ƒ Z
e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d d „ ƒ Z e d d d! d" „ ƒ Z e d# d d! d$ „ ƒ Z e d% d d! d& „ ƒ Z e d' d( d) d* „ ƒ Z e d+ d( d, d- „ ƒ Z e d. d( d/ d0 „ d1 „ ƒ Z e d2 d( d) d3 „ ƒ Z e d4 d( d5 d6 „ d7 „ ƒ Z e d8 d( d9 d: „ d; „ ƒ Z e d< d( d= d> „ ƒ Z e d? d( d@ dA „ dB „ ƒ Z [ dC „ Z e Z! dD „ Z" dE „ Z# dF „ Z$ dG „ Z% e% Z& dH „ Z' dI „ Z( RS(K sv Integer set class with efficient storage in a RLE format of ranges.
Supports minus and plus infinity in the range.t _rangest _mint _maxt _hashc O së t | ƒ d j op t | d t ƒ o\ | o t d ƒ ‚ n | d i | _ | d i | _ | d i | _ | d i | _ d Sg | _ | i d t ƒ | _ | i d t
ƒ | _ | i d j o
t | _ n | i d j o
t
| _ n | o t d ƒ ‚ n t | i t t
f ƒ p
| i t j p t d ƒ ‚ n t | i t t
f ƒ p
| i t
j p t d ƒ ‚ n | i t j o3 | i t
j o# | i | i j o t d
ƒ ‚ n t | i t t
f ƒ o | i d 7_ n xò| D]ê} t | t t
f ƒ o | | d } } n<t | t ƒ o t | ƒ d j o t d ƒ ‚ n | \ } } | d j o
| i } n | d j o
| i } n t | t t
f ƒ p
| t j p t d
ƒ ‚ n t | t t
f ƒ p
| t
j p t d ƒ ‚ n | t j o! | t
j o | | j o qïn t | t t
f ƒ o | d 7} q[n
t d ƒ ‚ | | i j o qïn | | i j o
| i } n | | i j o qïn | | i j o
| i } n | i i | | f ƒ qïW| i ƒ d S( s Initialize an integer set. The constructor accepts an unlimited
number of arguments that may either be tuples in the form of
(start, stop) where either start or stop may be a number or None to
represent maximum/minimum in that direction. The range specified by
(start, stop) is always inclusive (differing from the builtin range
operator).
Keyword arguments that can be passed to an integer set are min and
max, which specify the minimum and maximum number in the set,
respectively. You can also pass None here to represent minus or plus
infinity, which is also the default.
i i s* No keyword arguments for copy constructor.Nt mint maxs Invalid keyword argument.s Invalid type of min argument.s Invalid type of max argument.s$ Minimum is not smaller than maximum.i s$ Invalid tuple, must be (start,stop).s Invalid type of tuple start.s Invalid type of tuple stop.s Invalid argument.( t lenR R t
ValueErrorR R R R t popt _MININFt _MAXINFR R R
t TypeErrort tuplet appendt
_normalize( R t argst kwargst argt startt stop( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyR s st '
))
##
c c s‘ | } h t d 6t d 6} d t | ƒ d t | ƒ } } d \ } }
x!| | j p
|
| j o| | j o~ |
| j o- | | d ?| d @| |
d ?|
d @j p
|
| j o7 | | d ?| d @d | d @ } } }
| d 7} n4 | |
d ?|
d @d |
d @ } } }
|
d 7}
| | j o- | | j o Pn | | | f f V| } n |
| | R ( R RA t coercedt newsett statesR, R- ( t pall( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt f s&
"" t boolc sº | i | ƒ } | t j o t S| d } t | i | i ƒ } t | i | i ƒ } ˆ } xW | i | i | i | | ƒ D]7 \ } \ } } ˆ | ƒ p t S| p
ˆ | ƒ } q{ W| S( Ni ( RB R R R R R R< R R0 ( R RA RE R R t foundRG R, R- ( RH t pany( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRI . s
s# Invalid type of function to create.( R! R R ( t namet typet docRH RL RI ( ( RL RH s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt _make_function s
t __and__RC s& Intersection of two sets as a new set.c C s | d o | d S( R. R/ ( ( t s( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt F s t __rand__c C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS I s t intersectionc C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS L s t __or__s Union of two sets as a new set.c C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS Q s t __ror__c C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS T s t unionc C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS W s t __sub__s$ Difference of two sets as a new set.c C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS \ s t __rsub__c C s | d o | d S( R/ R. ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS _ s t
differencec C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS b s t __xor__s. Symmetric difference of two sets as a new set.c C s | d | d AS( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS g s t __rxor__c C s | d | d AS( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS j s t symmetric_differencec C s | d | d AS( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS m s t __contains__RJ s* Returns true if self is superset of other.c C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS r s t issubsets( Returns true if self is subset of other.c C s | d p | d S( R/ R. ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS u s t istruesubsets- Returns true if self is true subset of other.c C s | d p | d S( R/ R. ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS x s c C s | d o | d S( R/ R. ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS y s t
issupersetc C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS | s t istruesupersets/ Returns true if self is true superset of other.c C s | d p | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS s c C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS € s t overlapss) Returns true if self overlaps with other.c C s t S( ( t True( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS ƒ s c C s | d o | d S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS „ s R s' Returns true if self is equal to other.c C s | d | d A S( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS ‰ s R s+ Returns true if self is different to other.c C s t S( ( Re ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS Œ s c C s | d | d AS( R. R/ ( ( RR ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyRS s c C s½ | i i | i ƒ } | i | _ | i | _ g | _ | i } xJ | i D]? } | | d j o( | i i | | d f ƒ | d } qI qI W| | i j o | i i | | i f ƒ n | S( s Inverse of set as a new set.i i ( R? RD R R R R' ( R RF t laststopt r( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt inverse“ s
c C s | i S( s¦ Returns a hash value representing this integer set. As the set is
always stored normalized, the hash value is guaranteed to match for
matching ranges.( R ( R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __hash__¨ s c C s | i p d S| i d d t j p | i d d t j o t d ƒ ‚ n d } x' | i D] } | | d | d 7} q_ W| d j o t d ƒ ‚ n | S( så Get length of this integer set. In case the length is larger than
2**31 (including infinitely sized integer sets), it raises an
OverflowError. This is due to len() restricting the size to
0 <= len < 2**31.i iÿÿÿÿi s Infinitely sized integer set.i i s Integer set bigger than 2**31.l ( R R# R$ t
OverflowError( R t rlenRg ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __len__² s
0
c C sx | i p d S| i d d t j p | i d d t j o d Sd } x' | i D] } | | d | d 7} qT W| S( s< Returns the length of this integer set as an integer. In case the
length is infinite, returns -1. This function exists because of a
limitation of the builtin len() function which expects values in
the range 0 <= len < 2**31. Use this function in case your integer
set might be larger.i iÿÿÿÿi ( R R# R$ ( R Rk Rg ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyR Ã s
0
c C s
t | i ƒ S( s< Returns true if this integer set contains at least one item.( RJ R ( R ( ( s5 /usr/lib/python2.6/site-packages/netaddr/ip/intset.pyt __nonzero__Ó s c c s( g } xÓ | i D]È } | d t j oS | d t j o# | i d d g d d g f ƒ qØ | i | d d d g ƒ q | d t j o | i | d d g ƒ q | d } x% | | d j o | V| d 7} q³ Wq W| oA x> t o2 x+ | D]# } | d V| d c | d 7 s
,