Home
last modified time | relevance | path

Searched refs:existing_node (Results 1 – 25 of 64) sorted by relevance

123

/dports/devel/pear-Structure_LinkedList/Structures_LinkedList-0.2.2/Structures/LinkedList/
H A DDouble.php173 * @param Structures_LinkedList_DoubleNode $existing_node Reference position node
178 public function insertNode($new_node, $existing_node, $before = false)
188 $previous_node = $existing_node->previous();
197 $new_node->setNext($existing_node);
198 $existing_node->setPrevious($new_node);
203 $new_node->setPrevious($existing_node);
204 $next_node = $existing_node->next();
212 $existing_node->setNext($new_node);
H A DSingle.php321 * @param Structures_LinkedList_SingleNode $existing_node Reference
328 public function insertNode($new_node, $existing_node, $before = false)
339 if ($existing_node === $this->root_node) {
342 $previous_node = $this->_getPreviousNode($existing_node);
346 $new_node->setNext($existing_node);
351 $next_node = $existing_node->next();
355 $existing_node->setNext($new_node);
/dports/mail/thunderbird/thunderbird-91.8.0/xpcom/ds/tools/
H A Dincremental_dafsa.py336 existing_node = self.stack[self.prefix_index]
337 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
344 existing_node.remove_parent(self.stack[self.prefix_index])
359 existing_node = self.stack[self.prefix_index]
360 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
377 existing_node = self.stack[self.prefix_index]
378 if not self.suffix_cursor.find_inside_of_prefix_replacement(existing_node):
385 existing_node.remove_parent(self.stack[self.prefix_index])
401 existing_node = self.stack[self.prefix_index]
417 existing_node = self.stack[self.prefix_index]
[all …]
/dports/www/firefox/firefox-99.0/xpcom/ds/tools/
H A Dincremental_dafsa.py336 existing_node = self.stack[self.prefix_index]
337 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
344 existing_node.remove_parent(self.stack[self.prefix_index])
359 existing_node = self.stack[self.prefix_index]
360 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
377 existing_node = self.stack[self.prefix_index]
378 if not self.suffix_cursor.find_inside_of_prefix_replacement(existing_node):
385 existing_node.remove_parent(self.stack[self.prefix_index])
401 existing_node = self.stack[self.prefix_index]
417 existing_node = self.stack[self.prefix_index]
[all …]
/dports/www/firefox-esr/firefox-91.8.0/xpcom/ds/tools/
H A Dincremental_dafsa.py336 existing_node = self.stack[self.prefix_index]
337 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
344 existing_node.remove_parent(self.stack[self.prefix_index])
359 existing_node = self.stack[self.prefix_index]
360 if not self.suffix_cursor.find_end_of_prefix_replacement(existing_node):
377 existing_node = self.stack[self.prefix_index]
378 if not self.suffix_cursor.find_inside_of_prefix_replacement(existing_node):
385 existing_node.remove_parent(self.stack[self.prefix_index])
401 existing_node = self.stack[self.prefix_index]
417 existing_node = self.stack[self.prefix_index]
[all …]
/dports/www/elixir-phoenix_pubsub/phoenix_pubsub-1.0.2/test/phoenix/tracker/
H A Dreplica_test.exs31 existing_node = Replica.new("existing") |> Map.put(:status, status)
32 assert {replicas, ^existing_node, updated_node} =
33 Replica.put_heartbeat(%{ "existing" => existing_node}, Replica.ref(existing_node))
36 assert updated_node.name == existing_node.name
37 assert updated_node.vsn == existing_node.vsn
38 assert updated_node.last_heartbeat_at != existing_node.last_heartbeat_at
/dports/games/solarus/solarus-f43727b232b3ed13d98440a845e2a29e470e4f0d/src/movements/
H A DPathFinding.cpp205 Node* existing_node = &open_list[new_node.index]; in compute_path() local
207 if (new_node.previous_cost < existing_node->previous_cost) { in compute_path()
208 existing_node->previous_cost = new_node.previous_cost; in compute_path()
209 existing_node->total_cost = existing_node->previous_cost + existing_node->heuristic; in compute_path()
210 existing_node->parent_index = index; in compute_path()
/dports/www/chromium-legacy/chromium-88.0.4324.182/chrome/browser/ui/bookmarks/
H A Dbookmark_editor.cc61 node_type = existing_node->type(); in GetNodeType()
81 existing_node->type() == BookmarkNode::FOLDER) ? in GetWindowTitleId()
99 details.existing_node = node; in EditNode()
143 const BookmarkNode* node = details.existing_node; in ApplyEditsWithNoFolderChange()
165 const BookmarkNode* node = details.existing_node; in ApplyEditsWithPossibleFolderChange()
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/bindings/ruby/lib/
H A Dfdbdirectory.rb305 existing_node = find(tr, path).prefetch_metadata(tr)
307 if existing_node.exists?
308 if existing_node.is_in_partition?
309 subpath = existing_node.get_partition_subpath
310 …existing_node.get_contents(self).directory_layer.create_or_open_internal(tr, subpath, allow_create…
313 open_directory(path, options, existing_node)
321 def open_directory(path, options, existing_node) argument
322 if options[:layer] and !options[:layer].empty? and options[:layer] != existing_node.layer
325 existing_node.get_contents(self)
/dports/lang/ruby26/ruby-2.6.9/lib/rubygems/resolver/molinillo/lib/molinillo/
H A Dresolution.rb314 existing_node = activated.vertex_named(name)
315 if existing_node.payload
316 debug(depth) { "Found existing spec (#{existing_node.payload})" }
317 attempt_to_activate_existing_spec(existing_node)
326 def attempt_to_activate_existing_spec(existing_node) argument
327 existing_spec = existing_node.payload
334 debug(depth) { "Unsatisfied by existing spec (#{existing_node.payload})" }
/dports/x11-wm/wayfire/wayfire-0.7.0/plugins/tile/
H A Dtile-plugin.cpp376 auto existing_node = wf::tile::view_node_t::get_node(view); local
377 if (existing_node)
379 detach_view(existing_node);
396 auto existing_node = wf::tile::view_node_t::get_node(ev->view); in __anonb4dfb0b90d02() local
398 if (ev->state && existing_node) in __anonb4dfb0b90d02()
400 detach_view(existing_node); in __anonb4dfb0b90d02()
445 auto existing_node = tile::view_node_t::get_node(view); in __anonb4dfb0b90e02() local
446 if (existing_node) in __anonb4dfb0b90e02()
448 detach_view(existing_node); in __anonb4dfb0b90e02()
/dports/textproc/pear-File_MARC/File_MARC-1.4.1/File/MARC/
H A DList.php113 * @param mixed $existing_node Reference position node
118 public function insertNode($new_node, $existing_node, $before = false) argument
121 $exist_pos = $existing_node->getPosition();
/dports/databases/py-ormar/ormar-0.10.23/ormar/models/
H A Dtraversible.py36 existing_node = self.find(
39 if not existing_node:
47 return existing_node # pragma: no cover
/dports/emulators/yuzu/yuzu-0b47f7a46/externals/dynarmic/src/common/
H A Dintrusive_list.h157 auto existing_node = location.AsNodePointer(); in insert_before() local
159 new_node->next = existing_node; in insert_before()
160 new_node->prev = existing_node->prev; in insert_before()
161 existing_node->prev->next = new_node; in insert_before()
162 existing_node->prev = new_node; in insert_before()
/dports/emulators/citra/citra-ac98458e0/externals/dynarmic/src/common/
H A Dintrusive_list.h157 auto existing_node = location.AsNodePointer(); in insert_before() local
159 new_node->next = existing_node; in insert_before()
160 new_node->prev = existing_node->prev; in insert_before()
161 existing_node->prev->next = new_node; in insert_before()
162 existing_node->prev = new_node; in insert_before()
/dports/emulators/citra-qt5/citra-ac98458e0/externals/dynarmic/src/common/
H A Dintrusive_list.h157 auto existing_node = location.AsNodePointer(); in insert_before() local
159 new_node->next = existing_node; in insert_before()
160 new_node->prev = existing_node->prev; in insert_before()
161 existing_node->prev->next = new_node; in insert_before()
162 existing_node->prev = new_node; in insert_before()
/dports/audio/musicpd/mpd-0.23.6/src/util/
H A DIntrusiveList.hxx394 auto &existing_node = ToNode(*p); in insert() local
397 existing_node.prev->next = &new_node; in insert()
398 new_node.prev = existing_node.prev; in insert()
399 existing_node.prev = &new_node; in insert()
400 new_node.next = &existing_node; in insert()
/dports/devel/py-telepath/telepath-0.2/telepath/
H A D__init__.py318 existing_node = self.nodes[obj_id]
329 if existing_node.id is None:
331 existing_node.id = self.next_id
334 return existing_node
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/gn/tools/gn/
H A Dinherited_libraries.cc53 Node& existing_node = insert_result.first->second; in Append() local
54 existing_node.is_public = true; in Append()
/dports/www/chromium-legacy/chromium-88.0.4324.182/tools/gn/src/gn/
H A Dinherited_libraries.cc53 Node& existing_node = insert_result.first->second; in Append() local
54 existing_node.is_public = true; in Append()
/dports/devel/gn/gn-1962/src/gn/
H A Dinherited_libraries.cc53 Node& existing_node = insert_result.first->second; in Append() local
54 existing_node.is_public = true; in Append()
/dports/net/pacemaker2/pacemaker-Pacemaker-2.1.1/lib/cluster/
H A Dmembership.c659 crm_node_t *existing_node = NULL; in remove_conflicting_peer() local
670 while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &existing_node)) { in remove_conflicting_peer()
671 if (existing_node->id > 0 in remove_conflicting_peer()
672 && existing_node->id != node->id in remove_conflicting_peer()
673 && existing_node->uname != NULL in remove_conflicting_peer()
674 && strcasecmp(existing_node->uname, node->uname) == 0) { in remove_conflicting_peer()
676 if (crm_is_peer_active(existing_node)) { in remove_conflicting_peer()
681 existing_node->id, existing_node->uname, node->id); in remove_conflicting_peer()
/dports/net/pacemaker1/pacemaker-Pacemaker-1.1.24/lib/cluster/
H A Dmembership.c652 crm_node_t *existing_node = NULL; in crm_remove_conflicting_peer() local
665 while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &existing_node)) { in crm_remove_conflicting_peer()
666 if (existing_node->id > 0 in crm_remove_conflicting_peer()
667 && existing_node->id != node->id in crm_remove_conflicting_peer()
668 && existing_node->uname != NULL in crm_remove_conflicting_peer()
669 && strcasecmp(existing_node->uname, node->uname) == 0) { in crm_remove_conflicting_peer()
671 if (crm_is_peer_active(existing_node)) { in crm_remove_conflicting_peer()
676 existing_node->id, existing_node->uname, node->id); in crm_remove_conflicting_peer()
/dports/devel/bam/bam-0.4.0/src/
H A Ddep_cpp.c113 struct NODE *existing_node = node_find_byhash(node->graph, cachenode->hashid); in cachehit_callback() local
114 if(existing_node) in cachehit_callback()
116 struct NODE *newnode = node_add_dependency_withnode(node, existing_node); in cachehit_callback()
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/bindings/python/fdb/
H A Ddirectory_impl.py247 existing_node = self._find(tr, path).prefetch_metadata(tr)
248 if existing_node.exists():
249 if existing_node.is_in_partition():
250 subpath = existing_node.get_partition_subpath()
251 return existing_node.get_contents(self)._directory_layer._create_or_open_internal(
258 if layer and existing_node.layer() != layer:
261 return existing_node.get_contents(self)

123