| /hardware/bsp/intel/peripheral/libupm/doxy/node/generators/jsdoc/ |
| generator.js | 32 docs = _.reduce(specjs.METHODS, function(memo, methodSpec, methodName) {
33 return memo += GENERATE_METHOD(methodName, methodSpec);
35 docs = _.reduce(specjs.ENUMS, function(memo, enumSpec, enumName) {
36 return memo += GENERATE_ENUM(enumName, enumSpec);
38 docs = _.reduce(specjs.CLASSES, function(memo, classSpec, parentClass) {
39 return _.reduce(classSpec.methods, function(memo, methodSpec, methodName) {
40 return memo += GENERATE_METHOD(methodName, methodSpec, parentClass);
41 }, memo);
66 + _.reduce(spec.params, function(memo, paramSpec, paramName) {
|
| /prebuilts/gdb/darwin-x86/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
|
| /prebuilts/gdb/linux-x86/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
|
| /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...] |
| /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...] |
| /hardware/bsp/intel/peripheral/libupm/doxy/node/generators/yuidoc/ |
| generator.js | 37 docs = _.reduce(specjs.METHODS, function(memo, methodSpec, methodName) {
38 return memo += GENERATE_METHOD(methodName, methodSpec);
40 docs = _.reduce(specjs.ENUMS, function(memo, enumSpec, enumName) {
41 return memo += GENERATE_ENUM(enumName, enumSpec);
77 return _.reduce(classes, function(memo, classSpec, className) {
78 return memo
80 + _.reduce(classSpec.methods, function(memo, methodSpec, methodName) {
81 return memo += GENERATE_METHOD(methodName, methodSpec, className);
83 + _.reduce(classSpec.variables, function(memo, variableSpec, variableName) {
84 return memo += GENERATE_VAR(variableName, variableSpec, className)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/policyrep/ |
| symbol.py | 60 def __deepcopy__(self, memo):
66 memo[id(self)] = newobj
|
| /external/libvorbis/lib/ |
| floor0.c | 194 void *memo,float *out){
200 if(memo){
201 float *lsp=(float *)memo;
|
| /external/nanopb-c/generator/google/protobuf/ |
| message.py | 70 def __deepcopy__(self, memo=None):
|
| /external/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))
|
