Home
last modified time | relevance | path

Searched refs:container_ (Results 1 – 25 of 47) sorted by relevance

12

/external/libbrillo/brillo/streams/
Dmemory_containers_test.cc69 MockContiguousBuffer container_; member in brillo::MemoryContainerTest
75 EXPECT_CALL(container_, GetSize()).WillOnce(Return(100)); in TEST_F()
76 EXPECT_CALL(container_, GetReadOnlyBuffer(10, _)) in TEST_F()
78 EXPECT_CALL(container_, in TEST_F()
83 EXPECT_TRUE(container_.Read(test_read_buffer_, 50, 10, &read, &error)); in TEST_F()
91 EXPECT_CALL(container_, GetSize()).WillOnce(Return(100)); in TEST_F()
92 EXPECT_CALL(container_, GetReadOnlyBuffer(80, _)) in TEST_F()
94 EXPECT_CALL(container_, in TEST_F()
98 EXPECT_TRUE(container_.Read(test_read_buffer_, 50, 80, &read, nullptr)); in TEST_F()
103 EXPECT_CALL(container_, GetSize()).WillOnce(Return(100)); in TEST_F()
[all …]
Dmemory_stream.cc19 : container_{std::move(container)}, stream_position_{stream_position} {} in MemoryStream()
85 bool MemoryStream::IsOpen() const { return container_ != nullptr; } in IsOpen()
89 return IsOpen() && !container_->IsReadOnly(); in CanWrite()
96 return IsOpen() ? container_->GetSize() : 0; in GetSize()
102 return container_->Resize(size, error); in SetSizeBlocking()
148 if (!container_->Read(buffer, size_to_read, stream_position_, &read, error)) in ReadNonBlocking()
163 if (!container_->Write(buffer, size_to_write, stream_position_, size_written, in WriteNonBlocking()
177 container_.reset(); in CloseBlocking()
182 return container_ || stream_utils::ErrorStreamClosed(FROM_HERE, error); in CheckContainer()
/external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/
Diterator.h53 : container_(container), iterator_(it) {} in UptrVectorIterator()
104 return UptrVectorIterator(container_, container_->end()); in End()
108 UptrVector* container_; // The container we are manipulating.
290 return container_ == that.container_ && iterator_ == that.iterator_;
302 assert(container_ == that.container_);
309 assert(container_ == that.container_);
318 auto index = iterator_ - container_->begin(); in InsertBefore()
319 container_->insert(iterator_, std::move(value)); in InsertBefore()
320 return UptrVectorIterator(container_, container_->begin() + index); in InsertBefore()
328 const auto pos = iterator_ - container_->begin(); in InsertBefore()
[all …]
/external/deqp-deps/SPIRV-Tools/source/opt/
Diterator.h57 : container_(container), iterator_(it) {} in UptrVectorIterator()
108 return UptrVectorIterator(container_, container_->end()); in End()
112 UptrVector* container_; // The container we are manipulating.
298 return container_ == that.container_ && iterator_ == that.iterator_;
310 assert(container_ == that.container_);
317 assert(container_ == that.container_);
326 auto index = iterator_ - container_->begin(); in InsertBefore()
327 container_->insert(iterator_, std::move(value)); in InsertBefore()
328 return UptrVectorIterator(container_, container_->begin() + index); in InsertBefore()
336 const auto pos = iterator_ - container_->begin(); in InsertBefore()
[all …]
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Diterator.h57 : container_(container), iterator_(it) {} in UptrVectorIterator()
108 return UptrVectorIterator(container_, container_->end()); in End()
112 UptrVector* container_; // The container we are manipulating.
298 return container_ == that.container_ && iterator_ == that.iterator_;
310 assert(container_ == that.container_);
317 assert(container_ == that.container_);
326 auto index = iterator_ - container_->begin(); in InsertBefore()
327 container_->insert(iterator_, std::move(value)); in InsertBefore()
328 return UptrVectorIterator(container_, container_->begin() + index); in InsertBefore()
336 const auto pos = iterator_ - container_->begin(); in InsertBefore()
[all …]
/external/tensorflow/tensorflow/lite/kernels/
Dtopk_v2.cc97 container_.reserve(std::min(k, row_size) + 1); in TopContainer()
102 container_.clear(); in start_collecting()
106 if (container_.size() <= k_) { in push()
107 container_.push_back(a); in push()
108 if (container_.size() == k_ + 1) { in push()
109 std::make_heap(container_.begin(), container_.end(), comparator); in push()
110 std::pop_heap(container_.begin(), container_.end(), comparator); in push()
112 } else if (comparator(a, container_.front())) { in push()
123 container_.back() = a; in push()
128 std::pop_heap(container_.begin(), container_.end(), comparator); in push()
[all …]
/external/sfntly/cpp/src/sfntly/port/
Djava_iterator.h43 explicit PODIterator(Container* container) : container_(container) {} in PODIterator()
46 return static_cast<ContainerBase*>(container_); in container_base()
59 Container* container() { return container_; } in container()
62 Container* container_; // Dumb pointer is used to avoid circular ref-counting
70 explicit RefIterator(Container* container) : container_(container) {} in RefIterator()
73 return static_cast<ContainerBase*>(container_); in container_base()
86 Container* container() { return container_; } in container()
89 Container* container_; // Dumb pointer is used to avoid circular ref-counting
/external/libchrome/base/task_scheduler/
Dpriority_queue.cc70 outer_queue_->container_.emplace(std::move(sequence), sequence_sort_key); in Push()
75 return outer_queue_->container_.top().sort_key(); in PeekSortKey()
87 outer_queue_->container_.top()) in PopSequence()
89 outer_queue_->container_.pop(); in PopSequence()
94 return outer_queue_->container_.empty(); in IsEmpty()
98 return outer_queue_->container_.size(); in Size()
/external/libchrome/base/containers/
Dstack_container.h148 StackContainer() : allocator_(&stack_data_), container_(allocator_) { in StackContainer()
151 container_.reserve(stack_capacity); in StackContainer()
160 ContainerType& container() { return container_; } in container()
161 const ContainerType& container() const { return container_; } in container()
166 ContainerType* operator->() { return &container_; }
167 const ContainerType* operator->() const { return &container_; }
180 ContainerType container_; variable
/external/autotest/client/site_tests/security_Libcontainer/src/
Dlibcontainer_target_unittest.cc82 container_ = container_new("containerUT", rootfs.value().c_str()); in SetUp()
83 ASSERT_NE(nullptr, container_); in SetUp()
87 container_destroy(container_); in TearDown()
88 container_ = nullptr; in TearDown()
95 return container_; in container()
103 struct container* container_ = nullptr; member in libcontainer::LibcontainerTargetTest
/external/tensorflow/tensorflow/core/common_runtime/
Dscoped_allocator.cc31 container_(container), in ScopedAllocator()
94 container_->Drop(f.scope_id, this); in AllocateRaw()
96 container_->Drop(id_, this); in AllocateRaw()
97 container_->Unref(); in AllocateRaw()
98 container_ = nullptr; in AllocateRaw()
/external/angle/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anon5b50e2f70111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
Dcontainer_test.cc53 std::unordered_set<int> container_ = {1, 2, 3}; member in __anon19abd9930111::NonMutatingTest
70 EXPECT_EQ(container_.size(), absl::c_distance(container_)); in TEST_F()
92 AccumulateCalls c = absl::c_for_each(container_, AccumulateCalls()); in TEST_F()
99 absl::c_for_each(std::unordered_set<int>(container_), AccumulateCalls()); in TEST_F()
105 auto it = absl::c_find(container_, 3); in TEST_F()
110 TEST_F(NonMutatingTest, FindIf) { absl::c_find_if(container_, Predicate); } in TEST_F()
113 absl::c_find_if_not(container_, Predicate); in TEST_F()
127 absl::c_find_first_of(container_, sequence_); in TEST_F()
128 absl::c_find_first_of(sequence_, container_); in TEST_F()
132 absl::c_find_first_of(container_, sequence_, BinPredicate); in TEST_F()
[all …]
/external/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anond7ed9ca80111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
Dcontainer_test.cc53 std::unordered_set<int> container_ = {1, 2, 3}; member in __anon964893440111::NonMutatingTest
73 EXPECT_EQ(container_.size(), absl::c_distance(container_)); in TEST_F()
95 AccumulateCalls c = absl::c_for_each(container_, AccumulateCalls()); in TEST_F()
102 absl::c_for_each(std::unordered_set<int>(container_), AccumulateCalls()); in TEST_F()
108 auto it = absl::c_find(container_, 3); in TEST_F()
113 TEST_F(NonMutatingTest, FindIf) { absl::c_find_if(container_, Predicate); } in TEST_F()
116 absl::c_find_if_not(container_, Predicate); in TEST_F()
130 absl::c_find_first_of(container_, sequence_); in TEST_F()
131 absl::c_find_first_of(sequence_, container_); in TEST_F()
135 absl::c_find_first_of(container_, sequence_, BinPredicate); in TEST_F()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anon16adee090111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
/external/openscreen/third_party/abseil/src/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anonfc7307c90111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
Dcontainer_test.cc53 std::unordered_set<int> container_ = {1, 2, 3}; member in __anonbacdfe650111::NonMutatingTest
70 EXPECT_EQ(container_.size(), absl::c_distance(container_)); in TEST_F()
92 AccumulateCalls c = absl::c_for_each(container_, AccumulateCalls()); in TEST_F()
99 absl::c_for_each(std::unordered_set<int>(container_), AccumulateCalls()); in TEST_F()
105 auto it = absl::c_find(container_, 3); in TEST_F()
110 TEST_F(NonMutatingTest, FindIf) { absl::c_find_if(container_, Predicate); } in TEST_F()
113 absl::c_find_if_not(container_, Predicate); in TEST_F()
127 absl::c_find_first_of(container_, sequence_); in TEST_F()
128 absl::c_find_first_of(sequence_, container_); in TEST_F()
132 absl::c_find_first_of(container_, sequence_, BinPredicate); in TEST_F()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anon2846b6170111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
Dcontainer_test.cc53 std::unordered_set<int> container_ = {1, 2, 3}; member in __anone6a1acb30111::NonMutatingTest
73 EXPECT_EQ(container_.size(), absl::c_distance(container_)); in TEST_F()
95 AccumulateCalls c = absl::c_for_each(container_, AccumulateCalls()); in TEST_F()
102 absl::c_for_each(std::unordered_set<int>(container_), AccumulateCalls()); in TEST_F()
108 auto it = absl::c_find(container_, 3); in TEST_F()
113 TEST_F(NonMutatingTest, FindIf) { absl::c_find_if(container_, Predicate); } in TEST_F()
116 absl::c_find_if_not(container_, Predicate); in TEST_F()
130 absl::c_find_first_of(container_, sequence_); in TEST_F()
131 absl::c_find_first_of(sequence_, container_); in TEST_F()
135 absl::c_find_first_of(container_, sequence_, BinPredicate); in TEST_F()
[all …]
/external/libtextclassifier/abseil-cpp/absl/algorithm/
Dalgorithm_test.cc151 LinearSearchTest() : container_{1, 2, 3} {} in LinearSearchTest()
156 std::vector<int> container_; member in __anon4633f2780111::LinearSearchTest
160 EXPECT_TRUE(absl::linear_search(container_.begin(), container_.end(), 3)); in TEST_F()
161 EXPECT_FALSE(absl::linear_search(container_.begin(), container_.end(), 4)); in TEST_F()
165 const std::vector<int> *const const_container = &container_; in TEST_F()
Dcontainer_test.cc53 std::unordered_set<int> container_ = {1, 2, 3}; member in __anon048ee9140111::NonMutatingTest
70 EXPECT_EQ(container_.size(), absl::c_distance(container_)); in TEST_F()
92 AccumulateCalls c = absl::c_for_each(container_, AccumulateCalls()); in TEST_F()
99 absl::c_for_each(std::unordered_set<int>(container_), AccumulateCalls()); in TEST_F()
105 auto it = absl::c_find(container_, 3); in TEST_F()
110 TEST_F(NonMutatingTest, FindIf) { absl::c_find_if(container_, Predicate); } in TEST_F()
113 absl::c_find_if_not(container_, Predicate); in TEST_F()
127 absl::c_find_first_of(container_, sequence_); in TEST_F()
128 absl::c_find_first_of(sequence_, container_); in TEST_F()
132 absl::c_find_first_of(container_, sequence_, BinPredicate); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/framework/
Dresource_handle.h47 const std::string& container() const { return container_; } in container()
48 void set_container(const std::string& container) { container_ = container; } in set_container()
101 std::string container_; variable
Dresource_mgr.h98 container_(strings::StrCat("__per_step_", step_id)), in ScopedStepContainer()
106 container_(strings::StrCat("__", prefix, "_per_step_", step_id)), in ScopedStepContainer()
117 cleanup_(container_); in CleanUp()
150 const std::string container_; variable
424 const std::string& container() const { return container_; } in container()
435 std::string container_; variable
485 std::string container_;
819 OP_REQUIRES_OK(context, context->GetAttr("container", &container_));
832 MakeResourceHandle<T>(ctx, container_, name_);
844 MakeResourceHandle<T>(ctx, container_, name_);
[all …]
/external/tensorflow/tensorflow/core/kernels/
Dbatch_kernels.cc190 OP_REQUIRES_OK(c, c->GetAttr("container", &container_)); in BatchFunctionKernel()
222 container_ = "__adapative_container"; in BatchFunctionKernel()
311 container_, shared_name_, &br, creator), in ComputeAsync()
421 string container_; member in tensorflow::BatchFunctionKernel
462 OP_REQUIRES_OK(c, c->GetAttr("container", &container_)); in BatchKernel()
493 container_, shared_name_, &br, creator), in ComputeAsync()
525 string container_; member in tensorflow::BatchKernel
725 OP_REQUIRES_OK(c, c->GetAttr("container", &container_)); in UnbatchKernel()
744 container_, shared_name_, &ubr, creator), in ComputeAsync()
753 string container_; member in tensorflow::UnbatchKernel
[all …]

12