HomeSort by relevance Sort by last modified time
    Searched defs:at (Results 226 - 250 of 462) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/
_deque.h 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
  /ndk/sources/host-tools/ndk-stack/regex/
engine.c 53 #define at sat macro
65 #define at lat macro
107 static void at(struct match *, char *, char *, char *, sopno, sopno);
115 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
120 #define AT(t, p1, p2, s1, s2) /* nothing */
306 AT("diss", start, stop, startst, stopst);
490 AT("back", start, stop, startst, stopst);
571 AT("hard", sp, stop, ss, stopst);
671 - fast - step through the string at top spee
979 at(struct match *m, char *title, char *start, char *stop, sopno startst, function
1021 #undef at macro
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
340 * used, then this will do at most 2N calls to the copy
737 * see at().)
760 * see at().)
775 /// Safety check used only from at().
796 at(size_type __n) function in class:vector
814 at(size_type __n) const function in class:vector
821 * Returns a read/write reference to the data at the first
829 * Returns a read-only (constant) reference to the data at the first
837 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
340 * used, then this will do at most 2N calls to the copy
737 * see at().)
760 * see at().)
775 /// Safety check used only from at().
796 at(size_type __n) function in class:vector
814 at(size_type __n) const function in class:vector
821 * Returns a read/write reference to the data at the first
829 * Returns a read-only (constant) reference to the data at the first
837 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_string_sum.h 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/pointers/
_deque.h 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_string_sum.h 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/pointers/
_deque.h 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_string_sum.h 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/pointers/
_deque.h 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
hashtable_policy.h 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
340 * used, then this will do at most 2N calls to the copy
737 * see at().)
760 * see at().)
775 /// Safety check used only from at().
796 at(size_type __n) function in class:vector
814 at(size_type __n) const function in class:vector
821 * Returns a read/write reference to the data at the first
829 * Returns a read-only (constant) reference to the data at the first
837 * Returns a read/write reference to the data at the las
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_vector.h 9 // Free Software Foundation; either version 3, or (at your option)
383 * used, then this will do at most 2N calls to the copy
747 * see at().)
762 * see at().)
769 /// Safety check used only from at().
790 at(size_type __n) function in class:vector
808 at(size_type __n) const function in class:vector
815 * Returns a read/write reference to the data at the first
823 * Returns a read-only (constant) reference to the data at the first
831 * Returns a read/write reference to the data at the las
    [all...]

Completed in 2316 milliseconds

1 2 3 4 5 6 7 8 91011>>