/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | radiotap.c | 53 * ieee80211_radiotap_iterator_init - radiotap parser iterator initialization 54 * @iterator: radiotap_iterator to initialize 60 * This function initializes an opaque iterator struct which can then 66 * call __ieee80211_radiotap_iterator_init() to init a semi-opaque iterator 71 * The iterator's @this_arg member points to the start of the argument 73 * found in the iterator's @this_arg_index member. This arg index corresponds 78 * iterator->max_length after executing ieee80211_radiotap_iterator_init() 82 * You must take care when dereferencing iterator.this_arg 84 * get_unaligned((type *)iterator.this_arg) to dereference 85 * iterator 90 ieee80211_radiotap_iterator_init( struct ieee80211_radiotap_iterator *iterator, struct ieee80211_radiotap_header *radiotap_header, int max_length, const struct ieee80211_radiotap_vendor_namespaces *vns) argument 163 find_ns(struct ieee80211_radiotap_iterator *iterator, uint32_t oui, uint8_t subns) argument 185 find_override(struct ieee80211_radiotap_iterator *iterator, int *align, int *size) argument 231 ieee80211_radiotap_iterator_next( struct ieee80211_radiotap_iterator *iterator) argument [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | radiotap.c | 53 * ieee80211_radiotap_iterator_init - radiotap parser iterator initialization 54 * @iterator: radiotap_iterator to initialize 60 * This function initializes an opaque iterator struct which can then 66 * call __ieee80211_radiotap_iterator_init() to init a semi-opaque iterator 71 * The iterator's @this_arg member points to the start of the argument 73 * found in the iterator's @this_arg_index member. This arg index corresponds 78 * iterator->max_length after executing ieee80211_radiotap_iterator_init() 82 * You must take care when dereferencing iterator.this_arg 84 * get_unaligned((type *)iterator.this_arg) to dereference 85 * iterator 90 ieee80211_radiotap_iterator_init( struct ieee80211_radiotap_iterator *iterator, struct ieee80211_radiotap_header *radiotap_header, int max_length, const struct ieee80211_radiotap_vendor_namespaces *vns) argument 163 find_ns(struct ieee80211_radiotap_iterator *iterator, uint32_t oui, uint8_t subns) argument 185 find_override(struct ieee80211_radiotap_iterator *iterator, int *align, int *size) argument 231 ieee80211_radiotap_iterator_next( struct ieee80211_radiotap_iterator *iterator) argument [all...] |
/external/wpa_supplicant_8/wpa_supplicant/dbus/ |
H A D | dbus_new_handlers.c | 181 * @iter: DBus message iterator containing dictionary of network 369 * @iter: Pointer to incoming dbus message iterator 471 * @iter: Pointer to incoming dbus message iterator 4137 char **iterator; local 4153 iterator = props; 4154 while (*iterator) { 4155 if (!wpa_dbus_dict_append_string(&dict_iter, *iterator, 4156 *(iterator + 1))) { 4161 iterator += 2; 4174 iterator [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | radiotap.c | 53 * ieee80211_radiotap_iterator_init - radiotap parser iterator initialization 54 * @iterator: radiotap_iterator to initialize 60 * This function initializes an opaque iterator struct which can then 66 * call __ieee80211_radiotap_iterator_init() to init a semi-opaque iterator 71 * The iterator's @this_arg member points to the start of the argument 73 * found in the iterator's @this_arg_index member. This arg index corresponds 78 * iterator->max_length after executing ieee80211_radiotap_iterator_init() 82 * You must take care when dereferencing iterator.this_arg 84 * get_unaligned((type *)iterator.this_arg) to dereference 85 * iterator 90 ieee80211_radiotap_iterator_init( struct ieee80211_radiotap_iterator *iterator, struct ieee80211_radiotap_header *radiotap_header, int max_length, const struct ieee80211_radiotap_vendor_namespaces *vns) argument 163 find_ns(struct ieee80211_radiotap_iterator *iterator, uint32_t oui, uint8_t subns) argument 185 find_override(struct ieee80211_radiotap_iterator *iterator, int *align, int *size) argument 231 ieee80211_radiotap_iterator_next( struct ieee80211_radiotap_iterator *iterator) argument [all...] |
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/ |
H A D | XMPMeta.java | 22 * modify all kinds of properties, create an iterator over all properties and serialize the metadata 1069 * Constructs an iterator for the properties within this XMP object. 1072 * @see XMPMeta#iterator(String, String, IteratorOptions) 1075 XMPIterator iterator() throws XMPException; method in interface:XMPMeta 1079 * Constructs an iterator for the properties within this XMP object using some options. 1083 * @see XMPMeta#iterator(String, String, IteratorOptions) 1086 XMPIterator iterator(IteratorOptions options) throws XMPException; method in interface:XMPMeta 1090 * Construct an iterator for the properties within an XMP object. The general operation of an 1091 * XMP object iterator was. According to the parameters it iterates the entire data tree, 1105 XMPIterator iterator( method in interface:XMPMeta [all...] |
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
H A D | XMPIteratorImpl.java | 36 /** stores the iterator options */ 44 /** the node iterator doing the work */ 102 // create iterator 116 // create null iterator 117 nodeIterator = Collections.EMPTY_LIST.iterator(); 220 /** the iterator that goes through the children and qualifier list */ 224 /** the iterator for each child */ 225 private Iterator subIterator = Collections.EMPTY_LIST.iterator(); 240 * Constructor for the node iterator. 328 * @param iterator a 331 iterateChildren(Iterator iterator) argument [all...] |
H A D | XMPMetaImpl.java | 1003 * @see XMPMeta#iterator() 1005 public XMPIterator iterator() throws XMPException method in class:XMPMetaImpl 1007 return iterator(null, null, null); 1012 * @see XMPMeta#iterator(IteratorOptions) 1014 public XMPIterator iterator(IteratorOptions options) throws XMPException method in class:XMPMetaImpl 1016 return iterator(null, null, options); 1021 * @see XMPMeta#iterator(String, String, IteratorOptions) 1023 public XMPIterator iterator(String schemaNS, String propName, IteratorOptions options) method in class:XMPMetaImpl
|
/external/stlport/stlport/stl/ |
H A D | _bvector.h | 375 typedef _STLP_PRIV _Bit_iterator iterator; typedef in class:__BVECTOR_QUALIFIED 393 this->_M_start = iterator(__q, 0); 396 void _M_insert_aux(iterator __position, bool __x) { 406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); 411 this->_M_start = iterator(__q, 0); 419 this->_M_start = iterator(); 420 this->_M_finish = iterator(); 435 void _M_insert_range(iterator __pos, 445 void _M_insert_range(iterator __positio [all...] |
H A D | _deque.c | 98 # define iterator __iterator__ macro 102 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE deque<_Tp, _Alloc>::iterator 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, 128 iterator __new_start = _M_reserve_elements_at_front(__n); 136 iterator __new_finish = _M_reserve_elements_at_back(__n); 150 void deque<_Tp, _Alloc>::insert(iterator __pos, 157 iterator __new_start = _M_reserve_elements_at_front(__n); 165 iterator __new_finish = _M_reserve_elements_at_back(__n); 178 void deque<_Tp,_Alloc>::insert(iterator __pos, 185 iterator __new_star 814 #undef iterator macro [all...] |
H A D | _deque.h | 54 * For any nonsingular iterator i: 61 * pointer, even if i is a past-the-end iterator. 174 typedef _Deque_iterator<_Tp, _NonConstTraits> iterator; typedef in struct:_Deque_iterator 182 //copy constructor for iterator and constructor from iterator for const_iterator 183 _Deque_iterator(const iterator& __x) : 351 typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:_Deque_base 385 iterator _M_start; 386 iterator _M_finish; 420 typedef typename _Base::iterator iterato typedef in class:deque [all...] |
H A D | _hash_map.h | 39 //Specific iterator traits creation 58 //Specific iterator traits creation 75 typedef typename _Ht::iterator iterator; typedef in class:hash_map 173 iterator begin() { return _M_ht.begin(); } 174 iterator end() { return _M_ht.end(); } 179 pair<iterator,bool> insert(const value_type& __obj) 191 pair<iterator,bool> insert_noresize(const value_type& __obj) 195 iterator find(const _KT& __key) { return _M_ht.find(__key); } 201 iterator __i 266 typedef typename _Ht::iterator iterator; typedef in class:hash_multimap [all...] |
H A D | _hash_set.h | 39 //Specific iterator traits creation 51 //Specific iterator traits creation 69 typedef typename _Ht::iterator iterator; typedef in class:hash_set 175 iterator begin() { return _M_ht.begin(); } 176 iterator end() { return _M_ht.end(); } 181 pair<iterator, bool> insert(const value_type& __obj) 193 pair<iterator, bool> insert_noresize(const value_type& __obj) 197 iterator find(const _KT& __key) { return _M_ht.find(__key); } 205 pair<iterator, iterato 255 typedef typename _Ht::iterator iterator; typedef in class:hash_multiset [all...] |
H A D | _hashtable.h | 121 typedef _Ht_iterator<_BaseIte, _NonConstTraits> iterator; typedef in struct:_Ht_iterator 125 //copy constructor for iterator and constructor from iterator for const_iterator 126 _Ht_iterator(const iterator& __it) : _M_ite(__it._M_ite) {} 256 typedef typename _ElemsCont::iterator _ElemsIte; 263 * - avoid _STLP_DEBUG performance trouble: with a vector of iterator on slist the resize 265 * the number of iterators in the buckets rather than constant in time as the iterator 287 typedef _STLP_PRIV _Ht_iterator<_ElemsIte, _NonConstTraits> iterator; typedef in class:hashtable 290 //iterator in debug mode too. 295 typedef iterator local_iterato [all...] |
H A D | _iterator_base.h | 59 struct iterator { struct 67 struct iterator<output_iterator_tag, void, void, void, void> { struct 81 //Old HP iterator queries do not give information about the iterator 106 * iterators we have to map std iterator categories to stlport ones. This 114 # include_next <iterator> 116 # include _STLP_NATIVE_HEADER(iterator) 249 inline _Category _STLP_CALL iterator_category(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return _Category(); } 251 inline _Tp* _STLP_CALL value_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Tp*, 0); } 253 inline _Distance* _STLP_CALL distance_type(const iterator<_Categor [all...] |
H A D | _list.h | 104 typedef _List_iterator<_Tp, _NonConstTraits> iterator; typedef in struct:_List_iterator 115 //copy constructor for iterator and constructor from iterator for const_iterator 116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} 275 typedef _STLP_PRIV _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:list 367 iterator begin() { return iterator(this->_M_node._M_data._M_next); } 370 iterator end() { return iterator(&this->_M_node._M_data); } 420 iterator inser [all...] |
H A D | _map.h | 39 //Specific iterator traits creation 85 typedef typename _Rep_type::iterator iterator; typedef in class:map 163 iterator begin() { return _M_t.begin(); } 165 iterator end() { return _M_t.end(); } 176 iterator __i = lower_bound(__k); 188 pair<iterator,bool> insert(const value_type& __x) 190 iterator insert(iterator __pos, const value_type& __x) 203 void erase(iterator __po 278 typedef typename _Rep_type::iterator iterator; typedef in class:multimap [all...] |
H A D | _rope.h | 163 // Buffer should really be an arbitrary output iterator. 165 // This is thoroughly impossible, since iterator types don't 194 class sequence_buffer : public iterator <output_iterator_tag, void, void, void, void> { 644 * Dereferencing a nonconst iterator has to return something 746 * When we run out of cache, we have to reconstruct the iterator 955 // Perhaps we should instead copy the iterator 1097 typedef _Rope_iterator<_CharT,_Alloc> iterator; typedef in class:rope 1168 // Should really take an arbitrary iterator. 1262 // should take an arbitrary iterator 1374 // Should perhaps be templatized with respect to the iterator typ [all...] |
H A D | _set.h | 41 //Specific iterator traits creation 60 //Specific iterator traits creation 73 typedef typename _Rep_type::iterator iterator; typedef in class:set 151 iterator begin() { return _M_t.begin(); } 152 iterator end() { return _M_t.end(); } 168 pair<iterator,bool> insert(const value_type& __x) 170 iterator insert(iterator __pos, const value_type& __x) 182 void erase(iterator __po 244 typedef typename _Rep_type::iterator iterator; typedef in class:multiset [all...] |
H A D | _slist.h | 91 typedef _Slist_iterator<_Tp, _NonConstTraits> iterator; typedef in class:_Slist_iterator 99 //copy constructor for iterator and constructor from iterator for const_iterator 100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} 239 typedef _STLP_PRIV _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:slist 406 // non-dereferenceable iterator that, when incremented, yields 407 // begin(). This iterator may be used as the argument to 409 // slist, before_begin() is not the same iterator as end(). It 412 iterator before_begin() { return iterator( [all...] |
H A D | _string.c | 48 # define iterator _CharT* macro 280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, 314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, 372 basic_string<_CharT,_Traits,_Alloc> ::replace(iterator __first, iterator __last, 389 basic_string<_CharT,_Traits,_Alloc> ::_M_replace(iterator __first, iterator __last, 666 # undef iterator macro
|
H A D | _string.h | 87 // (2) Each iterator in [start, finish) points to a valid object 92 // (5) Each iterator in [finish + 1, end_of_storage) points to 143 typedef value_type* iterator; typedef in class:basic_string 258 // it can't be an iterator. 385 iterator begin() { return this->_M_Start(); } 386 iterator end() { return this->_M_Finish(); } 501 // it can't be an iterator. 593 // it can't be an iterator. 658 iterator insert(iterator __ [all...] |
H A D | _tree.c | 47 # define iterator __iterator__ macro 49 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::iterator 381 return iterator(__new_node); 414 iterator __j = iterator(__y); 417 return pair<iterator,bool>(_M_insert(__y, __val, /* __x*/ __y), true); 422 return pair<iterator,bool>(_M_insert(__y, __val, __x), true); 424 return pair<iterator,bool>(__j, false); 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, 453 iterator __afte 723 #undef iterator macro [all...] |
H A D | _tree.h | 155 typedef _Rb_tree_iterator<_Value, _NonConstTraits> iterator; typedef in struct:_Rb_tree_iterator 167 //copy constructor for iterator and constructor from iterator for const_iterator 168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} 264 // __root, in iterator.operator++ 371 typedef _Rb_tree_iterator<value_type, _NonConstTraits> iterator; typedef in class:_Rb_tree 376 iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr __on_right = 0); 421 iterator begin() { return iterator(_M_leftmost()); } 423 iterator en [all...] |
H A D | _unordered_map.h | 29 //Specific iterator traits creation 50 //Specific iterator traits creation 67 typedef typename _Ht::iterator iterator; typedef in class:unordered_map 128 iterator begin() { return _M_ht.begin(); } 129 iterator end() { return _M_ht.end(); } 133 pair<iterator,bool> insert(const value_type& __obj) 135 iterator insert(const_iterator /*__hint*/, const value_type& __obj) 148 iterator find(const _KT& __key) { return _M_ht.find(__key); } 154 iterator __i 235 typedef typename _Ht::iterator iterator; typedef in class:unordered_multimap [all...] |
H A D | _unordered_set.h | 29 //Specific iterator traits creation 43 //Specific iterator traits creation 61 typedef typename _Ht::iterator iterator; typedef in class:unordered_set 122 iterator begin() { return _M_ht.begin(); } 123 iterator end() { return _M_ht.end(); } 127 pair<iterator, bool> insert(const value_type& __obj) 129 iterator insert(const_iterator /*__hint*/, const value_type& __obj) 142 iterator find(const _KT& __key) { return _M_ht.find(__key); } 150 pair<iterator, iterato 211 typedef typename _Ht::iterator iterator; typedef in class:unordered_multiset [all...] |