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/classCStaticArraySearchBase.html below:

NCBI C++ ToolKit: CStaticArraySearchBase< KeyValueGetter, KeyCompare

Search Toolkit Book for CStaticArraySearchBase

class CStaticArraySet<> is an array adaptor that provides an STLish interface to statically-defined arrays, while making efficient use of the inherent sort order of such arrays. More...

#include <util/static_set.hpp>

template<size_t Size> CStaticArraySearchBase (const value_type(&arr)[Size], const char *file, int line, NStaticArray::ECopyWarn warn) Default constructor. More...
template<size_t Size> CStaticArraySearchBase (const value_type(&arr)[Size], const key_compare &comp, const char *file, int line, NStaticArray::ECopyWarn warn) Constructor to initialize comparator object. More...
template<typename Type > CStaticArraySearchBase (const Type *array_ptr, size_type array_size, const char *file, int line, NStaticArray::ECopyWarn warn) Default constructor. More...
template<typename Type > CStaticArraySearchBase (const Type *array_ptr, size_type array_size, const key_compare &comp, const char *file, int line, NStaticArray::ECopyWarn warn) Constructor to initialize comparator object. More...
~CStaticArraySearchBase (void) Destructor. More...
const value_compare & value_comp () const const key_compare & key_comp () const const_iterator begin () const Return the start of the controlled sequence. More...
const_iterator end () const Return the end of the controlled sequence. More...
bool empty () const Return true if the container is empty. More...
size_type size () const Return number of elements in the container. More...
const_iterator lower_bound (const key_type &key) const Return an iterator into the sequence such that the iterator's key is less than or equal to the indicated key. More...
const_iterator upper_bound (const key_type &key) const Return an iterator into the sequence such that the iterator's key is greater than the indicated key. More...
const_iterator find (const key_type &key) const Return a const_iterator pointing to the specified element, or to the end if the element is not found. More...
size_type count (const key_type &key) const Return the count of the elements in the sequence. More...
pair< const_iterator, const_iterator > equal_range (const key_type &key) const Return a pair of iterators bracketing the given element in the controlled sequence. More...
difference_type index_of (const key_type &key) const Return the index of the indicated element, or eNpos if the element is not found. More...
template<typename KeyValueGetter, typename KeyCompare>
class CStaticArraySearchBase< KeyValueGetter, KeyCompare >

class CStaticArraySet<> is an array adaptor that provides an STLish interface to statically-defined arrays, while making efficient use of the inherent sort order of such arrays.

This class can be used both to verify sorted order of a static array and to access a static array cleanly. The template parameters are as follows:

KeyType – type of object used for access KeyCompare – comparison functor. This must provide an operator(). This is patterned to accept PCase and PNocase and similar objects.

To use this class, define your static array as follows:

static const char* sc_MyArray[] = { "val1", "val2", "val3" };

Then, declare a static variable such as:

typedef StaticArraySet<const char*, PNocase_CStr> TStaticArray; static TStaticArray sc_Array(sc_MyArray, sizeof(sc_MyArray));

In debug mode, the constructor will scan the list of items and insure that they are in the sort order defined by the comparator used. If the sort order is not correct, then the constructor will ASSERT().

This can then be accessed as

if (sc_Array.find(some_value) != sc_Array.end()) { ... }

size_t idx = sc_Array.index_of(some_value); if (idx != TStaticArray::eNpos) { ... }

Definition at line 560 of file static_set.hpp.

◆ const_iterator