| /external/tensorflow/tensorflow/core/framework/ |
| D | tensor_slice_test.cc | 32 EXPECT_TRUE(s.IsFull()); in TEST()
36 EXPECT_TRUE(s.IsFull()); in TEST()
46 EXPECT_TRUE(!s.IsFull()); in TEST()
64 EXPECT_TRUE(!s.IsFull()); in TEST()
78 EXPECT_TRUE(!s.IsFull()); in TEST()
110 EXPECT_TRUE(!s.IsFull()); in TEST()
291 TEST(TensorSliceTest, IsFull) { in TEST() argument
293 EXPECT_TRUE(slice.IsFull()); in TEST()
296 EXPECT_TRUE(slice2.IsFull()); in TEST()
299 EXPECT_TRUE(!slice3.IsFull()); in TEST()
|
| D | tensor_slice.h | 102 bool IsFull() const;
|
| D | tensor_slice.cc | 85 bool TensorSlice::IsFull() const { in IsFull() function in tensorflow::TensorSlice
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/ |
| D | weighted_quantiles_buffer_test.cc | 44 EXPECT_FALSE(buffer.IsFull()); in TEST_F()
63 EXPECT_TRUE(buffer.IsFull()); in TEST_F()
65 EXPECT_FALSE(buffer.IsFull()); in TEST_F()
83 EXPECT_TRUE(buffer.IsFull()); in TEST_F()
|
| D | weighted_quantiles_buffer.h | 73 QCHECK(!IsFull()) << "Buffer already full: " << max_size_; in PushEntry()
110 bool IsFull() const { return vec_.size() >= max_size_; } in IsFull() function
|
| D | weighted_quantiles_stream.h | 98 if (buffer_.IsFull()) { in PushEntry()
|
| /external/libchrome/base/trace_event/ |
| D | trace_buffer.cc | 71 bool IsFull() const override { return false; } in IsFull() function in base::trace_event::__anonfbd835010111::TraceBufferRingBuffer
188 bool IsFull() const override { return chunks_.size() >= max_chunks_; } in IsFull() function in base::trace_event::__anonfbd835010111::TraceBufferVector
260 DCHECK(!IsFull()); in AddTraceEvent()
281 if (IsFull() && num_cached_estimated_events == size()) { in EstimateTraceMemoryOverhead()
289 if (IsFull()) { in EstimateTraceMemoryOverhead()
|
| D | trace_buffer.h | 27 bool IsFull() const { return next_free_ == kTraceBufferChunkSize; } in IsFull() function
66 virtual bool IsFull() const = 0;
|
| D | trace_log.cc | 277 if (chunk_ && chunk_->IsFull()) { in AddTraceEvent()
785 return logged_events_->IsFull(); in BufferIsFull()
793 if (thread_shared_chunk_ && thread_shared_chunk_->IsFull()) { in AddEventToThreadSharedChunkWhileLocked()
818 if (logged_events_->IsFull()) { in CheckIfBufferIsFullWhileLocked()
|
| /external/pigweed/pw_trace_tokenized/ |
| D | trace_test.cc | 573 EXPECT_FALSE(queue.IsFull()); in TEST()
578 EXPECT_FALSE(queue.IsFull()); in TEST()
588 EXPECT_TRUE(queue.IsFull()); in TEST()
598 EXPECT_FALSE(queue.IsFull()); in TEST()
608 EXPECT_TRUE(queue.IsFull()); in TEST()
612 EXPECT_FALSE(queue.IsFull()); in TEST()
|
| /external/libchrome/base/metrics/ |
| D | persistent_memory_allocator_unittest.cc | 211 EXPECT_FALSE(allocator_->IsFull()); in TEST_F()
353 } while (!allocator_->IsCorrupt() && !allocator_->IsFull()); in TEST_F()
362 EXPECT_TRUE(allocator_->IsFull()); in TEST_F()
435 EXPECT_TRUE(allocator_->IsFull()); in TEST_F()
556 } while (!allocator_->IsCorrupt() && !allocator_->IsFull()); in TEST_F()
607 EXPECT_FALSE(allocator.IsFull()); in TEST()
633 EXPECT_FALSE(local.IsFull()); in TEST()
650 EXPECT_FALSE(shalloc2.IsFull()); in TEST()
676 EXPECT_FALSE(shalloc3.IsFull()); in TEST()
741 EXPECT_FALSE(local.IsFull()); in TEST()
[all …]
|
| D | persistent_sample_map.cc | 181 NOTREACHED() << "full=" << allocator->IsFull() in CreatePersistentRecord()
|
| D | sparse_histogram_unittest.cc | 45 ASSERT_FALSE(allocator_->IsFull()); in TearDown()
|
| /external/pigweed/pw_trace_tokenized/public/pw_trace_tokenized/ |
| D | trace_tokenized.h | 65 if (IsFull()) { in TryPushBack()
104 bool IsFull() const { return !is_empty_ && (head_ == tail_); } in IsFull() function
|
| /external/lzma/CPP/7zip/Bundles/LzmaSpec/ |
| D | LzmaSpec.cpp | 69 bool IsFull; member in COutWindow
83 IsFull = false; in Create()
94 IsFull = true; in PutByte()
112 return dist <= Pos || IsFull; in CheckDistance()
117 return Pos == 0 && !IsFull; in IsEmpty()
|
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
| D | ringbuffer.h | 78 INLINE bool IsFull() in IsFull() function
|
| /external/llvm-project/flang/lib/Decimal/ |
| D | decimal-to-binary.cpp | 211 bool IsFull() const { return value_ >= topBit; } in IsFull() function in Fortran::decimal::IntermediateFloat
367 while (!f.IsFull()) { in ConvertToBinary()
|
| D | big-radix-floating-point.h | 138 bool IsFull() const { in IsFull() function
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | raw_hash_set.h | 326 inline bool IsFull(ctrl_t c) { return c >= 0; }
505 ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) &&
511 ABSL_HARDENING_ASSERT((ctrl == nullptr || IsFull(*ctrl)) &&
1006 if (IsFull(ctrl_[i])) {
1517 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1567 if (IsFull(ctrl_[i])) {
1592 if (IsFull(old_ctrl[i])) {
1793 if (IsFull(h)) {
1877 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/angle/third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 315 inline bool IsFull(ctrl_t c) { return c >= 0; }
522 ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) &&
528 ABSL_HARDENING_ASSERT((ctrl == nullptr || IsFull(*ctrl)) &&
1026 if (IsFull(ctrl_[i])) {
1537 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1587 if (IsFull(ctrl_[i])) {
1612 if (IsFull(old_ctrl[i])) {
1813 if (IsFull(h)) {
1900 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 311 inline bool IsFull(ctrl_t c) { return c >= 0; }
654 void assert_is_full() const { assert(IsFull(*ctrl_)); }
656 assert(!ctrl_ || IsFull(*ctrl_) || *ctrl_ == kSentinel);
936 if (IsFull(ctrl_[i])) {
1443 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1493 if (IsFull(ctrl_[i])) {
1518 if (IsFull(old_ctrl[i])) {
1756 if (IsFull(h)) {
1856 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 326 inline bool IsFull(ctrl_t c) { return c >= 0; }
515 ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) &&
521 ABSL_HARDENING_ASSERT((ctrl == nullptr || IsFull(*ctrl)) &&
959 if (IsFull(ctrl_[i])) {
1463 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1513 if (IsFull(ctrl_[i])) {
1538 if (IsFull(old_ctrl[i])) {
1777 if (IsFull(h)) {
1877 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 326 inline bool IsFull(ctrl_t c) { return c >= 0; }
515 ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) &&
521 ABSL_HARDENING_ASSERT((ctrl == nullptr || IsFull(*ctrl)) &&
959 if (IsFull(ctrl_[i])) {
1463 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1513 if (IsFull(ctrl_[i])) {
1538 if (IsFull(old_ctrl[i])) {
1777 if (IsFull(h)) {
1877 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/webrtc/third_party/abseil-cpp/absl/container/internal/ |
| D | raw_hash_set.h | 311 inline bool IsFull(ctrl_t c) { return c >= 0; }
654 void assert_is_full() const { assert(IsFull(*ctrl_)); }
656 assert(!ctrl_ || IsFull(*ctrl_) || *ctrl_ == kSentinel);
936 if (IsFull(ctrl_[i])) {
1443 assert(IsFull(*it.inner_.ctrl_) && "erasing a dangling iterator");
1493 if (IsFull(ctrl_[i])) {
1518 if (IsFull(old_ctrl[i])) {
1756 if (IsFull(h)) {
1856 if (container_internal::IsFull(c.ctrl_[i])) {
|
| /external/lzma/DOC/ |
| D | lzma-specification.txt | 248 bool IsFull;
262 IsFull = false;
273 IsFull = true;
291 return dist <= Pos || IsFull;
296 return Pos == 0 && !IsFull;
|