Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 25 of 5506) sorted by relevance

12345678910>>...221

/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_algorithms/
H A Dsingle_source_shortest_path.h65 TPredecessorMap const& predecessor, in _printPath() argument
75 _printPath(g,predecessor, source, getProperty(predecessor, v), nameMap); in _printPath()
83 TPredecessorMap const& predecessor, in _printPath() argument
92 _printPath(g,predecessor, source, getProperty(predecessor, v)); in _printPath()
100 TPredecessorMap const& predecessor, in _collectEdges() argument
111 return _collectEdges(g,predecessor, source, getProperty(predecessor, v), edgeSet); in _collectEdges()
120 TPredecessorMap const& predecessor, in _collectEdges() argument
162 TPredecessorMap& predecessor, in _relax() argument
170 assignProperty(predecessor, v, u); in _relax()
201 void dagShortestPath(TPredecessorMap & predecessor, in dagShortestPath() argument
[all …]
H A Dall_pairs_shortest_path.h65 TPredecessor& predecessor, in _printAllPairsShortestPath() argument
76 … _printAllPairsShortestPath(g,predecessor, i, (TVertexDescriptor) getValue(predecessor, i*len+j)); in _printAllPairsShortestPath()
86 TPredecessor& predecessor) in _initializeAllPairs() argument
99 resize(predecessor, len * len); in _initializeAllPairs()
106 assignValue(predecessor, row*len + col, nilPred); in _initializeAllPairs()
118 assignValue(predecessor, u*len + v, u); in _initializeAllPairs()
127 TPredecessor& predecessor, in _extendShortestPaths() argument
134 TPredecessor oldPredecessor = predecessor; in _extendShortestPaths()
150 assignValue(predecessor, i*len+j,ind); in _extendShortestPaths()
181 TPredecessor & predecessor, in allPairsShortestPath() argument
[all …]
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_algorithms/
H A Dsingle_source_shortest_path.h65 TPredecessorMap const& predecessor, in _printPath() argument
75 _printPath(g,predecessor, source, getProperty(predecessor, v), nameMap); in _printPath()
83 TPredecessorMap const& predecessor, in _printPath() argument
92 _printPath(g,predecessor, source, getProperty(predecessor, v)); in _printPath()
100 TPredecessorMap const& predecessor, in _collectEdges() argument
111 return _collectEdges(g,predecessor, source, getProperty(predecessor, v), edgeSet); in _collectEdges()
120 TPredecessorMap const& predecessor, in _collectEdges() argument
162 TPredecessorMap& predecessor, in _relax() argument
170 assignProperty(predecessor, v, u); in _relax()
201 void dagShortestPath(TPredecessorMap & predecessor, in dagShortestPath() argument
[all …]
H A Dall_pairs_shortest_path.h65 TPredecessor& predecessor, in _printAllPairsShortestPath() argument
76 … _printAllPairsShortestPath(g,predecessor, i, (TVertexDescriptor) getValue(predecessor, i*len+j)); in _printAllPairsShortestPath()
86 TPredecessor& predecessor) in _initializeAllPairs() argument
99 resize(predecessor, len * len); in _initializeAllPairs()
106 assignValue(predecessor, row*len + col, nilPred); in _initializeAllPairs()
118 assignValue(predecessor, u*len + v, u); in _initializeAllPairs()
127 TPredecessor& predecessor, in _extendShortestPaths() argument
134 TPredecessor oldPredecessor = predecessor; in _extendShortestPaths()
150 assignValue(predecessor, i*len+j,ind); in _extendShortestPaths()
181 TPredecessor & predecessor, in allPairsShortestPath() argument
[all …]
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_algorithms/
H A Dsingle_source_shortest_path.h65 TPredecessorMap const& predecessor, in _printPath() argument
75 _printPath(g,predecessor, source, getProperty(predecessor, v), nameMap); in _printPath()
83 TPredecessorMap const& predecessor, in _printPath() argument
92 _printPath(g,predecessor, source, getProperty(predecessor, v)); in _printPath()
100 TPredecessorMap const& predecessor, in _collectEdges() argument
111 return _collectEdges(g,predecessor, source, getProperty(predecessor, v), edgeSet); in _collectEdges()
120 TPredecessorMap const& predecessor, in _collectEdges() argument
162 TPredecessorMap& predecessor, in _relax() argument
170 assignProperty(predecessor, v, u); in _relax()
201 void dagShortestPath(TPredecessorMap & predecessor, in dagShortestPath() argument
[all …]
H A Dall_pairs_shortest_path.h65 TPredecessor& predecessor, in _printAllPairsShortestPath() argument
76 … _printAllPairsShortestPath(g,predecessor, i, (TVertexDescriptor) getValue(predecessor, i*len+j)); in _printAllPairsShortestPath()
86 TPredecessor& predecessor) in _initializeAllPairs() argument
99 resize(predecessor, len * len); in _initializeAllPairs()
106 assignValue(predecessor, row*len + col, nilPred); in _initializeAllPairs()
118 assignValue(predecessor, u*len + v, u); in _initializeAllPairs()
127 TPredecessor& predecessor, in _extendShortestPaths() argument
134 TPredecessor oldPredecessor = predecessor; in _extendShortestPaths()
150 assignValue(predecessor, i*len+j,ind); in _extendShortestPaths()
181 TPredecessor & predecessor, in allPairsShortestPath() argument
[all …]
/dports/devel/onetbb/oneTBB-2021.4.0/src/tbb/
H A Dqueuing_rw_mutex.cpp175 if( predecessor ) { in acquire()
177 predecessor = tricky_pointer(predecessor) & ~FLAG; in acquire()
187 if( predecessor ) { in acquire()
190 if( tricky_pointer(predecessor) & FLAG ) { in acquire()
193 predecessor = tricky_pointer(predecessor) & ~FLAG; in acquire()
314 if( predecessor ) { in release()
355 release_internal_lock(*predecessor); in release()
471 queuing_rw_mutex::scoped_lock * predecessor; in upgrade_to_writer() local
474 if( predecessor ) { in upgrade_to_writer()
495 release_internal_lock(*predecessor); in upgrade_to_writer()
[all …]
/dports/net-im/mtxclient/mtxclient-0.6.0/lib/structs/events/
H A Dcreate.cpp14 from_json(const json &obj, PreviousRoom &predecessor) in from_json() argument
16 predecessor.room_id = obj.at("room_id"); in from_json()
17 predecessor.event_id = obj.at("event_id"); in from_json()
20 to_json(json &obj, const PreviousRoom &predecessor) in to_json() argument
22 obj["room_id"] = predecessor.room_id; in to_json()
23 obj["event_id"] = predecessor.event_id; in to_json()
44 create.predecessor = obj.at("predecessor").get<PreviousRoom>(); in from_json()
59 if (create.predecessor) in to_json()
60 obj["predecessor"] = *create.predecessor; in to_json()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/jfr/utilities/
H A DjfrConcurrentLinkedListHost.inline.hpp76 *predecessor = current;
93 if (cas(&(*predecessor)->_next, predecessor_next, current)) {
112 Node* predecessor; in insert_head() local
123 if (cas(&predecessor->_next, successor, node)) { in insert_head()
144 NodePtr predecessor; in insert_tail() local
153 if (mark_for_insertion(predecessor, tail)) { in insert_tail()
160 assert(predecessor != head, "invariant"); in insert_tail()
161 if (Atomic::load_acquire(&last->_next) == predecessor) { in insert_tail()
168 predecessor->_next = node; in insert_tail()
171 assert(last == predecessor, "invariant"); in insert_tail()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/
H A Disomorphvf2.py674 if predecessor in self.core_1:
678 predecessor, G1_node
683 if predecessor in self.core_2:
736 if (predecessor in self.in_1) and (predecessor not in self.core_1):
740 if (predecessor in self.in_2) and (predecessor not in self.core_2):
772 if (predecessor in self.out_1) and (predecessor not in self.core_1):
776 if (predecessor in self.out_2) and (predecessor not in self.core_2):
811 if (predecessor not in self.in_1) and (predecessor not in self.out_1):
815 if (predecessor not in self.in_2) and (predecessor not in self.out_2):
996 predecessor
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/jfr/utilities/
H A DjfrConcurrentLinkedListHost.inline.hpp77 *predecessor = current;
94 if (cas(&(*predecessor)->_next, predecessor_next, current)) {
113 Node* predecessor; in insert_head() local
125 if (cas(&predecessor->_next, successor, node)) { in insert_head()
146 NodePtr predecessor; in insert_tail() local
156 if (mark_for_insertion(predecessor, tail)) { in insert_tail()
163 assert(predecessor != head, "invariant"); in insert_tail()
164 if (Atomic::load_acquire(&last->_next) == predecessor) { in insert_tail()
171 predecessor->_next = node; in insert_tail()
174 assert(last == predecessor, "invariant"); in insert_tail()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/jfr/utilities/
H A DjfrConcurrentLinkedListHost.inline.hpp77 *predecessor = current;
94 if (cas(&(*predecessor)->_next, predecessor_next, current)) {
113 Node* predecessor; in insert_head() local
125 if (cas(&predecessor->_next, successor, node)) { in insert_head()
146 NodePtr predecessor; in insert_tail() local
156 if (mark_for_insertion(predecessor, tail)) { in insert_tail()
163 assert(predecessor != head, "invariant"); in insert_tail()
164 if (Atomic::load_acquire(&last->_next) == predecessor) { in insert_tail()
171 predecessor->_next = node; in insert_tail()
174 assert(last == predecessor, "invariant"); in insert_tail()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/base/task/common/
H A Dchecked_lock_unittest.cc116 CheckedLock predecessor; in TEST() local
118 predecessor.Acquire(); in TEST()
121 predecessor.Release(); in TEST()
128 CheckedLock predecessor; in TEST() local
132 predecessor.Acquire(); in TEST()
199 CheckedLock predecessor; in TEST() local
201 predecessor.Acquire(); in TEST()
205 predecessor.Release(); in TEST()
218 CheckedLock predecessor; in TEST() local
242 predecessor.Acquire(); in TEST()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/base/task/common/
H A Dchecked_lock_unittest.cc116 CheckedLock predecessor; in TEST() local
118 predecessor.Acquire(); in TEST()
121 predecessor.Release(); in TEST()
128 CheckedLock predecessor; in TEST() local
132 predecessor.Acquire(); in TEST()
199 CheckedLock predecessor; in TEST() local
201 predecessor.Acquire(); in TEST()
205 predecessor.Release(); in TEST()
218 CheckedLock predecessor; in TEST() local
242 predecessor.Acquire(); in TEST()
[all …]
H A Dchecked_lock_impl.cc28 const CheckedLockImpl* const predecessor) { in RegisterLock() argument
29 DCHECK_NE(lock, predecessor) << "Reentrant locks are unsupported."; in RegisterLock()
31 allowed_predecessor_map_[lock] = predecessor; in RegisterLock()
103 const CheckedLockImpl* predecessor = allowed_predecessor_map_.at(lock); in AssertSafePredecessor() local
104 if (predecessor) { in AssertSafePredecessor()
105 DCHECK(allowed_predecessor_map_.find(predecessor) != in AssertSafePredecessor()
139 CheckedLockImpl::CheckedLockImpl(const CheckedLockImpl* predecessor) in CheckedLockImpl() argument
141 DCHECK(predecessor == nullptr || !predecessor->is_universal_successor_); in CheckedLockImpl()
142 g_safe_acquisition_tracker.Get().RegisterLock(this, predecessor); in CheckedLockImpl()
/dports/graphics/enblend/enblend-enfuse-4.2/src/
H A Dfilenameparse.cc195 std::string::size_type predecessor = std::string::npos; in removeDotsCxx() local
200 predecessor == std::string::npos ? 0 : predecessor + 1; in removeDotsCxx()
202 path.substr(begin, separator - predecessor - 1); in removeDotsCxx()
209 predecessor = separator; in removeDotsCxx()
213 if (predecessor == std::string::npos) in removeDotsCxx()
225 path.erase(predecessor); in removeDotsCxx()
237 std::string::size_type predecessor = std::string::npos; in removeDotDotsCxx() local
242 predecessor == std::string::npos ? 0 : predecessor + 1; in removeDotDotsCxx()
244 path.substr(begin, separator - predecessor - 1); in removeDotDotsCxx()
255 predecessor = separator; in removeDotDotsCxx()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeProbabilityCache.java104 if (current.predecessor() == null) { in applyAsDouble()
112 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
141 Node predecessor = current.predecessor(); in findBegin() local
143 if (predecessor == null) { in findBegin()
145 } else if (predecessor.successors().count() != 1) { in findBegin()
146 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
149 } else if (predecessor == null) { in findBegin()
153 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeRelativeFrequencyCache.java105 if (current.predecessor() == null) { in applyAsDouble()
113 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
142 Node predecessor = current.predecessor(); in findBegin() local
144 if (predecessor == null) { in findBegin()
146 } else if (predecessor.successors().count() != 1) { in findBegin()
147 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
150 } else if (predecessor == null) { in findBegin()
154 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeRelativeFrequencyCache.java105 if (current.predecessor() == null) { in applyAsDouble()
113 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
142 Node predecessor = current.predecessor(); in findBegin() local
144 if (predecessor == null) { in findBegin()
146 } else if (predecessor.successors().count() != 1) { in findBegin()
147 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
150 } else if (predecessor == null) { in findBegin()
154 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeProbabilityCache.java104 if (current.predecessor() == null) { in applyAsDouble()
112 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
141 Node predecessor = current.predecessor(); in findBegin() local
143 if (predecessor == null) { in findBegin()
145 } else if (predecessor.successors().count() != 1) { in findBegin()
146 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
149 } else if (predecessor == null) { in findBegin()
153 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeRelativeFrequencyCache.java105 if (current.predecessor() == null) { in applyAsDouble()
113 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
142 Node predecessor = current.predecessor(); in findBegin() local
144 if (predecessor == null) { in findBegin()
146 } else if (predecessor.successors().count() != 1) { in findBegin()
147 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
150 } else if (predecessor == null) { in findBegin()
154 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeRelativeFrequencyCache.java105 if (current.predecessor() == null) { in applyAsDouble()
113 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
142 Node predecessor = current.predecessor(); in findBegin() local
144 if (predecessor == null) { in findBegin()
146 } else if (predecessor.successors().count() != 1) { in findBegin()
147 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
150 } else if (predecessor == null) { in findBegin()
154 current = (FixedNode) predecessor; in findBegin()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DFixedNodeRelativeFrequencyCache.java105 if (current.predecessor() == null) { in applyAsDouble()
113 ControlSplitNode split = (ControlSplitNode) current.predecessor(); in applyAsDouble()
142 Node predecessor = current.predecessor(); in findBegin() local
144 if (predecessor == null) { in findBegin()
146 } else if (predecessor.successors().count() != 1) { in findBegin()
147 …ert predecessor instanceof ControlSplitNode : "a FixedNode with multiple successors needs to be a … in findBegin() local
150 } else if (predecessor == null) { in findBegin()
154 current = (FixedNode) predecessor; in findBegin()
/dports/irc/smuxi/smuxi-1.1/lib/db4o-net/Db4objects.Db4o/Db4objects.Db4o/Foundation/
H A DHashtableBase.cs222 if (predecessor != null) in RemoveEntry()
224 predecessor._next = entry._next; in RemoveEntry()
236 HashtableObjectEntry predecessor = null; in RemoveObjectEntry()
241 RemoveEntry(predecessor, entry); in RemoveObjectEntry()
244 predecessor = entry; in RemoveObjectEntry()
253 HashtableLongEntry predecessor = null; in RemoveLongEntry()
258 RemoveEntry(predecessor, entry); in RemoveLongEntry()
261 predecessor = entry; in RemoveLongEntry()
270 HashtableIntEntry predecessor = null; in RemoveIntEntry()
275 RemoveEntry(predecessor, entry); in RemoveIntEntry()
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/icl/type_traits/
H A Dsucc_pred.hpp41 struct predecessor;
44 struct predecessor<DomainT, true> struct
46 typedef predecessor type; argument
51 struct predecessor<DomainT, false> struct
53 typedef predecessor type; argument
70 struct predecessor struct
74 return detail::predecessor in apply()

12345678910>>...221