Home
last modified time | relevance | path

Searched refs:old_nodes (Results 1 – 25 of 45) sorted by relevance

12

/dports/ftp/pavuk/pavuk-0.9.35/src/
H A Ddlhash.c224 dllist **old_nodes; in dlhash_resize() local
229 old_nodes = hash->nodes; in dlhash_resize()
239 while(old_nodes[i]) in dlhash_resize()
241 dlhash_insert(hash, old_nodes[i]->data); in dlhash_resize()
242 old_nodes[i] = dllist_remove_entry(old_nodes[i], old_nodes[i]); in dlhash_resize()
245 free(old_nodes); in dlhash_resize()
/dports/math/eprover/eprover-E-2.0/CLAUSES/
H A Dccl_formulafunc.c503 long old_nodes = TBNonVarTermNodes(terms); in FormulaSetSimplify() local
504 long gc_threshold = old_nodes*TFORMULA_GC_LIMIT; in FormulaSetSimplify()
524 old_nodes = TBNonVarTermNodes(terms); in FormulaSetSimplify()
531 if(TBNonVarTermNodes(terms)!=old_nodes) in FormulaSetSimplify()
559 long old_nodes = TBNonVarTermNodes(terms); in FormulaSetCNF() local
560 long gc_threshold = old_nodes*TFORMULA_GC_LIMIT; in FormulaSetCNF()
589 old_nodes = TBNonVarTermNodes(terms); in FormulaSetCNF()
597 if(TBNonVarTermNodes(terms)!=old_nodes) in FormulaSetCNF()
624 long old_nodes = TBNonVarTermNodes(terms); in FormulaSetCNF2() local
654 old_nodes = TBNonVarTermNodes(terms); in FormulaSetCNF2()
[all …]
/dports/cad/tochnog/Sources/Tochnog-Latest-jan-2014/
H A Dcreate.cc84 void create_node( long int old_nodes[], long int nnod, long int tmp_node_number, in create_node() argument
100 old_nodes[inod], version_from ) ) present_in_all_old_nodes = 0; in create_node()
102 length = db_len( idat, old_nodes[0], version_from ); in create_node()
114 dval = db_dbl( idat, old_nodes[0], version_from ); in create_node()
118 ival = db_int( idat, old_nodes[0], version_from ); in create_node()
H A Dmap.cc84 swit=0, ldum=0, idum[1], old_el[MNOL+1], old_nodes[MNOL], in map_element() local
111 old_nnol = length - 1; array_move( &old_el[1], old_nodes, old_nnol ); in map_element()
113 in = old_nodes[inol]; in map_element()
154 old_nodes[MNOL], weight_nodes[MNOL]; in map_node() local
172 old_nnol = length - 1; array_move( &old_el[1], old_nodes, old_nnol ); in map_node()
174 in = old_nodes[inol]; in map_node()
187 weight_nodes[weight_nnol] = old_nodes[inol]; in map_node()
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/addons/xtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/spatial/rstarvariants/xtree/
H A DAbstractXTreeNode.java94 Entry[] old_nodes = super.entries.clone(); in growSuperNode() local
95 assert old_nodes[old_nodes.length - 1] != null; in growSuperNode()
96 …super.entries = (Entry[]) java.util.Arrays.copyOfRange(old_nodes, 0, getCapacity() * 2 - 1, entrie… in growSuperNode()
97 assert super.entries.length == old_nodes.length * 2 - 1; in growSuperNode()
/dports/textproc/py-sphinx/Sphinx-3.5.2/build/lib/sphinx/
H A Dversioning.py63 old_nodes = []
76 old_nodes.append(old_node)
84 old_nodes.append(old_node)
88 for old_node, new_node in product(old_nodes, new_nodes):
/dports/textproc/py-sphinx/stage/usr/local/lib/python3.8/site-packages/sphinx/
H A Dversioning.py63 old_nodes = []
76 old_nodes.append(old_node)
84 old_nodes.append(old_node)
88 for old_node, new_node in product(old_nodes, new_nodes):
/dports/textproc/py-sphinx/Sphinx-3.5.2/sphinx/
H A Dversioning.py63 old_nodes = []
76 old_nodes.append(old_node)
84 old_nodes.append(old_node)
88 for old_node, new_node in product(old_nodes, new_nodes):
/dports/math/libsemigroups/libsemigroups-1.3.7/tests/
H A Dtest-digraph-helper.cpp30 size_t old_nodes = digraph.nr_nodes(); in add_path() local
32 for (size_t i = old_nodes; i < digraph.nr_nodes() - 1; ++i) { in add_path()
47 size_t old_nodes = digraph.nr_nodes(); in add_clique() local
50 for (size_t i = old_nodes; i < digraph.nr_nodes(); ++i) { in add_clique()
51 for (size_t j = old_nodes; j < digraph.nr_nodes(); ++j) { in add_clique()
52 digraph.add_edge(i, j, j - old_nodes); in add_clique()
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/tests/
H A Dtest-digraph.cpp33 size_t old_nodes = digraph.nr_nodes(); in add_cycle() local
35 for (size_t i = old_nodes; i < digraph.nr_nodes() - 1; ++i) { in add_cycle()
38 digraph.add_edge(digraph.nr_nodes() - 1, old_nodes, 0); in add_cycle()
51 size_t old_nodes = digraph.nr_nodes(); in add_clique() local
54 for (size_t i = old_nodes; i < digraph.nr_nodes(); ++i) { in add_clique()
55 for (size_t j = old_nodes; j < digraph.nr_nodes(); ++j) { in add_clique()
56 digraph.add_edge(i, j, j - old_nodes); in add_clique()
/dports/www/ilias/ILIAS-5.4.25/Services/WebServices/ECS/classes/Tree/
H A Dclass.ilECSCmsTreeCommandQueueHandler.php176 $old_nodes = array();
178 $old_nodes = $tree->getSubTree($root_node, true);
183 $this->log->dump($old_nodes, ilLogLevel::DEBUG);
273 foreach ((array) $old_nodes as $tmp_id => $node) {
/dports/www/ilias6/ILIAS-6.14/Services/WebServices/ECS/classes/Tree/
H A Dclass.ilECSCmsTreeCommandQueueHandler.php176 $old_nodes = array();
178 $old_nodes = $tree->getSubTree($root_node, true);
183 $this->log->dump($old_nodes, ilLogLevel::DEBUG);
273 foreach ((array) $old_nodes as $tmp_id => $node) {
/dports/sysutils/xorriso/libisoburn-1.5.0/xorriso/
H A Dsort_cmp.c391 IsoNode **old_nodes; in Xorriso_remake_hln_array() local
420 old_nodes= (IsoNode **) xorriso->hln_array; in Xorriso_remake_hln_array()
442 ret= Xorriso__hln_cmp(xorriso->hln_array[new_pt], old_nodes[old_pt]); in Xorriso_remake_hln_array()
461 if(old_nodes != NULL) { in Xorriso_remake_hln_array()
463 if(old_nodes[old_pt] != NULL) in Xorriso_remake_hln_array()
464 iso_node_unref(old_nodes[old_pt]); in Xorriso_remake_hln_array()
465 free((char *) old_nodes); in Xorriso_remake_hln_array()
/dports/math/libsemigroups/libsemigroups-1.3.7/old-benchmarks/
H A Dbench-digraph.cpp43 size_t old_nodes = digraph.nr_nodes(); in cycle() local
45 for (size_t i = old_nodes; i < digraph.nr_nodes() - 1; ++i) { in cycle()
48 digraph.add_edge(digraph.nr_nodes() - 1, old_nodes, 0); in cycle()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/display_lock/
H A Ddisplay_lock_utilities.cc398 std::set<Node*> old_nodes; in SelectionChanged() local
400 old_nodes.insert(&node); in SelectionChanged()
415 std::set<Node*>::iterator old_it = old_nodes.begin(); in SelectionChanged()
417 while (old_it != old_nodes.end() && new_it != new_nodes.end()) { in SelectionChanged()
428 while (old_it != old_nodes.end()) in SelectionChanged()
/dports/science/afni/afni-AFNI_21.3.16/src/pkundu/meica.libs/mdp/hinet/
H A Dflownode.py200 old_nodes = self._flow[:]
201 new_nodes = [node.copy() for node in old_nodes]
206 self._flow.flow = old_nodes
/dports/science/py-mdp/MDP-3.5/mdp/hinet/
H A Dflownode.py200 old_nodes = self._flow[:]
201 new_nodes = [node.copy() for node in old_nodes]
206 self._flow.flow = old_nodes
/dports/devel/libfirm/libfirm-1.21.0/ir/debug/
H A Ddbginfo.c89 ir_node **old_nodes, int n_old_nodes, in default_dbg_info_merge_sets() argument
94 dbg_info *old_db = get_irn_dbg_info(old_nodes[0]); in default_dbg_info_merge_sets()
H A Ddbginfo_t.h58 ir_node **old_nodes, int n_old_nodes,
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/display_lock/
H A Ddisplay_lock_utilities.cc479 std::set<Node*> old_nodes; in SelectionChanged() local
481 old_nodes.insert(&node); in SelectionChanged()
496 std::set<Node*>::iterator old_it = old_nodes.begin(); in SelectionChanged()
498 while (old_it != old_nodes.end() && new_it != new_nodes.end()) { in SelectionChanged()
509 while (old_it != old_nodes.end()) in SelectionChanged()
/dports/misc/mnn/MNN-1.2.0/tools/converter/source/tensorflow/
H A DTfUtils.cpp400 std::vector<NodeDef> old_nodes; in ReplaceMatchingOpTypes() local
401 MatchedNodesAsArray(*match, &old_nodes); in ReplaceMatchingOpTypes()
402 for (const NodeDef& old_node : old_nodes) { in ReplaceMatchingOpTypes()
510 std::vector<NodeDef> old_nodes; in CopyOriginalMatch() local
511 MatchedNodesAsArray(match, &old_nodes); in CopyOriginalMatch()
512 for (const NodeDef& old_node : old_nodes) { in CopyOriginalMatch()
/dports/mail/dovecot/dovecot-2.3.17/src/lib-storage/index/
H A Dindex-thread.c168 const struct mail_thread_node *old_nodes; in mail_thread_strmap_remap() local
184 old_nodes = array_get(&cache->thread_nodes, &nodes_count); in mail_thread_strmap_remap()
198 i_assert(old_nodes[i].uid == 0); in mail_thread_strmap_remap()
201 *node = old_nodes[i]; in mail_thread_strmap_remap()
216 *node = old_nodes[cache->first_invalid_msgid_str_idx + i]; in mail_thread_strmap_remap()
/dports/net/rsync/rsync-3.2.3/
H A Dhashtable.c92 void *old_nodes = tbl->nodes;
106 struct ht_int32_node *move_node = HT_NODE(tbl, old_nodes, i);
118 free(old_nodes); in CommandProvider()
/dports/mail/dovecot/dovecot-2.3.17/src/lib/
H A Dhash.c452 struct hash_node *old_nodes, *node, *next; in hash_table_resize() local
472 old_nodes = table->nodes; in hash_table_resize()
484 node = &old_nodes[i]; in hash_table_resize()
503 i_free(old_nodes); in hash_table_resize()
/dports/net/jgroups/jgroups-2.12.0/src/org/jgroups/blocks/
H A DReplCache.java580 …final List<Address> old_nodes=this.view != null? new ArrayList<Address>(this.view.getMembers()) : … in viewAccepted() local
592 if(old_nodes != null) { in viewAccepted()
595 rebalance(old_nodes, new ArrayList<Address>(new_view.getMembers())); in viewAccepted()
647 private void rebalance(List<Address> old_nodes, List<Address> new_nodes) { in rebalance() argument
649 old_func.installNodes(old_nodes); in rebalance()
675 List<Address> new_mbrs=Util.newMembers(old_nodes, new_nodes); in rebalance()

12