HomeSort by relevance Sort by last modified time
    Searched refs:Container (Results 26 - 50 of 157) sorted by null

12 3 4 5 6 7

  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/
test_array_in_pointer.py 16 class Container(Structure):
24 # create a container, which holds a pointer to the pvalues array.
25 c = Container()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/
test_array_in_pointer.py 16 class Container(Structure):
24 # create a container, which holds a pointer to the pvalues array.
25 c = Container()
  /external/clang/test/SemaCXX/
conversion-function.cpp 334 template <typename T> struct Container;
338 typedef Container<int> container_type;
342 struct Container {
347 Container<int> test;
364 template<class Container>
365 operator Container()
367 Container ar;
  /external/llvm/include/llvm/Bitcode/
BitstreamWriter.h 409 template <typename Container>
410 void EmitRecord(unsigned Code, const Container &Vals, unsigned Abbrev = 0) {
429 template <typename Container>
430 void EmitRecordWithAbbrev(unsigned Abbrev, const Container &Vals) {
439 template <typename Container>
440 void EmitRecordWithBlob(unsigned Abbrev, const Container &Vals,
444 template <typename Container>
445 void EmitRecordWithBlob(unsigned Abbrev, const Container &Vals,
453 template <typename Container>
454 void EmitRecordWithArray(unsigned Abbrev, const Container &Vals
    [all...]
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 56 LoopBlocksDFS(Loop *Container) :
57 L(Container), PostNumbers(NextPowerOf2(Container->getNumBlocks())) {
58 PostBlocks.reserve(Container->getNumBlocks());
  /external/webrtc/webrtc/system_wrappers/source/
data_log_no_op.cc 67 const Container* /*value_container*/) {
data_log.cc 37 // Inserts a Container into the cell of the column specified with
41 const Container* value_container);
50 typedef std::map<std::string, const Container*> CellMap;
75 // Inserts a Container into the cell of the column specified with
79 const Container* value_container);
121 const Container* value_container) {
133 const Container* container = cells_[column_name]; local
134 if (container == NULL) {
138 container->ToString(value_string)
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
map_test.cpp 339 typedef map<Key, int, KeyCmp> Container;
340 typedef Container::value_type value;
341 Container cont;
356 Container const& ccont = cont;
364 typedef map<Key*, int, KeyCmpPtr> Container;
365 typedef Container::value_type value;
366 Container cont;
381 Container const& ccont = cont;
388 typedef multimap<Key, int, KeyCmp> Container;
389 typedef Container::value_type value
    [all...]
unordered_test.cpp 389 //We are going to add at least 20 values, to get a stable hash container while doing that
406 //Now we put some more elements until hash container is resized:
418 // Now we remove some elements until hash container is resized:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
572 typedef unordered_set<Key, KeyHash, KeyEqual> Container;
573 Container cont;
586 Container const& ccont = cont;
593 typedef unordered_set<Key*, KeyHashPtr, KeyEqualPtr> Container;
594 Container cont;
607 Container const& ccont = cont
    [all...]
  /ndk/tests/device/test-stlport/unit/
map_test.cpp 339 typedef map<Key, int, KeyCmp> Container;
340 typedef Container::value_type value;
341 Container cont;
356 Container const& ccont = cont;
364 typedef map<Key*, int, KeyCmpPtr> Container;
365 typedef Container::value_type value;
366 Container cont;
381 Container const& ccont = cont;
388 typedef multimap<Key, int, KeyCmp> Container;
389 typedef Container::value_type value
    [all...]
unordered_test.cpp 389 //We are going to add at least 20 values, to get a stable hash container while doing that
406 //Now we put some more elements until hash container is resized:
418 // Now we remove some elements until hash container is resized:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
572 typedef unordered_set<Key, KeyHash, KeyEqual> Container;
573 Container cont;
586 Container const& ccont = cont;
593 typedef unordered_set<Key*, KeyHashPtr, KeyEqualPtr> Container;
594 Container cont;
607 Container const& ccont = cont
    [all...]
  /external/libchrome/base/
stl_util.h 30 // For a range within a container of pointers, calls delete (non-array version)
48 // For a range within a container of pairs, calls delete (non-array version) on
52 // container may call the hash function on the iterator when it is advanced,
66 // For a range within a container of pairs, calls delete (non-array version) on
79 // For a range within a container of pairs, calls delete.
93 // Counts the number of instances of val in a container.
94 template <typename Container, typename T>
96 typename Container::const_iterator>::difference_type
97 STLCount(const Container& container, const T& val)
    [all...]
  /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/impl/
DemoUtility.java 11 import java.awt.Container;
46 public static void fixGrid(Container cont, int columns) {
75 Call AFTER fixGridBag, passing in the container, the component, and the
78 public static void setInsets(Container cont, Component comp, Insets insets) {
  /external/eigen/unsupported/test/
FFTW.cpp 65 template<int Container, typename Scalar> struct VectorType;
77 template <int Container, typename T>
82 typedef typename VectorType<Container,Scalar>::type ScalarVector;
83 typedef typename VectorType<Container,Complex>::type ComplexVector;
140 template <int Container, typename T>
144 typedef typename VectorType<Container,Complex>::type ComplexVector;
  /external/google-breakpad/src/testing/include/gmock/
gmock-matchers.h     [all...]
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/webrtc/talk/app/webrtc/
statstypes.h 386 // This class wraps an STL container and provides a limited set of
393 typedef std::list<StatsReport*> Container;
394 typedef Container::iterator iterator;
395 typedef Container::const_iterator const_iterator;
412 Container list_;
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/
reflection.h 143 template<typename Container>
144 void MergeFrom(const Container& container) const {
145 typedef typename Container::const_iterator Iterator;
146 for (Iterator it = container.begin(); it != container.end(); ++it) {
150 template<typename Container>
151 void CopyFrom(const Container& container) const {
153 MergeFrom(container);
    [all...]
  /external/gmock/include/gmock/
gmock-matchers.h     [all...]
  /external/llvm/include/llvm/ADT/
STLExtras.h 206 // Returns an iterator_range over the given container which iterates in reverse.
207 // Note that the container must have rbegin()/rend() methods for this to work.
221 // Returns an iterator_range over the given container which iterates in reverse.
222 // Note that the container must have begin()/end() methods which return
348 /// For a container of pointers, deletes the pointers and then clears the
349 /// container.
350 template<typename Container>
351 void DeleteContainerPointers(Container &C) {
352 for (typename Container::iterator I = C.begin(), E = C.end(); I != E; ++I)
357 /// In a container of pairs (usually a map) whose second element is a pointer
    [all...]
  /external/libbrillo/brillo/strings/
string_utils.h 84 template <class Container>
85 std::string Join(const std::string& delimiter, const Container& strings) {
  /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/
KeyguardUserSwitcher.java 47 private final Container mUserSwitcherContainer;
64 mUserSwitcherContainer = (Container) userSwitcher.inflate();
300 public static class Container extends FrameLayout {
304 public Container(Context context, AttributeSet attrs) {
  /external/google-benchmark/test/
benchmark_test.cc 97 template<typename Container, typename ValueType = typename Container::value_type>
101 Container c;
  /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/clang/lib/AST/
DeclObjC.cpp     [all...]

Completed in 3261 milliseconds

12 3 4 5 6 7