-=[ Mr. Bumblebee ]=-
_Indonesia_
ó
î:ïNc @@ sÄ d Z d d l m Z d d l Z d d l Z d d l Z d d l m Z d d l m Z e j
e j d ƒ j d „ Z
d „ Z d „ Z d
„ Z d d i d „ Z d „ Z d
„ Z d „ Z d S( s4 Python implementations of Dirstate Helper functions.i ( t absolute_importN( t errors( t DirStates >6Lc C@ sU | | | j d @t | j ƒ d @t | j ƒ d @| j d @| j d @| j ƒ ƒ d S( s Convert stat values into a packed representation
Not all of the fields from the stat included are strictly needed, and by
just encoding the mtime and mode a slight speed increase could be gained.
However, using the pyrex version instead is a bigger win.
Iÿÿÿÿ iÿÿÿÿ( t st_sizet intt st_mtimet st_ctimet st_devt st_inot st_mode( t stt _b64t _pack( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt pack_stat s c
C@ sX t j d t j | ƒ ƒ \ } } } } } } t d | d | d | d | d | d | ƒ S( s{ Turn a packed_stat back into the stat fields.
This is meant as a debugging tool, should not be used in real code.
s >6LR R R R R R ( t structt unpackt binasciit
a2b_base64t dict( t packed_statR R R R R R ( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt _unpack_stat, s -c C@ si t | ƒ } d } xP | | k rd | | d } | | } t | | ƒ d k r[ | d } q | } q W| S( sh Return the index where to insert path into paths.
This uses the dirblock sorting. So all children in a directory come before
the children of children. For example::
a/
b/
c
d/
e
b-c
d-e
a-a
a=c
Will be sorted as::
a
a-a
a=c
a/b
a/b-c
a/d
a/d-e
a/b/c
a/d/e
:param paths: A list of paths to search through
:param path: A single path to insert
:return: An offset where 'path' can be inserted.
:seealso: bisect.bisect_left
i i i ( t lent _cmp_path_by_dirblock( t pathst patht hit lot midt cur( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt _bisect_path_left7 s !
c C@ si t | ƒ } d } xP | | k rd | | d } | | } t | | ƒ d k rW | } q | d } q W| S( sŠ Return the index where to insert path into paths.
This uses a path-wise comparison so we get::
a
a-b
a=b
a/b
Rather than::
a
a-b
a/b
a=b
:param paths: A list of paths to search through
:param path: A single path to insert
:return: An offset where 'path' can be inserted.
:seealso: bisect.bisect_right
i i i ( R R ( R R R R R R ( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt _bisect_path_righte s
c C@ sã | d k r t | ƒ } n y | | } Wn* t k
rU | j d ƒ } | | | <n Xx† | | k rÞ | | d } | | d } y | | } Wn* t k
r» | j d ƒ } | | | <n X| | k rÕ | d } qY | } qY W| S( sR Return the index where to insert dirname into the dirblocks.
The return value idx is such that all directories blocks in dirblock[:idx]
have names < dirname, and all blocks in dirblock[idx:] have names >=
dirname.
Optional args lo (default 0) and hi (default len(dirblocks)) bound the
slice of a to be searched.
t /i i i N( t NoneR t KeyErrort split( t dirblockst dirnameR R t cachet
dirname_splitR R t cur_split( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt bisect_dirblock„ s&
c C@ s{ t | t ƒ s. t d t | ƒ | f ƒ ‚ n t | t ƒ s\ t d t | ƒ | f ƒ ‚ n t | j d ƒ | j d ƒ ƒ S( s% Compare two paths directory by directory.
This is equivalent to doing::
cmp(path1.split('/'), path2.split('/'))
The idea is that you should compare path components separately. This
differs from plain ``cmp(path1, path2)`` for paths like ``'a-b'`` and
``a/b``. "a-b" comes after "a" but would come before "a/b" lexically.
:param path1: first path
:param path2: second path
:return: negative number if ``path1`` comes first,
0 if paths are equal,
and positive number if ``path2`` sorts first
s* 'path1' must be a plain string, not %s: %rs* 'path2' must be a plain string, not %s: %rR ( t
isinstancet strt TypeErrort typet cmpR" ( t path1t path2( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt cmp_by_dirs£ s c C@ sà t | t ƒ s. t d t | ƒ | f ƒ ‚ n t | t ƒ s\ t d t | ƒ | f ƒ ‚ n t j j | ƒ \ } } | j d ƒ | f } t j j | ƒ \ } } | j d ƒ | f } t | | ƒ S( sÚ Compare two paths based on what directory they are in.
This generates a sort order, such that all children of a directory are
sorted together, and grandchildren are in the same order as the
children appear. But all grandchildren come after all children.
:param path1: first path
:param path2: the second path
:return: negative number if ``path1`` comes first,
0 if paths are equal
and a positive number if ``path2`` sorts first
s* 'path1' must be a plain string, not %s: %rs* 'path2' must be a plain string, not %s: %rR ( R) R* R+ R, t osR R" R- ( R. R/ t dirname1t basename1t key1t dirname2t basename2t key2( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyR ½ s
c C@ sÛ | j j | j ƒ | j j ƒ } | j d ƒ } | j ƒ } | d k re t j | d | f ƒ ‚ n d } | j ƒ } d | } | j ƒ } | | j
} t | ƒ } | | | k rå t j | d | | | | | j
| f ƒ ‚ n | d k r|t }
t
| ƒ j } x t | ƒ D]
} | ƒ qWd g f d g f g | _ | j d d }
d } |
j } x
t | j
ƒ D]ü } | ƒ } | ƒ } | ƒ } | | k rÊg }
| } | j j | |
f ƒ |
j } n | | | f | ƒ | ƒ |
| ƒ ƒ | ƒ d k | ƒ f | ƒ | ƒ |
| ƒ ƒ | ƒ d k | ƒ f g f } | ƒ } | d k rat d | ƒ ‚ n | | ƒ qoW| j ƒ nO | j ƒ } g t | | | ƒ D] } | | | | | !ƒ ^ q›} | j | ƒ t j | _ d
S( s, Read in the dirblocks for the given DirState object.
This is tightly bound to the DirState internal representation. It should be
thought of as a member function, which is only separated out so that we can
re-write it in pyrex.
:param state: A DirState object.
:return: None
t t s trailing garbage: %ri sG field count incorrect %s != %s, entry_size=%s, num_entries=%s fields=%ri t ys
s trailing garbage in dirstate: %rN( t _state_filet seekt _end_of_headert readR" t popR t DirstateCorruptt _num_present_parentst _fields_per_entryt _num_entriesR R t itert nextt xranget
_dirblockst appendt
ValueErrort" _split_root_dirblock_into_contentst _get_fields_to_entryt _entries_to_current_stateR t IN_MEMORY_UNMODIFIEDt _dirblock_state( t statet textt fieldst trailingR t num_present_parentst
tree_countt
entry_sizet expected_field_countt field_countt _intRE t xt
current_blockt current_dirnamet append_entryt countR$ t namet file_idt entryt fields_to_entryt post entries( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt _read_dirblocks× sr
3
( t __doc__t
__future__R R R1 R t bzrlibR t bzrlib.dirstateR t
b2a_base64t Structt packR
R R R R R( R0 R Rd ( ( ( s? /usr/lib/python2.7/dist-packages/bzrlib/_dirstate_helpers_py.pyt <module> s
.
Copyright © 2017 || Recoded By Mr.Bumblebee