| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| weakref.py | 92 def __deepcopy__(self, memo):
98 new[deepcopy(key, memo)] = o
274 def __deepcopy__(self, memo):
280 new[o] = deepcopy(value, memo)
|
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| xmlrpclib.py | 31 # 2001-10-01 fl Remove containers from memo cache when done with them
604 self.memo = {}
708 if i in self.memo:
710 self.memo[i] = None
716 del self.memo[i]
722 if i in self.memo:
724 self.memo[i] = None
738 del self.memo[i]
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| weakref.py | 92 def __deepcopy__(self, memo):
98 new[deepcopy(key, memo)] = o
274 def __deepcopy__(self, memo):
280 new[o] = deepcopy(value, memo)
|
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| weakref.py | 92 def __deepcopy__(self, memo):
98 new[deepcopy(key, memo)] = o
274 def __deepcopy__(self, memo):
280 new[o] = deepcopy(value, memo)
|
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| xmlrpclib.py | 31 # 2001-10-01 fl Remove containers from memo cache when done with them
604 self.memo = {}
708 if i in self.memo:
710 self.memo[i] = None
716 del self.memo[i]
722 if i in self.memo:
724 self.memo[i] = None
738 del self.memo[i]
[all...] |
| /external/markdown/markdown/ |
| odict.py | 25 def __deepcopy__(self, memo):
27 return self.__class__([(key, deepcopy(value, memo))
|
| /external/python/cpython2/Lib/ |
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| weakref.py | 125 def __deepcopy__(self, memo):
131 new[deepcopy(key, memo)] = o
348 def __deepcopy__(self, memo):
354 new[o] = deepcopy(value, memo)
|
| xmlrpclib.py | 31 # 2001-10-01 fl Remove containers from memo cache when done with them
610 self.memo = {}
713 if i in self.memo:
715 self.memo[i] = None
721 del self.memo[i]
727 if i in self.memo:
729 self.memo[i] = None
744 del self.memo[i]
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| pickletools.py | 9 dis(pickle, out=None, memo=None, indentlevel=4)
39 The PM has two data areas, "the stack" and "the memo".
47 The memo is simply an array of objects, or it can be implemented as a dict
48 mapping little integers to objects. The memo serves as the PM's "long term
49 memory", and the little integers indexing the memo are akin to variable
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
128 efficiently by index (EXT{1,2,4}). This is akin to the memo and GET, but
129 the registry contents are predefined (there's nothing akin to the memo's
[all...] |
| sets.py | 153 def __deepcopy__(self, memo):
155 # This pre-creates the result and inserts it in the memo
162 memo[id(self)] = result
166 data[deepcopy(elt, memo)] = value
|
| xmlrpclib.py | 31 # 2001-10-01 fl Remove containers from memo cache when done with them
604 self.memo = {}
708 if i in self.memo:
710 self.memo[i] = None
716 del self.memo[i]
722 if i in self.memo:
724 self.memo[i] = None
738 del self.memo[i]
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| pickletester.py | [all...] |
| /external/libvorbis/lib/ |
| floor1.c | 606 int memo[VIF_POSIT+2]; local
612 for(i=0;i<posts;i++)memo[i]=-1; /* no neighbor yet */
645 /* eliminate repeat searches of a particular range with a memo */
646 if(memo[ln]!=hn){
650 memo[ln]=hn;
1054 static int floor1_inverse2(vorbis_block *vb,vorbis_look_floor *in,void *memo,
1063 if(memo){
1065 int *fit_value=(int *)memo;
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| pickletester.py | [all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| pickletester.py | [all...] |
