pair
std::list< std::pair<dev_t, bool> > fAttributeSupportList;
using __STD::pair;
pair<_ForwardIter, _ForwardIter>
return pair<_ForwardIter, _ForwardIter>(__left, __right);
return pair<_ForwardIter, _ForwardIter>(__first, __first);
inline pair<_ForwardIter, _ForwardIter>
pair<_ForwardIter, _ForwardIter>
return pair<_ForwardIter, _ForwardIter>(__left, __right);
return pair<_ForwardIter, _ForwardIter>(__first, __first);
inline pair<_ForwardIter, _ForwardIter>
pair<_InputIter, _OutputIter> __copy_n(_InputIter __first, _Size __count,
return pair<_InputIter, _OutputIter>(__first, __result);
inline pair<_RAIter, _OutputIter>
return pair<_RAIter, _OutputIter>(__last, copy(__first, __last, __result));
inline pair<_InputIter, _OutputIter>
inline pair<_InputIter, _OutputIter>
pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
return pair<_InputIter1, _InputIter2>(__first1, __first2);
pair<_InputIter1, _InputIter2> mismatch(_InputIter1 __first1,
return pair<_InputIter1, _InputIter2>(__first1, __first2);
pair<iterator,bool> insert(const value_type& __obj)
pair<iterator,bool> insert_noresize(const value_type& __obj)
pair<iterator, iterator> equal_range(const key_type& __key)
pair<const_iterator, const_iterator>
typedef hashtable<pair<const _Key, _Tp>, _Key, _HashFcn,
_Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>
pair<iterator, iterator> equal_range(const key_type& __key)
pair<const_iterator, const_iterator>
typedef hashtable<pair<const _Key,_Tp>,_Key,_HashFcn,
_Select1st<pair<const _Key,_Tp> >,_EqualKey,_Alloc> _Ht;
pair<iterator, bool> insert(const value_type& __obj)
pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj);
return pair<iterator,bool>(__p.first, __p.second);
pair<iterator, bool> insert_noresize(const value_type& __obj)
pair<typename _Ht::iterator, bool> __p =
return pair<iterator, bool>(__p.first, __p.second);
pair<iterator, iterator> equal_range(const key_type& __key) const
pair<iterator, iterator> equal_range(const key_type& __key) const
pair<iterator, bool> insert_unique(const value_type& __obj)
pair<iterator, bool> insert_unique_noresize(const value_type& __obj);
pair<iterator, iterator>
pair<const_iterator, const_iterator>
pair<typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::iterator, bool>
return pair<iterator, bool>(iterator(__cur, this), false);
return pair<iterator, bool>(iterator(__tmp, this), true);
pair<typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::iterator,
typedef pair<iterator, iterator> _Pii;
pair<typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::const_iterator,
typedef pair<const_iterator, const_iterator> _Pii;
pair<iterator,bool> insert(const value_type& __x)
pair<iterator,iterator> equal_range(const key_type& __x) {
pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
typedef pair<const _Key, _Tp> value_type;
pair<iterator,iterator> equal_range(const key_type& __x) {
pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
typedef pair<const _Key, _Tp> value_type;
pair<iterator,iterator> equal_range(const key_type& __x) const {
pair() : first(_T1()), second(_T2()) {}
pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
inline pair<_T1, _T2> make_pair(const _T1& __x, const _T2& __y)
return pair<_T1, _T2>(__x, __y);
pair<iterator,bool> insert(const value_type& __x) {
pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x);
return pair<iterator, bool>(__p.first, __p.second);
pair<iterator,iterator> equal_range(const key_type& __x) const {
pair<_Tp*, ptrdiff_t>
return pair<_Tp*, ptrdiff_t>(__tmp, __len);
return pair<_Tp*, ptrdiff_t>((_Tp*)0, 0);
inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) {
inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len, _Tp*) {
pair<iterator,iterator> __p = equal_range(__x);
pair<const_iterator, const_iterator> __p = equal_range(__k);
pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k));
pair<typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator,
return pair<const_iterator,const_iterator>(lower_bound(__k),
pair<iterator,bool> insert_unique(const value_type& __x);
pair<iterator,iterator> equal_range(const key_type& __x);
pair<const_iterator, const_iterator> equal_range(const key_type& __x) const;
pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
return pair<iterator,bool>(__j, false);
pair<_InputIter, _ForwardIter>
return pair<_InputIter, _ForwardIter>(__first, __cur);
inline pair<_RandomAccessIter, _ForwardIter>
return pair<_RandomAccessIter, _ForwardIter>(
inline pair<_InputIter, _ForwardIter>
inline pair<_InputIter, _ForwardIter>
friend class std::pair<const BString, BHttpFormData>;
typedef std::pair<std::string,std::string> Attribute;
uint16 pair = ((uint16)attr << 8) | (uint16)glyph;
while (p < p_limit) *p++ = pair;
uint16 pair = ((uint16)attr << 8) | (uint16)glyph;
*p = pair;
typedef std::pair<const in_addr* , uint32> KeyType;
typedef std::pair<const AddressType *, uint32> KeyType;
typedef std::pair<const in6_addr*, uint32> KeyType;
typedef std::pair<const AddressType *, uint32> KeyType;
typedef std::pair<const sockaddr*, const sockaddr*> KeyType;
typedef std::pair<const sockaddr *, const sockaddr *> KeyType;
using std::pair;
pair<mapping_set::iterator, bool> ret = m_mappingSet.insert(mapping);
pair<const BString, XML::DocumentType*>(type->rootElement, type));
typedef std::pair<BString,media_node_id> node_entry;
pair<tip_entry_set::iterator, bool> ret;
pair<BView*, const tip_entry*> _ViewEntry::match(
return pair<BView*, const tip_entry*>(m_target, entry);
pair<BView*, const tip_entry*> ret = entry->match(
return pair<BView*, const tip_entry*>(0, 0);
pair<BView*, const tip_entry*> _WindowEntry::match(
return pair<BView*,const tip_entry*>(0,0);
pair<BView*,const tip_entry*> ret = (*it)->match(
return pair<BView*,const tip_entry*>(0,0);
pair<BView*, const tip_entry*> found =
std::pair<BView*, const tip_entry*> match(
std::pair<BView*, const tip_entry*> match(
bool operator()(const std::pair<key,value>& p, const value& v) const {
typedef std::pair<BString, BString> AttributePair;
using std::pair;
typedef pair<string, string> Item;
typedef std::pair<entry_ref, int32> ImageSelector;
const std::pair<const std::string*, const syscall_stats*>& a,
const std::pair<const std::string*, const syscall_stats*>& b)
typedef std::vector<std::pair<const std::string*, const syscall_stats*> >
pair<StatisticsMap::iterator,bool> InsertResult;
pair<StatisticsMap::iterator,bool> InsertResult;
filter_pair *pair = fFilters.ItemAt(i);
if (pair->filter == function) {
filter_pair *pair = fFilters.ItemAt(i);
filter_function filter = pair->filter;
accepted = (*filter)(&tmpRef, pair->args);
pair<TUserArgsI, TUserArgsI> exts
fExtensions.insert(pair<uint32, BString>(key, i->second));
pair<uint32, MimeAttribute>(hash_function(mimeAttr.fName), mimeAttr));
cmdOptionsMap.insert(pair<uint32, CmdOption*>(
pair<uint32, const char*>(key, param));
pair<uint32, const char*>(key, *arg));
pair<uint32, const char*>(key, *arg));
fExtensions.insert(pair<uint32, BString>(hash_function(ext), ext));
pair<uint32, MimeAttribute>(hash_function(attr.fName), attr));
SyntaxPair* pair = new(std::nothrow) SyntaxPair(column, type);
if (pair == NULL)
ObjectDeleter<SyntaxPair> pairDeleter(pair);
if (!fPairs.AddItem(pair))
SyntaxPair* pair = info->PairAt(count);
if (pair == NULL)
_columns[count] = pair->column;
_types[count] = pair->type;
BString(signature), std::pair<image_id, int>(image, 1)));
typedef std::map<BString, std::pair<image_id, int32> > LoadedImageMap;
using std::pair;
fFields.insert(pair<BString, BHttpFormData>(fieldName, formData));
fFields.insert(pair<BString, BHttpFormData>(fieldName, formData));
fFields.insert(pair<BString, BHttpFormData>(fieldName, formData));
pair<FormStorage::iterator, bool> insertResult
= fFields.insert(pair<BString, BHttpFormData>(fieldName, formData));
using Host = std::pair<BString, int>;
std::pair<BString, int>
std::pair<BString, int> GetHost() const;
static const std::list<std::pair<BHttpTimeFormat, const char*>> kDateFormats = {
typedef std::pair<BMessage*, const BArchivable*> ArchivePair;
const ArchivePair& pair = pairs[i];
fError = pair.second->AllArchived(pair.first);
pair.first);
typedef std::pair<entry_ref, uint32> EntryWithDate;
std::pair<BString, MouseSettings*>(mouse_name, settings));
fInterfaceItemMap.insert(std::pair<BString, InterfaceListItem*>(
addOnMap.insert(std::pair<BString, BPath>(path.Leaf(), path));
fMouseSettingsObject.insert(std::pair<BString, MouseSettings*>
fMouseSettingsObject.insert(std::pair<BString, MouseSettings*>
fPortMap.insert(std::pair<BString, BMessage>(BString(name), data));
std::list< std::pair<dev_t,bool> >::iterator i;
std::pair<dev_t,bool> p(device, result);
std::list< std::pair<dev_t, bool> > fAttributeSupportList;
typedef std::pair<Slab *, ObjectLink *> ObjectInfo;
if (pair[i] >= 0)
close(pair[i]);
int pair[2];
if (tcp_pair(pair) == 0) {
close(pair[0]);
close(pair[1]);
tcp_pair(int pair[])
pair[0] = pair[1] = -1;
pair[0] = open_tcp_socket();
if (pair[0] < 0)
if (connect(pair[0], (sockaddr*)&address, sizeof(sockaddr_in)) != 0
FD_SET(pair[0], &set);
if (select(pair[0] + 1, NULL, &set, NULL, &tv) < 0)
if (getsockname(pair[0], (sockaddr*)&address, &length) != 0)
pair[1] = accept(listenSocket, (sockaddr*)&peerAddress, &length);
if (pair[1] >= 0)
pair<
using std::pair;
pair< CppUnit::Test* const, CppUnit::TestFailure*
using std::pair;