| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| copy.py | 145 def deepcopy(x, memo=None, _nil=[]):
151 if memo is None:
152 memo = {}
155 y = memo.get(d, _nil)
163 y = copier(x, memo)
170 y = _deepcopy_atomic(x, memo)
174 y = copier(memo)
190 y = _reconstruct(x, rv, 1, memo)
192 memo[d] = y
193 _keep_alive(x, memo) # Make sure x lives at least as long as
[all...] |
| pickle.py | 128 GET = 'g' # push item from memo on stack; index is string arg
131 LONG_BINGET = 'j' # push item from memo on stack; index is 4-byte arg
135 PUT = 'p' # store stack top in memo; index is string arg
204 self.memo = {}
210 """Clears the pickler's "memo".
212 The memo is the data structure that remembers which objects the
218 self.memo.clear()
228 """Store an object in the memo."""
230 # The Pickler memo is a dictionary mapping object ids to 2-tuples
231 # that contain the Unpickler memo key and the object being memoized
[all...] |
| 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/linux-x86/2.7.5/lib/python2.7/ |
| copy.py | 145 def deepcopy(x, memo=None, _nil=[]):
151 if memo is None:
152 memo = {}
155 y = memo.get(d, _nil)
163 y = copier(x, memo)
170 y = _deepcopy_atomic(x, memo)
174 y = copier(memo)
190 y = _reconstruct(x, rv, 1, memo)
192 memo[d] = y
193 _keep_alive(x, memo) # Make sure x lives at least as long as
[all...] |
| pickle.py | 128 GET = 'g' # push item from memo on stack; index is string arg
131 LONG_BINGET = 'j' # push item from memo on stack; index is 4-byte arg
135 PUT = 'p' # store stack top in memo; index is string arg
204 self.memo = {}
210 """Clears the pickler's "memo".
212 The memo is the data structure that remembers which objects the
218 self.memo.clear()
228 """Store an object in the memo."""
230 # The Pickler memo is a dictionary mapping object ids to 2-tuples
231 # that contain the Unpickler memo key and the object being memoized
[all...] |
| 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...] |
| /external/chromium_org/third_party/simplejson/ |
| scanner.py | 30 memo = context.memo
42 _scan_once, object_hook, object_pairs_hook, memo)
73 memo.clear()
|
| decoder.py | 181 object_pairs_hook, memo=None,
184 if memo is None:
185 memo = {}
186 memo_get = memo.setdefault
398 self.memo = {}
|
| _speedups.c | 60 PyObject *memo; member in struct:_PyScannerObject
998 Py_VISIT(s->memo);
[all...] |
| /external/libvorbis/lib/ |
| floor0.c | 194 void *memo,float *out){
200 if(memo){
201 float *lsp=(float *)memo;
|
| 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;
|
| /external/chromium_org/third_party/protobuf/python/google/protobuf/ |
| message.py | 70 def __deepcopy__(self, memo=None):
|
| /external/markdown/markdown/ |
| odict.py | 25 def __deepcopy__(self, memo):
27 return self.__class__([(key, deepcopy(value, memo))
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| pickletester.py | [all...] |
| test_copy.py | 202 def __deepcopy__(self, memo=None):
313 memo = {}
315 y = copy.deepcopy(x, memo)
316 self.assertTrue(memo[id(x)] is x)
333 def __deepcopy__(self, memo):
334 return C(copy.deepcopy(self.foo, memo))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| pickletester.py | [all...] |
| test_copy.py | 202 def __deepcopy__(self, memo=None):
313 memo = {}
315 y = copy.deepcopy(x, memo)
316 self.assertTrue(memo[id(x)] is x)
333 def __deepcopy__(self, memo):
334 return C(copy.deepcopy(self.foo, memo))
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| CodeGenTreeWalker.g | 467 String memo = (String)grammar.getBlockOption($start,"memoize");
468 if ( memo==null )
470 memo = (String)grammar.getOption("memoize");
472 if ( memo!=null && memo.equals("true") &&
475 $code.add("memoize", memo!=null && memo.equals("true"));
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | 415 $A(div.childNodes).inject('', function(memo, node) { return memo+node.nodeValue }) :
703 inject: function(memo, iterator, context) {
705 memo = iterator.call(context, memo, value, index);
707 return memo;
[all...] |
