HomeSort by relevance Sort by last modified time
    Searched refs:unique (Results 51 - 75 of 537) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/skqp/tests/
MetaDataTest.cpp 14 REPORTER_ASSERT(reporter, ref.unique());
23 REPORTER_ASSERT(reporter, !ref.unique());
28 REPORTER_ASSERT(reporter, !ref.unique());
33 REPORTER_ASSERT(reporter, !ref.unique());
35 REPORTER_ASSERT(reporter, ref.unique());
RefCntTest.cpp 32 REPORTER_ASSERT(reporter, ref->unique());
66 REPORTER_ASSERT(reporter, ref->unique());
367 REPORTER_ASSERT(r, rc->unique());
372 REPORTER_ASSERT(r, rc->unique());
375 REPORTER_ASSERT(r, !rc->unique());
378 REPORTER_ASSERT(r, rc->unique());
383 REPORTER_ASSERT(r, rc->unique());
387 REPORTER_ASSERT(r, !rc->unique());
390 REPORTER_ASSERT(r, rc->unique());
MallocPixelRefTest.cpp 109 REPORTER_ASSERT(reporter, dataPtr->unique());
111 REPORTER_ASSERT(reporter, !(dataPtr->unique()));
113 REPORTER_ASSERT(reporter, dataPtr->unique());
  /external/tensorflow/tensorflow/core/kernels/
range_sampler.h 50 // If unique=true, then we re-pick each element until we get a
52 void SampleBatch(random::SimplePhilox* rnd, bool unique,
60 // call to this function with the given parameters. If unique=true,
75 random::SimplePhilox* rnd, bool unique,
83 // "avoided_values" is only supported with unique=true. If
84 // unique=false, then avoided_values must be empty.
86 random::SimplePhilox* rnd, bool unique,
127 random::SimplePhilox* rnd, bool unique,
192 random::SimplePhilox* rnd, bool unique,
range_sampler.cc 37 void RangeSampler::SampleBatch(random::SimplePhilox* rnd, bool unique,
40 rnd, unique, batch, gtl::MutableArraySlice<float>(),
45 random::SimplePhilox* rnd, bool unique, gtl::MutableArraySlice<int64> batch,
49 SampleBatchGetExpectedCountAvoid(rnd, unique, batch, batch_expected_count,
58 // If unique=false, then this is (Probability(value) * batch_size)
61 // tries it took to get batch_size unique values.
68 // This shortcut will always be taken if unique=false
78 random::SimplePhilox* rnd, bool unique, MutableArraySlice<int64> batch,
85 if (unique) {
101 << "avoided_values only supported with unique=true"
    [all...]
  /external/tensorflow/tensorflow/lite/kernels/
unique.cc 27 namespace unique { namespace in namespace:tflite::ops::builtin
50 // The unique values are determined during evaluation, so we don't know yet
59 // Actual evaluation for the unique op.
63 // Map from value, to index in the unique elements vector.
113 "Unique index output array can only be Int32 or In64, requested: ",
147 context->ReportError(context, "Currently Unique doesn't support type: %s",
154 } // namespace unique
157 static TfLiteRegistration r = {unique::Init, unique::Free, unique::Prepare
    [all...]
  /external/skia/tests/
RefCntTest.cpp 32 REPORTER_ASSERT(reporter, ref->unique());
66 REPORTER_ASSERT(reporter, ref->unique());
367 REPORTER_ASSERT(r, rc->unique());
372 REPORTER_ASSERT(r, rc->unique());
375 REPORTER_ASSERT(r, !rc->unique());
378 REPORTER_ASSERT(r, rc->unique());
383 REPORTER_ASSERT(r, rc->unique());
387 REPORTER_ASSERT(r, !rc->unique());
390 REPORTER_ASSERT(r, rc->unique());
MallocPixelRefTest.cpp 109 REPORTER_ASSERT(reporter, dataPtr->unique());
111 REPORTER_ASSERT(reporter, !(dataPtr->unique()));
113 REPORTER_ASSERT(reporter, dataPtr->unique());
  /external/tensorflow/tensorflow/python/kernel_tests/random/
multinomial_op_big_test.py 44 indices, counts = np.unique(x, return_counts=True)
62 indices, counts = np.unique(x, return_counts=True)
85 indices, counts = np.unique(x, return_counts=True)
  /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/
NamespaceSupport.java 30 * as arguments to methods are unique symbols. The SymbolTable class
256 boolean unique = true;
261 unique = false;
265 if (unique){
268 unique = true;
  /external/epid-sdk/epid/member/tpm2/ibm_tss/
createprimary.c 79 in.inPublic.publicArea.unique.ecc.y.t.size = 0;
80 in.inPublic.publicArea.unique.ecc.x.t.size = 0;
82 in.inPublic.publicArea.unique.rsa.t.size = 0;
98 public_area.point = out.outPublic.publicArea.unique.ecc;
  /bootable/recovery/fuse_sideload/
fuse_sideload.cpp 98 static void fuse_reply(const fuse_data* fd, uint64_t unique, const void* data, size_t len) {
102 hdr.unique = unique;
147 fuse_reply(fd, hdr->unique, &out, fuse_struct_size);
180 fuse_reply(fd, hdr->unique, &out, sizeof(out));
204 fuse_reply(fd, hdr->unique, &out, sizeof(out));
214 fuse_reply(fd, hdr->unique, &out, sizeof(out));
297 outhdr.unique = hdr->unique;
479 outhdr.unique = hdr->unique
    [all...]
  /external/tensorflow/tensorflow/python/kernel_tests/
unique_op_test.py 34 y, idx = array_ops.unique(x)
38 self.assertEqual(len(tf_y), len(np.unique(x)))
45 y, idx = array_ops.unique(x, out_idx=dtypes.int64)
49 self.assertEqual(len(tf_y), len(np.unique(x)))
57 y, idx = array_ops.unique(x)
61 self.assertEqual(len(tf_y), len(np.unique(x)))
87 self.assertEqual(len(tf_y), len(np.unique(x)))
101 self.assertEqual(len(tf_y), len(np.unique(x)))
114 self.assertEqual(len(tf_y), len(np.unique(x)))
129 self.assertEqual(len(tf_y), len(np.unique(x))
    [all...]
  /external/deqp-deps/SPIRV-Tools/source/val/
validate_interfaces.cpp 63 functions.erase(std::unique(functions.begin(), functions.end()),
74 entry_points.erase(std::unique(entry_points.begin(), entry_points.end()),
  /external/grpc-grpc/test/core/end2end/fixtures/
h2_uds.cc 45 static int unique = 1; variable
55 unique++);
  /external/skia/src/gpu/vk/
GrVkCommandPool.cpp 69 SkASSERT(buffer->unique());
77 SkASSERT(buffer->unique());
  /external/skqp/src/gpu/vk/
GrVkCommandPool.cpp 69 SkASSERT(buffer->unique());
77 SkASSERT(buffer->unique());
  /external/swiftshader/third_party/SPIRV-Tools/source/val/
validate_interfaces.cpp 63 functions.erase(std::unique(functions.begin(), functions.end()),
74 entry_points.erase(std::unique(entry_points.begin(), entry_points.end()),
  /external/webrtc/webrtc/base/
linked_ptr.h 75 bool unique() const throw() {return itsPrev ? itsPrev==this : true;} function in class:rtc::linked_ptr
111 { // erase this from the list, delete if unique
112 if (unique()) delete itsPtr;
  /external/pdfium/core/fxcrt/
weak_ptr_unittest.cpp 59 UniqueTestPtr unique(&thing);
60 WeakTestPtr ptr1(std::move(unique));
87 UniqueTestPtr unique(&thing);
88 WeakTestPtr ptr1(std::move(unique));
127 UniqueTestPtr unique(&thing);
128 WeakTestPtr ptr1(std::move(unique));
  /external/syzkaller/vendor/golang.org/x/net/http2/hpack/
tables.go 17 // Each entry has a unique id that starts at one and increments for each
18 // entry that is added. This unique id is stable across evictions, meaning
19 // it can be used as a pointer to a specific entry. As in hpack, unique ids
20 // are 1-based. The unique id for ents[k] is k + evictCount + 1.
22 // Zero is not a valid unique id.
32 // byName maps a HeaderField name to the unique id of the newest entry with
33 // the same name. See above for a definition of "unique id".
36 // byNameValue maps a HeaderField name/value pair to the unique id of the newest
37 // entry with the same name and value. See above for a definition of "unique id".
115 // idToIndex converts a unique id to an HPACK index
    [all...]
  /build/blueprint/bootstrap/
writedocs.go 86 unique := 0
89 "unique": func() int {
90 unique++
91 return unique
125 {{ $collapseIndex := unique }}
153 {{$collapseIndex := unique}}
  /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/
override_threadpool_test.py 28 from tensorflow.python.data.experimental.ops import unique
48 # the TensorFlow-given display name, but it has a unique
55 num_parallel_calls=32).apply(unique.unique()))
  /external/testng/src/main/java/org/testng/internal/
MethodGroupsHelper.java 43 IAnnotationFinder finder, boolean unique)
53 runInfo, tm, forTests, unique, outIncludedMethods);
62 if (!unique || !MethodGroupsHelper.isMethodAlreadyPresent(outIncludedMethods, tm)) {
68 runInfo, tm, forTests, unique, outIncludedMethods);
81 RunInfo runInfo, ITestNGMethod tm, boolean forTests, boolean unique, List<ITestNGMethod> outIncludedMethods)
87 if (unique) {
  /external/grpc-grpc/src/python/grpcio/grpc/framework/interfaces/base/
base.py 72 @enum.unique
208 @enum.unique

Completed in 2394 milliseconds

1 23 4 5 6 7 8 91011>>