Ñò
c‹lLc @ sé d d k l Z d d k Z d d k l Z d d k Td d k Td d k l Z l Z l Z d d k
l Z l Z l
Z
d d k l Z d d k l Z d d
d d d
d d d d d d g Z d „ Z d e f d „ ƒ YZ d „ Z e i d j o
d „ Z n d „ Z d e f d „ ƒ YZ d
e f d „ ƒ YZ d e f d „ ƒ YZ d „ d „ Z d e f d „ ƒ YZ d e f d! „ ƒ YZ d" „ Z e ƒ d# „ Z! d e f d$ „ ƒ YZ" d e f d% „ ƒ YZ# d& e f d' „ ƒ YZ$ d S(( iÿÿÿÿ( t divisionN( t AddOn( t *( t sortedt sett frozenset( t Mint Maxt Extreme( t decorate( t InstanceTypet Orderingt BitmapIndext TreeBuildert split_rangest to_bitst from_bitst
RangeIndext TypeIndext
TruthIndext PointerIndext bitmap_index_typec C s> g } x1 | D]) } t | | ƒ i | ƒ | i | ƒ q
Wd S( N( R t requirest append( t obt seqt itemst key( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt define_ordering s
c B s) e Z d Z d „ Z d „ Z d „ Z RS( s+ Track inter-expression ordering constraintsc C s t ƒ | _ d S( N( R t constraints( t selft ownert expr( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt __init__- s c C s t | ƒ } | i } | | j o d SxD t | ƒ D]6 } | | j o d S| | j o | i | ƒ q4 q4 W| i | ƒ d S( N( R R t listt removet add( R t guardst ct cst oldc( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR 0 s
c C sR | i p t Sx< | i D]- } x$ | D] } | | j o Pq& q& Wt Sq Wt Sd S( N( R t Truet False( R t exprsR& t e( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt can_precede< s
( t __name__t
__module__t __doc__R! R R- ( ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR * s c C s) d } x | D] } | d | >O} q
W| S( sA Return a bitset encoding the numbers contained in sequence `ints`i i ( ( t intst bt i( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR S s
s 2.4c C sF d } x9 | D]1 } | d j o t | ƒ } n | d | >O} q
W| S( sA Return a bitset encoding the numbers contained in sequence `ints`i i i ( t long( R1 R2 R3 ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR [ s
c c sh d } x[ | oS x$ | d @p | d L} | d 7} q W| d @o | Vn | d L} | d 7} q Wd S( s3 Yield the (ascending) numbers contained in bitset ni i i i N( ( t nR2 ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR d s
c B sD e Z d Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z RS( s> Template methods for the Chambers&Chen dispatch tree algorithmc C sà | | f } | | j o | | S| p | i | | ƒ } nw | i | | ƒ \ } } t | ƒ t | ƒ j p t ‚ | d j o | i | | | ƒ } n | i | | | | ƒ } | | | <| S( N( t
build_leaft best_exprt lent AssertionErrort Nonet buildt
build_node( R t casesR+ t memoR t nodet bestt rest( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR; s
c C s
t ‚ d S( N( t NotImplementedError( R R R= t remaining_exprsR> ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR< ‘ s c C s
t ‚ d S( N( RB ( R R= R> ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR6 ” s c C s
t ‚ d S( s4 Return (seedcount,totalcases) selectivity statisticsN( RB ( R t
expressionR= ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt selectivity— s c C s d S( Ni ( ( R R RC ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt cost› s c C s{ d } d } t | ƒ } t i | ƒ } t | ƒ } g } x| o| i ƒ } t | | ƒ i | ƒ p | i | ƒ q< n | i | | ƒ \ }
} | | |
j o! | | =| i
| ƒ g } q< n | |
} | d j p
| | j o# | | } } | i | | ƒ }
q< | | j o4 | i | | ƒ } | |
j o | | } }
qNq< q< W| d j o | | =n | t | ƒ f S( N(
R: R" t dictt fromkeysR8 t popR R- R RE t extendRF R ( R R= R+ R7 t best_spreadt to_dot remainingt active_casest skippedR t branchest total_casest spreadt best_costRF ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR7 ¥ s:
( R. R/ R0 R; R< R6 RE RF R7 ( ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR
| s
c B s– e Z d Z d Z e f Z e e ƒ d „ Z d „ Z d „ Z
d „ Z d „ Z d „ Z
d „ Z d „ Z d
„ Z d „ Z e d „ Z d
„ Z RS( sC Index that computes selectivity and handles basic caching w/bitmapsi c G s t f | S( N( R ( t args( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt addon_keyÕ s c C s6 | t j o t | | ƒ } n t t | ƒ i | ƒ S( N( R R t supert __new__( t clst engineR ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyRW Ù s
c C s8 h | _ h | _ | _ h | _ g | _ h | _ d S( N( t extrat nullt all_seedst
criteria_bitst
case_seedst criteria_seeds( R RY R ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR! Þ s
c C sÇ | | i j o | i | } n. | i i | d ƒ | i | ƒ } | i | <| i } | t | ƒ j o | i | ƒ n | i | ƒ | | | I s c C s6 g } h } | } xˆ | i ƒ D][ \ \ } } \ } } | o( | t j o | d j o | o Pn | | | Bƒ | | node and `ranges`
is a sorted list of ``((lo,hi),node)`` tuples expressing non-inclusive
ranges. `dont_cares` and `seedmap` should be the return values from
a bitmap index's ``seed_bits()`` method. `node(bits)` should return
the value to be used as a node in the output; the default is to just return
a bitmap of cases.
iÿÿÿÿi ( t iteritemsR R R RI R t
isinstanceR ( t
dont_carest bitmapR? t rangest exactt currentt valt dRo Rp t lowt new( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR I s>
*
#c B s e Z d Z d „ Z RS( s Index for pointer equalityc C sy t | i ƒ } d | i | <| i o( | i | | ƒ | i d | ƒ | i S| i d | ƒ | i | | ƒ | i Sd S( Ni ( t idt refRZ Rz Ry Rw R: ( R Re Rn ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyRa u s
( R. R/ R0 Ra ( ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR r s c B s e Z d Z d „ Z RS( s) Index for simple boolean expression testsc C sV t | t ƒ o | i t j p t ‚ | i | i | ƒ | i | i | ƒ | i S( N( R„ t Valuet valueR) R9 Ry Rz ( R Re ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyRa … s '( R. R/ R0 Ra ( ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR ‚ s c C sT t | t ƒ o
| i } n4 d | t f d „ ƒ Y} | i d d !t t f } | S( Nt tmpc B s e Z RS( ( R. R/ ( ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR’ s i iÿÿÿÿ( R„ t typet __mro__t objectR
( RX t mroR’ ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyt _get_mroŒ s
c C s t | | ƒ ‚ d S( sC Get the BitmapIndex subclass to use for the given engine and `expr`N( RB ( RY R ( ( s7 /usr/lib/python2.6/site-packages/peak/rules/indexing.pyR • s c B s) e Z d Z d „ Z d „ Z d „ Z RS( s3 Index for istype(), Class(), and Classes() criteriac C sD | | i j o d St | ƒ } | i | | ƒ | i } | i } | i } xñ t | ƒ D]ã } | | j o | i | ƒ n | i | t | t ƒ ƒ t | ƒ } | | j o t
ƒ | | s:
)
R_ )
R>