Thread portable class Gate portable class Timer class Pool class Terimber 2.0 About C++

Downloads Products & Services Support Clients Open Source About Home / Open source / Terimber 2.0 common.h Go to the documentation of this file. /* * The Software License * ================================================================================= * Copyright (c) 2003-.The Terimber Corporation. All rights reserved. * ================================================================================= * Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * The end-user documentation included with the redistribution, if any, * must include the following acknowledgment: * "This product includes software developed by the Terimber Corporation." * ================================================================================= * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED WARRANTIES, * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE TERIMBER CORPORATION OR ITS CONTRIBUTORS BE LIABLE FOR * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * ================================================================================ */ #ifndef _terimber_common_h_ #define _terimber_common_h_ #include "base/string.h" #include "base/template.h" #include "base/vector.h" #include "base/date.h" BEGIN_TERIMBER_NAMESPACE #pragma pack(4) enum numeric_radix { RADIX2 = 2, RADIX8 = 8, RADIX10 = 10, RADIX16 = 16 }; inline void* check_pointer( void* ptr ); inline size_t get8bits( unsigned char x ); inline size_t get16bits( const unsigned char* x ); template < class T > inline size_t do_hash( const T* x, size_t len = os_minus_one ); template < class T > inline T* copy_string( const T* x, byte_allocator& _allocator, size_t length = os_minus_one ); template < class T > inline bool hex_to_binary( ub1_t* dest, const T* x, size_t len = os_minus_one ); template < class T > inline bool symbol_to_byte( ub1_t &dest, T x, numeric_radix radix_ = RADIX16 ); template < class T > inline bool hex_to_byte( ub1_t &dest, const T* x, numeric_radix radix_ = RADIX16 ); template < class T > inline void binary_to_hex( T* dest, const ub1_t* x ); template < class T > inline void byte_to_hex( T* dest, ub1_t x ); template < class T > inline void byte_to_symbol( T& dest, ub1_t x ); template < class T > inline T* guid_to_string( T* dest, const guid_t& x ); template < class T > inline bool string_to_guid( guid_t& dest, const T* x ); template < class T > inline int simple_compare( const T& v1, const T& v2 ); template < class T > inline int memory_compare( const T& v1, const T& v2 ); inline int memory_compare_binary(const ub1_t* v1, const ub1_t* v2 ); template < class T > inline int simple_compare_ptr( const T* v1, const T* v2 ); template < class T, class F > inline int string_compare( const T& v1, const T& v2, F fn ); inline size_t do_hash( vt_types type, const terimber_xml_value& x ); inline int compare_value( vt_types type, const terimber_xml_value& first, const terimber_xml_value& second, bool use_hash, bool case_insensitive ); inline terimber_xml_value copy_value( vt_types type, const terimber_xml_value& x, byte_allocator& allocator_ ); terimber_xml_value parse_value( vt_types type, const char* x, size_t len_ = os_minus_one, byte_allocator* allocator_ = 0 ); const char* persist_value( vt_types type, const terimber_xml_value& x, byte_allocator* allocator_ ); typedef pool< byte_allocator_creator > mem_pool_t; inline bool operator==( const guid_t& first, const guid_t& second ); inline bool operator!=( const guid_t& first, const guid_t& second ); inline bool operator<( const guid_t& first, const guid_t& second ); inline bool operator>( const guid_t& first, const guid_t& second ); // when we can't estimate in advance how many bytes // will be persisted from input stream into 'name', 'value' or // something else that looks like one block of sequence of byte // then we can use paged buffer class typedef _vector< ub1_t > paged_vector_t; typedef _list< paged_vector_t > paged_store_t; class paged_buffer { public: paged_buffer( byte_allocator& data_allocator, byte_allocator& tmp_allocator, size_t page_size ); ~paged_buffer(); inline paged_buffer& operator<<( ub1_t symbol ); inline paged_buffer& operator<<( const char* x ); inline paged_buffer& append( const ub1_t* x, size_t size ); inline const char* persist(); inline const ub1_t* persist( size_t& size_ ); inline void reset(); inline size_t size() const; inline byte_allocator& get_tmp_allocator(); inline size_t get_page_size() const; private: void add_page(); const ub1_t* _persist( size_t& size_ ); const char* _persist(); private: byte_allocator& _data_allocator; byte_allocator& _tmp_allocator; paged_store_t _buffer; size_t _size; size_t _pos; ub1_t* _ptr; ub1_t* _primary; }; #pragma pack() END_TERIMBER_NAMESPACE #endif // _terimber_common_h_

© Copyright Terimber 2003-.