/third_party/python/Lib/ |
D | copy.py | 128 def deepcopy(x, memo=None, _nil=[]): argument 134 if memo is None: 135 memo = {} 138 y = memo.get(d, _nil) 146 y = copier(x, memo) 149 y = _deepcopy_atomic(x, memo) 153 y = copier(memo) 172 y = _reconstruct(x, memo, *rv) 176 memo[d] = y 177 _keep_alive(x, memo) # Make sure x lives at least as long as d [all …]
|
D | pickle.py | 460 self.memo = {} 474 self.memo.clear() 508 assert id(obj) not in self.memo 509 idx = len(self.memo) 511 self.memo[id(obj)] = idx, obj 545 x = self.memo.get(id(obj)) 699 if id(obj) in self.memo: 700 write(POP + self.get(self.memo[id(obj)][0])) 884 memo = self.memo 889 if id(obj) in memo: [all …]
|
/third_party/node/deps/npm/node_modules/osenv/ |
D | osenv.js | 11 function memo (key, lookup, fallback) { function 34 memo('user', function () { 41 memo('prompt', function () { 45 memo('hostname', function () { 49 memo('tmpdir', function () { 53 memo('home', function () { 57 memo('path', function () { 63 memo('editor', function () { 69 memo('shell', function () {
|
/third_party/mindspore/mindspore/ccsrc/runtime/device/ascend/ |
D | ascend_label_assign.cc | 68 … NotNull<std::set<std::shared_ptr<session::KernelGraph>> *> memo) { in AssignLabelForLabelSet() argument 69 if (memo->find(graph.get()) != memo->end()) { in AssignLabelForLabelSet() 72 memo->insert(graph.get()); in AssignLabelForLabelSet() 94 AssignLabelForLabelSet(NOT_NULL(cg.lock()), label_id, memo); in AssignLabelForLabelSet() 99 … NotNull<std::set<std::shared_ptr<session::KernelGraph>> *> memo) { in AssignLabelForGotoSwitch() argument 100 if (memo->find(graph.get()) != memo->end()) { in AssignLabelForGotoSwitch() 103 memo->insert(graph.get()); in AssignLabelForGotoSwitch() 126 AssignLabelForGotoSwitch(NOT_NULL(cg.lock()), memo); in AssignLabelForGotoSwitch() 132 std::set<std::shared_ptr<session::KernelGraph>> memo; in AssignLabel() local 134 AssignLabelForLabelSet(graph, NOT_NULL(&label_id), NOT_NULL(&memo)); in AssignLabel() [all …]
|
/third_party/node/deps/npm/node_modules/cacache/ |
D | get.js | 8 const memo = require('./lib/memoization') constant 30 ? memo.get.byDigest(cache, key, opts) 31 : memo.get(cache, key, opts) 57 memo.put.byDigest(cache, key, res, opts) 59 memo.put(cache, entry, res.data, opts) 76 ? memo.get.byDigest(cache, key, opts) 77 : memo.get(cache, key, opts) 108 memo.put.byDigest(cache, key, res, opts) 110 memo.put(cache, entry, res.data, opts) 119 const memoized = memo.get(cache, key, opts) [all …]
|
D | rm.js | 6 const memo = require('./lib/memoization') constant 14 memo.clearMemoized() 20 memo.clearMemoized() 26 memo.clearMemoized()
|
D | put.js | 5 const memo = require('./lib/memoization') constant 33 memo.put(cache, entry, data, opts) 67 memo.put(cache, entry, Buffer.concat(memoData, memoTotal), opts)
|
/third_party/node/lib/internal/util/ |
D | comparisons.js | 392 function setHasEqualElement(set, val1, strict, memo) { argument 395 if (innerDeepEqual(val1, val2, strict, memo)) { 438 function mapMightHaveLoosePrim(a, b, prim, item, memo) { argument 445 !innerDeepEqual(item, curB, false, memo)) { 448 return !a.has(altValue) && innerDeepEqual(item, curB, false, memo); 451 function setEquiv(a, b, strict, memo) { argument 489 if (!setHasEqualElement(set, val, strict, memo)) 493 !setHasEqualElement(set, val, strict, memo)) { 503 function mapHasEqualEntry(set, map, key1, item1, strict, memo) { argument 508 if (innerDeepEqual(key1, key2, strict, memo) && [all …]
|
/third_party/boost/libs/python/doc/html/numpy/_static/ |
D | underscore-1.3.1.js | 105 _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) { 110 return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator); 114 memo = value; 117 memo = iterator.call(context, memo, value, index, list); 121 return memo; 126 _.reduceRight = _.foldr = function(obj, iterator, memo, context) { 131 return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); 135 return initial ? _.reduce(reversed, iterator, memo, context) : _.reduce(reversed, iterator); 358 return _.reduce(array, function(memo, value) { argument 359 if (_.isArray(value)) return memo.concat(shallow ? value : _.flatten(value)); [all …]
|
/third_party/boost/libs/gil/doc/html/_static/ |
D | underscore-1.3.1.js | 105 _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) { 110 return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator); 114 memo = value; 117 memo = iterator.call(context, memo, value, index, list); 121 return memo; 126 _.reduceRight = _.foldr = function(obj, iterator, memo, context) { 131 return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); 135 return initial ? _.reduce(reversed, iterator, memo, context) : _.reduce(reversed, iterator); 358 return _.reduce(array, function(memo, value) { argument 359 if (_.isArray(value)) return memo.concat(shallow ? value : _.flatten(value)); [all …]
|
/third_party/boost/libs/hof/doc/html/_static/ |
D | underscore-1.3.1.js | 105 _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) { 110 return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator); 114 memo = value; 117 memo = iterator.call(context, memo, value, index, list); 121 return memo; 126 _.reduceRight = _.foldr = function(obj, iterator, memo, context) { 131 return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator); 135 return initial ? _.reduce(reversed, iterator, memo, context) : _.reduce(reversed, iterator); 358 return _.reduce(array, function(memo, value) { argument 359 if (_.isArray(value)) return memo.concat(shallow ? value : _.flatten(value)); [all …]
|
/third_party/ltp/tools/sparse/sparse-src/Documentation/sphinx/ |
D | cdoc.py | 65 def memo(self): member in Lines 76 return self.memo() 117 (n, l) = lines.memo() 297 memo = self.state.memo 298 save = memo.title_styles, memo.section_level 304 memo.title_styles, memo.section_level = save
|
/third_party/mindspore/mindspore/ccsrc/backend/session/ |
D | ascend_session.cc | 366 NotNull<std::set<KernelGraphPtr> *> memo) { in AddGraphToManager() argument 367 if (memo->find(graph) != memo->end()) { in AddGraphToManager() 370 memo->insert(graph.get()); in AddGraphToManager() 374 AddGraphToManager(NOT_NULL(child_graph.lock()), manager, memo); in AddGraphToManager() 559 std::set<KernelGraphPtr> memo; in CompileGraphImpl() local 562 AddGraphToManager(NOT_NULL(root_graph), NOT_NULL(manager), NOT_NULL(&memo)); in CompileGraphImpl() 563 memo.clear(); in CompileGraphImpl() 568 IrFusionPass(NOT_NULL(root_graph), NOT_NULL(&memo)); in CompileGraphImpl() 569 memo.clear(); in CompileGraphImpl() 571 memo.clear(); in CompileGraphImpl() [all …]
|
D | ascend_session.h | 137 …d CreateMultiBranchOutput(NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo); 139 …urseSelectKernelInfo(NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> const memo, 141 void IrFusionPass(const NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo); 142 …dwareOptimize(const NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo) const; 144 …adGraphsToDbg(const NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo) const; 146 …nStaticMemory(const NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo) const; 147 …eRefOutputMap(const NotNull<KernelGraphPtr> graph, NotNull<std::set<KernelGraphPtr> *> memo) const;
|
/third_party/python/Lib/json/ |
D | scanner.py | 26 memo = context.memo 38 _scan_once, object_hook, object_pairs_hook, memo) 69 memo.clear()
|
D | decoder.py | 137 memo=None, _w=WHITESPACE.match, _ws=WHITESPACE_STR): argument 142 if memo is None: 143 memo = {} 144 memo_get = memo.setdefault 328 self.memo = {}
|
/third_party/python/Tools/peg_generator/pegen/ |
D | metagrammar.gram | 54 Rule(rulename[0], rulename[1], Rhs(alts.alts + more_alts.alts), memo=opt) } 56 Rule(rulename[0], rulename[1], more_alts, memo=opt) } 57 | rulename memoflag? ":" alts NEWLINE { Rule(rulename[0], rulename[1], alts, memo=opt) } 66 | '(' 'memo' ')' { "memo" }
|
/third_party/libxml2/result/ |
D | dtd1.sax | 3 SAX.internalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd) 4 SAX.externalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd)
|
D | dtd1.sax2 | 3 SAX.internalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd) 4 SAX.externalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd)
|
/third_party/libxml2/result/noent/ |
D | dtd1.sax2 | 3 SAX.internalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd) 4 SAX.externalSubset(MEMO, -//SGMLSOURCE//DTD MEMO//EN, http://www.sgmlsource.com/dtds/memo.dtd)
|
/third_party/python/Modules/ |
D | _pickle.c | 620 PyMemoTable *memo; /* Memo table, keep track of the seen member 663 PyObject **memo; member 730 PyMemoTable *memo = PyMem_Malloc(sizeof(PyMemoTable)); in PyMemoTable_New() local 731 if (memo == NULL) { in PyMemoTable_New() 736 memo->mt_used = 0; in PyMemoTable_New() 737 memo->mt_allocated = MT_MINSIZE; in PyMemoTable_New() 738 memo->mt_mask = MT_MINSIZE - 1; in PyMemoTable_New() 739 memo->mt_table = PyMem_Malloc(MT_MINSIZE * sizeof(PyMemoEntry)); in PyMemoTable_New() 740 if (memo->mt_table == NULL) { in PyMemoTable_New() 741 PyMem_Free(memo); in PyMemoTable_New() [all …]
|
/third_party/python/Doc/library/ |
D | pickletools.rst | 66 .. cmdoption:: -m, --memo 68 When multiple objects are disassembled, preserve memo between 82 .. function:: dis(pickle, out=None, memo=None, indentlevel=4, annotate=0) 86 string or a file-like object. *memo* can be a Python dictionary 87 that will be used as the pickle's memo; it can be used to perform
|
D | copy.rst | 25 .. function:: deepcopy(x[, memo]) 56 * keeping a ``memo`` dictionary of objects already copied during the current 86 argument, the ``memo`` dictionary. If the :meth:`__deepcopy__` implementation needs 88 with the component as first argument and the memo dictionary as second argument. 89 The memo dictionary should be treated as an opaque object.
|
/third_party/python/Modules/clinic/ |
D | zlibmodule.c.h | 522 PyObject *memo); 530 PyObject *memo; in zlib_Compress___deepcopy__() local 533 &memo)) { in zlib_Compress___deepcopy__() 536 return_value = zlib_Compress___deepcopy___impl(self, cls, memo); in zlib_Compress___deepcopy__() 621 PyObject *memo); 629 PyObject *memo; in zlib_Decompress___deepcopy__() local 632 &memo)) { in zlib_Decompress___deepcopy__() 635 return_value = zlib_Decompress___deepcopy___impl(self, cls, memo); in zlib_Decompress___deepcopy__()
|
/third_party/python/Lib/test/ |
D | test_copy.py | 297 def __deepcopy__(self, memo=None): argument 429 memo = {} 431 y = copy.deepcopy(x, memo) 432 self.assertIs(memo[id(memo)][0], x) 435 memo = {} 437 y = copy.deepcopy(x, memo) 440 self.assertEqual(len(memo), 2) 442 memo = {} 444 y = copy.deepcopy(x, memo) 447 self.assertEqual(len(memo), 2) [all …]
|