Home
last modified time | relevance | path

Searched refs:inventory (Results 1 - 12 of 12) sorted by relevance

/third_party/ltp/tools/sparse/sparse-src/validation/
H A Dcompound-sizes.c17 struct inventory { struct
27 static struct inventory *get_inv(uint64_t stocknum) in get_inv()
34 struct inventory inv;
42 static struct inventory inven[100];
45 typedef struct inventory inventory_t;
48 static struct inventory *invptr;
65 struct inventory inv[10]; in main()
68 static struct inventory invtop; in main()
83 compound-sizes.c:42:25: struct inventory static [toplevel] inven[100]: compound size 19200, alignment 8
84 compound-sizes.c:51:33: struct inventory stati
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Daudit-report.js48 total: this.tree.inventory.size - 1,
53 for (const node of this.tree.inventory.values()) {
150 for (const node of this.tree.inventory.query('packageName', name)) {
305 if (this.options.audit === false || this.options.offline === true || this.tree.inventory.size === 1) {
370 for (const name of tree.inventory.query('packageName')) {
372 for (const node of tree.inventory.query('packageName', name)) {
H A Dnode.js0 // inventory, path, realpath, root, and parent
24 // node.inventory is a Map of name to a Set() of all the nodes under a given
26 // reference will remove it from the old root's inventory and add it to the new
34 const Inventory = require('./inventory.js')
167 this.inventory = new Inventory()
201 // because this.package is read when adding to inventory
567 // delete from current root inventory
616 const current = root.inventory.get(loc)
624 // set this.location and add to inventory
627 // try to find our parent/fsParent in the new root inventory
[all...]
H A Dplace-dep.js276 for (const node of target.root.inventory.query('name', this.name)) {
/third_party/jerryscript/tests/jerry/es2015/
H A Darray-prototype-find.js47 var inventory = [
57 assert (JSON.stringify (inventory.find (isCherries)) === '{"name":"cherries","quantity":5}');
60 assert (eval ("inventory.find (fruit => fruit.name === 'bananas')") === inventory[1]);
H A Darray-prototype-find-index.js47 var inventory = [
57 assert (JSON.stringify (inventory.findIndex (isCherries)) === "2");
60 assert (eval ("inventory.findIndex (fruit => fruit.name === 'bananas')") === 1);
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Drebuild.js84 nodes = tree.inventory.filter(node =>
93 nodes = tree.inventory.filter(node => filterSet.has(node))
95 nodes = tree.inventory.values()
H A Dbuild-ideal-tree.js217 for (const node of this.idealTree.inventory.values()) {
668 // XXX this could be faster by doing a series of inventory.query('name')
670 for (const node of this.idealTree.inventory.values()) {
683 const { meta, inventory } = this.idealTree
687 if (inventory.size === 0 || !ancient && !old) {
711 for (const node of inventory.values()) {
1492 for (const node of this.idealTree.inventory.values()) {
1503 for (const node of this.idealTree.inventory.values()) {
1534 for (const node of this.idealTree.inventory.values()) {
H A Dload-actual.js78 for (const node of tree.inventory.values()) {
375 for (const node of tree.inventory.values()) {
H A Dindex.js124 const node = tree.inventory.get(loc)
/third_party/node/deps/npm/lib/utils/
H A Dreify-output.js40 audited: auditReport && !auditReport.error ? actualTree.inventory.size : 0,
83 actualTree.inventory.has(d.ideal) && summary.added++
/third_party/python/Lib/test/
H A Dtest_operator.py427 inventory = [('apple', 3), ('banana', 2), ('pear', 5), ('orange', 1)]
429 self.assertEqual(list(map(getcount, inventory)), [3, 2, 5, 1])
430 self.assertEqual(sorted(inventory, key=getcount),

Completed in 7 milliseconds