| /external/webrtc/webrtc/system_wrappers/include/ |
| stl_util.h | 37 // For a range within a container of pointers, calls delete (non-array version)
55 // For a range within a container of pairs, calls delete (non-array version) on
59 // container may call the hash function on the iterator when it is advanced,
73 // For a range within a container of pairs, calls delete (non-array version) on
86 // For a range within a container of pairs, calls delete.
133 // STLDeleteElements() deletes all the elements in an STL container and clears
134 // the container. This function is suitable for use with a vector, set,
135 // hash_set, or any other STL container which defines sensible begin(), end(),
138 // If container is NULL, this function is a no-op.
141 // STLElementDeleter (defined below), which ensures that your container'
[all...] |
| /external/google-breakpad/src/testing/include/gmock/ |
| gmock-generated-matchers.h | 315 template <typename Container>
316 operator Matcher<Container>() const {
317 typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer;
329 return MakeMatcher(new ElementsAreMatcherImpl<Container>(&matcher, 1));
343 template <typename Container>
344 operator Matcher<Container>() const {
345 typedef GTEST_REMOVE_REFERENCE_AND_CONST_(Container) RawContainer;
354 return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 2));
370 template <typename Container>
371 operator Matcher<Container>() const
[all...] |
| /external/clang/lib/AST/ |
| DeclObjC.cpp | [all...] |
| /external/v8/tools/clang/plugins/tests/ |
| ipc.cpp | 88 struct Container {
93 struct IPC::ParamTraits<Container<T>> {
94 static void Write(base::Pickle* pickle, const Container<T>& container) {
96 IPC::WriteParam(pickle, container.value); // NOT CHECKED
97 WriteParam(pickle, container.value); // NOT CHECKED
100 IPC::WriteParam<T>(pickle, container.value); // NOT CHECKED
101 WriteParam<T>(pickle, container.value); // NOT CHECKED
104 WriteParam(pickle, static_cast<uint32_t>(container.value)); // OK
107 WriteParam(pickle, static_cast<long>(container.value)); // ERRO
[all...] |
| /external/clang/lib/Analysis/ |
| BodyFarm.cpp | 401 auto *Container = cast<ObjCContainerDecl>(Prop->getDeclContext());
403 if (auto *InterfaceDecl = dyn_cast<ObjCInterfaceDecl>(Container)) {
405 } else if (auto *CategoryDecl = dyn_cast<ObjCCategoryDecl>(Container)) {
407 } else if (auto *ImplDecl = dyn_cast<ObjCImplDecl>(Container)) {
|
| /external/clang/lib/CodeGen/ |
| CGObjCRuntime.cpp | 33 const ObjCInterfaceDecl *Container = Ivar->getContainingInterface();
42 if (ID && declaresSameEntity(ID->getClassInterface(), Container))
45 RL = &CGM.getContext().getASTObjCInterfaceLayout(Container);
54 for (const ObjCIvarDecl *IVD = Container->all_declared_ivar_begin();
|
| /external/clang/test/SemaTemplate/ |
| ms-lookup-template-base-classes.cpp | 184 class Container : public Base<T> {
187 bool operator=(const Container<S>& rhs) {
193 Container<A> text_provider;
194 Container<B> text_provider2;
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_rv.pass.cpp | 26 template <class Container>
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_rv.pass.cpp | 26 template <class Container>
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /frameworks/base/tools/aapt2/util/ |
| Util.h | 125 template <typename Container>
127 const Container& container, const char* sep) {
130 const auto begin_iter = begin(container);
131 const auto end_iter = end(container);
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 135 // Container is a minimal interface used to store results when traversing
137 template <class T> class Container {
139 // Allocate a new container with a capacity for n elements.
140 Container(CopyReducerBase &S, unsigned N) : Elems(S.Arena, N) {}
142 // Push a new element onto the container.
162 // A visitor "container" is a single bool, which accumulates success.
163 template <class T> class Container {
165 Container(VisitReducerBase &S, unsigned N) : Success(true) {}
226 R_SExpr reduceSCFG(SCFG &Orig, Container<BasicBlock *> Bbs) {
229 R_BasicBlock reduceBasicBlock(BasicBlock &Orig, Container<R_SExpr> &As
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| _abcoll.py | 15 "Sized", "Container", "Callable",
106 class Container:
115 if cls is Container:
139 class Set(Sized, Iterable, Container):
140 """A set is a finite, iterable container.
283 """A mutable set is a finite, iterable container.
365 class Mapping(Sized, Iterable, Container):
367 """A Mapping is a generic container for associating key/value
492 """A MutableMapping is a generic container for associating
587 class Sequence(Sized, Iterable, Container):
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| _abcoll.py | 15 "Sized", "Container", "Callable",
105 class Container:
114 if cls is Container:
138 class Set(Sized, Iterable, Container):
139 """A set is a finite, iterable container.
334 class Mapping(Sized, Iterable, Container):
517 class Sequence(Sized, Iterable, Container):
|
| /external/google-breakpad/src/testing/gtest/src/ |
| gtest-internal-inl.h | 275 // STL container utilities.
277 // Returns the number of elements in the given container that satisfy
279 template <class Container, typename Predicate>
280 inline int CountIf(const Container& c, Predicate predicate) {
284 for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) {
291 // Applies a function/functor to each element in the container.
292 template <class Container, typename Functor>
293 void ForEach(const Container& c, Functor functor) {
[all...] |
| /external/googletest/googletest/src/ |
| gtest-internal-inl.h | 278 // STL container utilities.
280 // Returns the number of elements in the given container that satisfy
282 template <class Container, typename Predicate>
283 inline int CountIf(const Container& c, Predicate predicate) {
287 for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) {
294 // Applies a function/functor to each element in the container.
295 template <class Container, typename Functor>
296 void ForEach(const Container& c, Functor functor) {
[all...] |
| /external/libvpx/libvpx/third_party/googletest/src/src/ |
| gtest-internal-inl.h | 278 // STL container utilities.
280 // Returns the number of elements in the given container that satisfy
282 template <class Container, typename Predicate>
283 inline int CountIf(const Container& c, Predicate predicate) {
287 for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) {
294 // Applies a function/functor to each element in the container.
295 template <class Container, typename Functor>
296 void ForEach(const Container& c, Functor functor) {
[all...] |
| /external/llvm/utils/unittest/googletest/src/ |
| gtest-internal-inl.h | 271 // STL container utilities.
273 // Returns the number of elements in the given container that satisfy
275 template <class Container, typename Predicate>
276 inline int CountIf(const Container& c, Predicate predicate) {
280 for (typename Container::const_iterator it = c.begin(); it != c.end(); ++it) {
287 // Applies a function/functor to each element in the container.
288 template <class Container, typename Functor>
289 void ForEach(const Container& c, Functor functor) {
[all...] |
