- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 289 for unordered (0.2 sec)
-
api/go1.7.txt
pkg go/build, type Package struct, BinaryOnly bool pkg go/build, type Package struct, CgoFFLAGS []string pkg go/build, type Package struct, FFiles []string pkg go/doc, type Example struct, Unordered bool pkg io, const SeekCurrent = 1 pkg io, const SeekCurrent ideal-int pkg io, const SeekEnd = 2 pkg io, const SeekEnd ideal-int pkg io, const SeekStart = 0 pkg io, const SeekStart ideal-int
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Jun 28 15:08:11 GMT 2016 - 13.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/CollectorTester.java
List<T> list = Arrays.asList(inputs); doExpectCollects(expectedResult, list); if (collector.characteristics().contains(Collector.Characteristics.UNORDERED)) { Collections.reverse(list); doExpectCollects(expectedResult, list); } return this; } private void doExpectCollects(R expectedResult, List<T> inputs) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
* @throws IllegalArgumentException if the introduction of the edge would violate {@link * #allowsParallelEdges()} or {@link #allowsSelfLoops()} * @throws IllegalArgumentException if the endpoints are unordered and the network is directed */ @CanIgnoreReturnValue public ImmutableNetwork.Builder<N, E> addEdge(EndpointPair<N> endpoints, E edge) { mutableNetwork.addEdge(endpoints, edge); return this;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* edges().contains(endpoints)}. * * <p>Unlike the other {@code EndpointPair}-accepting methods, this method does not throw if the * endpoints are unordered; it simply returns false. This is for consistency with the behavior of * {@link Collection#contains(Object)} (which does not generally throw if the object cannot be
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
Iterators.transform( predecessors().iterator(), (N predecessor) -> EndpointPair.ordered(predecessor, thisNode)), Iterators.transform( successors().iterator(), (N successor) -> EndpointPair.ordered(thisNode, successor))); } else { resultWithDoubleSelfLoop = Iterators.transform(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
guava/src/com/google/common/collect/Comparators.java
return Collector.of( () -> TopKSelector.<T>least(k, comparator), TopKSelector::offer, TopKSelector::combine, TopKSelector::topK, Collector.Characteristics.UNORDERED); } /** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
return Collector.of( () -> TopKSelector.<T>least(k, comparator), TopKSelector::offer, TopKSelector::combine, TopKSelector::topK, Collector.Characteristics.UNORDERED); } /** * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
return nullptr; #else TF_Library* lib_handle = new TF_Library; static tensorflow::mutex mu(tensorflow::LINKER_INITIALIZED); static std::unordered_map<std::string, void*>* loaded_libs = new std::unordered_map<std::string, void*>(); tensorflow::Env* env = tensorflow::Env::Default(); { tensorflow::mutex_lock lock(mu); auto it = loaded_libs->find(library_filename);
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 29.4K bytes - Viewed (0) -
doc/go_mem.html
at least one of which is non-synchronizing, which are unordered by happens before (that is, neither <i>r</i> happens before <i>w</i> nor <i>w</i> happens before <i>r</i>). </p> <p> A <i>write-write data race</i> on memory location <i>x</i> consists of two write-like memory operations <i>w</i> and <i>w'</i> on <i>x</i>, at least one of which is non-synchronizing, which are unordered by happens before. </p> <p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
tensorflow/c/eager/gradients.cc
std::vector<int64_t> source_tensor_ids = MakeTensorIDList(sources); tensorflow::gtl::FlatSet<int64_t> sources_set(source_tensor_ids.begin(), source_tensor_ids.end()); std::unordered_map<int64_t, TapeTensor> sources_that_are_targets; for (int i = 0; i < target_tensor_ids.size(); ++i) { int64_t target_id = target_tensor_ids[i]; if (sources_set.find(target_id) != sources_set.end()) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 19.3K bytes - Viewed (0)