RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/__hashtable_8h_source.html below:

NCBI C++ ToolKit: include/corelib/hash_impl/_hashtable.h Source File

33 #ifndef _STLP_INTERNAL_HASHTABLE_H 34 #define _STLP_INTERNAL_HASHTABLE_H 36 # ifndef _STLP_INTERNAL_VECTOR_H 37 # include <stl/_vector.h> 40 # ifndef _STLP_INTERNAL_ITERATOR_H 41 # include <stl/_iterator.h> 44 # ifndef _STLP_INTERNAL_FUNCTION_H 45 # include <stl/_function_base.h> 48 # ifndef _STLP_INTERNAL_ALGOBASE_H 49 # include <stl/_algobase.h> 52 # ifndef _STLP_HASH_FUN_H 53 # include <stl/_hash_fun.h> 60 # define hashtable __WORKAROUND_DBG_RENAME(hashtable) 65 template

class

_Val>

75 template

class

_Val,

class

_Key,

class

_HF,

76 class

_ExK,

class

_EqK,

class

_All>

79 template

class

_Val,

class

_Key,

class

_HF,

80 class

_ExK,

class

_EqK,

class

_All>

98 template

class

_Val,

class

_Traits,

class

_Key,

class

_HF,

99 class

_ExK,

class

_EqK,

class

_All>

136 _Self

__tmp = *

this

;

142 template

class

_Val,

class

_Traits,

class

_Traits1,

class

_Key,

class

_HF,

143 class

_ExK,

class

_EqK,

class

_All>

150 #ifdef _STLP_USE_SEPARATE_RELOPS_NAMESPACE 151 template

class

_Val,

class

_Key,

class

_HF,

152 class

_ExK,

class

_EqK,

class

_All>

160 # if (defined (__GNUC__) && (__GNUC_MINOR__ < 8)) 161 template

class

_Val,

class

_Key,

class

_HF,

162 class

_ExK,

class

_EqK,

class

_All>

166 return

__x._M_cur != __y._M_cur;

170 template

class

_Val,

class

_Key,

class

_HF,

171 class

_ExK,

class

_EqK,

class

_All>

175 return

__x._M_cur != __y._M_cur;

179 # ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES 180 template

class

_Val,

class

_Traits,

class

_Key,

class

_HF,

class

_ExK,

class

_EqK,

class

_All>

182 template

class

_Val,

class

_Traits,

class

_Key,

class

_HF,

class

_ExK,

class

_EqK,

class

_All>

184 template

class

_Val,

class

_Traits,

class

_Key,

class

_HF,

class

_ExK,

class

_EqK,

class

_All>

188 #define __stl_num_primes 28 189 template

class

_Tp>

195 # if defined (_STLP_USE_TEMPLATE_EXPORT) 209 template

class

_Val,

class

_Key,

class

_HF,

210 class

_ExK,

class

_EqK,

class

_All>

303 if

(&__ht !=

this

) {

381 #ifdef _STLP_MEMBER_TEMPLATES 382 template

class

_InputIterator>

385 insert_unique

(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator));

388 template

class

_InputIterator>

389 void insert_equal

(_InputIterator __f, _InputIterator __l)

391 insert_equal

(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator));

394 template

class

_InputIterator>

396 const

input_iterator_tag &)

398 for

( ; __f != __l; ++__f)

402 template

class

_InputIterator>

403 void insert_equal

(_InputIterator __f, _InputIterator __l,

404 const

input_iterator_tag &)

406 for

( ; __f != __l; ++__f)

410 template

class

_ForwardIterator>

411 void insert_unique

(_ForwardIterator __f, _ForwardIterator __l,

412 const

forward_iterator_tag &)

416 for

( ; __n > 0; --__n, ++__f)

420 template

class

_ForwardIterator>

421 void insert_equal

(_ForwardIterator __f, _ForwardIterator __l,

422 const

forward_iterator_tag &)

426 for

( ; __n > 0; --__n, ++__f)

435 for

( ; __n > 0; --__n, ++__f)

443 for

( ; __n > 0; --__n, ++__f)

451 for

( ; __n > 0; --__n, ++__f)

459 for

( ; __n > 0; --__n, ++__f)

467 # if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS ) && !(defined(__MRC__)||(defined(__SC__)&&!defined(__DMC_))) 468 template

class

_KT>

484 # if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS ) && !(defined(__MRC__)||(defined(__SC__)&&!defined(__DMC__))) 485 template

class

_KT>

494 # if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS ) && !(defined(__MRC__)||(defined(__SC__)&&!defined(__DMC__))) 495 template

class

_KT>

515

pair<iterator, iterator>

518

pair<const_iterator, const_iterator>

573

_Construct(&__n->

_M_val

, __obj);

582

_STLP_STD::_Destroy(&__n->

_M_val

);

592 #define _STLP_TEMPLATE_HEADER template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All> 593 #define _STLP_TEMPLATE_CONTAINER hashtable<_Val,_Key,_HF,_ExK,_EqK,_All> 596 #undef _STLP_TEMPLATE_CONTAINER 597 #undef _STLP_TEMPLATE_HEADER 603 # if !defined (_STLP_LINK_TIME_INSTANTIATION) 604 # include <stl/_hashtable.c> 607 # if defined (_STLP_DEBUG) 608 # include <stl/debug/_hashtable.h>

bool operator==(const _Ht_iterator< _Val, _Traits, _Key, _HF, _ExK, _EqK, _All > &__x, const _Ht_iterator< _Val, _Traits1, _Key, _HF, _ExK, _EqK, _All > &__y)

_Stl_prime< bool > _Stl_prime_type

bool operator!=(const _Ht_iterator< _Val, _Nonconst_traits< _Val >, _Key, _HF, _ExK, _EqK, _All > &__x, const _Ht_iterator< _Val, _Const_traits< _Val >, _Key, _HF, _ExK, _EqK, _All > &__y)

static const size_t _M_list[28]

__vector__< void *, _M_node_ptr_allocator_type > _BucketVector

void insert_unique(const_iterator __f, const_iterator __l)

iterator insert_equal(const value_type &__obj)

void resize(size_type __num_elements_hint)

_Node * _M_new_node(const value_type &__obj)

_Self & operator=(const _Self &__ht)

const_iterator end() const

size_type max_size() const

hashtable(const _Self &__ht)

void _M_delete_node(_Node *__n)

size_type _M_bkt_num_key(const key_type &__key) const

const_iterator find(const key_type &__key) const

void insert_equal(const value_type *__f, const value_type *__l)

size_type max_bucket_count() const

_Alloc_traits< void *, _All >::allocator_type _M_node_ptr_allocator_type

allocator_type get_allocator() const

hashtable(size_type __n, const _HF &__hf, const _EqK &__eql, const allocator_type &__a=allocator_type())

iterator insert_equal_noresize(const value_type &__obj)

ptrdiff_t difference_type

size_type _M_next_size(size_type __n) const

_STLP_alloc_proxy< size_type, _Node, _M_node_allocator_type > _M_num_elements

hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > _Self

pair< iterator, bool > insert_unique_noresize(const value_type &__obj)

size_type _M_bkt_num(const value_type &__obj) const

_Const_traits< _Val > __const_val_traits

void _M_initialize_buckets(size_type __n)

_Node * _M_find(const key_type &__key) const

hashtable(size_type __n, const _HF &__hf, const _EqK &__eql, const _ExK &__ext, const allocator_type &__a=allocator_type())

_Nonconst_traits< _Val > __nonconst_val_traits

forward_iterator_tag _Iterator_category

const_iterator begin() const

size_type count(const key_type &__key) const

void _M_erase_bucket(const size_type __n, _Node *__first, _Node *__last)

void _M_copy_from(const _Self &__ht)

const _Node * _M_get_bucket(size_t __n) const

_Ht_iterator< _Val, __const_val_traits, _Key, _HF, _ExK, _EqK, _All > const_iterator

iterator find(const key_type &__key)

reference _M_insert(const value_type &__obj)

size_type _M_bkt_num_key(const key_type &__key, size_t __n) const

void insert_unique(const value_type *__f, const value_type *__l)

size_type bucket_count() const

pair< iterator, iterator > equal_range(const key_type &__key)

const value_type & const_reference

reference find_or_insert(const value_type &__obj)

const value_type * const_pointer

_Alloc_traits< _Node, _All >::allocator_type _M_node_allocator_type

static bool _STLP_CALL _M_equal(const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &, const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &)

hasher hash_funct() const

pair< iterator, bool > insert_unique(const value_type &__obj)

size_type erase(const key_type &__key)

_Hashtable_node< _Val > _Node

size_type elems_in_bucket(size_type __bucket) const

_Ht_iterator< _Val, __nonconst_val_traits, _Key, _HF, _ExK, _EqK, _All > iterator

_Alloc_traits< _Val, _All >::allocator_type allocator_type

void insert_equal(const_iterator __f, const_iterator __l)

size_type _M_bkt_num(const value_type &__obj, size_t __n) const

void swap(NCBI_NS_NCBI::pair_base_member< T1, T2 > &pair1, NCBI_NS_NCBI::pair_base_member< T1, T2 > &pair2)

unsigned int

A callback function used to compare two keys in a database.

double value_type

The numeric datatype used by the parser.

const GenericPointer< typename T::ValueType > & pointer

#define _STLP_UNWIND(action)

#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)

#define _STLP_FORCE_ALLOCATORS(a, y)

#define __TRIVIAL_STUFF(__type)

#define _STLP_DEFINE_ARROW_OPERATOR

#define _STLP_BEGIN_NAMESPACE

#define _STLP_END_NAMESPACE

_Node * _M_skip_to_next()

_Hashtable_node< _Val > _Node

hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > _Hashtable

_Hashtable_iterator(_Node *__n, _Hashtable *__tab)

_Hashtable_node< _Val > _Self

hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > _Hashtable

_Hashtable_iterator< _Val, _Key, _HF, _ExK, _EqK, _All > _Base

_Hashtable_node< _Val > _Node

reference operator*() const

_STLP_DEFINE_ARROW_OPERATOR _Self & operator++()

_Ht_iterator(const _Node *__n, const _Hashtable *__tab)

_Ht_iterator(const _Ht_iterator< _Val, _Nonconst_traits< _Val >, _Key, _HF, _ExK, _EqK, _All > &__it)

forward_iterator_tag iterator_category

_Traits::reference reference

ptrdiff_t difference_type

_Ht_iterator< _Val, _Traits, _Key, _HF, _ExK, _EqK, _All > _Self

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4