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 varobj.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_varobj_h_ #define _terimber_varobj_h_ #include "smart/varvalue.h" #include "base/vector.h" #include "base/list.h" #include "base/stack.h" #include "base/map.h" #include "base/memory.h" #include "smart/byterep.h" #include "smart/varmap.h" #include "xml/xmlaccss.h" #include "fuzzy/fuzzyaccess.h" BEGIN_TERIMBER_NAMESPACE #pragma pack(4) class var_property_schema { public: vt_types _type; const char* _name; bool _is_searchable; bool _is_fuzzy_match; }; typedef _list< size_t > list_returns_index_t; class pk_column { public: pk_column( size_t pk, size_t col ) : _pk(pk), _col(col) { } inline bool operator<(const pk_column& x) const { //return _pk != x._pk ? _pk < x._pk : _col < x._col; return _col != x._col ? _col < x._col : _pk < x._pk; } inline bool operator==(const pk_column& x) const { return _col == x._col && _pk == x._pk; } size_t _pk; size_t _col; }; class var_container { public: //typedef node_allocator< _map< size_t, bool >::_node > sorted_container_allocator_t; typedef byte_allocator sorted_container_allocator_t; typedef _map< size_t, bool, sorted_container_allocator_t > sorted_container_data_t; public: var_container( sorted_container_allocator_t& all ) : _allocator(all) { } void intersect( const var_container& x ); void combine( const var_container& x ); static inline size_t clean_key( const pk_column& x ) { return x._pk; } static inline pk_column compound_key( size_t x, const pk_column& c ) { return pk_column(x, c._col); } sorted_container_allocator_t& _allocator; sorted_container_data_t _container; }; typedef varmap< pk_column, var_container > var_object_map_t; typedef _vector< var_property_schema > var_object_schema; typedef _vector< var_value > var_object_values; typedef _list< pk_column > var_unique_key_t; class var_object_repository { public: typedef array_allocator< var_object_map_t::mainmap_iter_t > iter_vec_allocator_t; typedef _vector< var_object_map_t::mainmap_iter_t, iter_vec_allocator_t > iter_vector_t; typedef node_allocator< _map< size_t, iter_vector_t >::_node > object_map_allocator_t; typedef _map< size_t, iter_vector_t, object_map_allocator_t > object_map_data_t; var_object_repository(const var_object_repository& x); var_object_repository& operator=(const var_object_repository& x); public: var_object_repository(const var_object_schema& schema ); ~var_object_repository(); void reset(); size_t count() const; bool process_query( xml_designer* parser, var_container::sorted_container_allocator_t& all, byte_allocator& tmp, byte_allocator& inl ); // the following functions must be used with care bool select_object(size_t pk, var_object_values& row, byte_allocator& tmp ) const; bool select_object(const var_object_values& key, var_object_values& row, byte_allocator& tmp, var_container::sorted_container_allocator_t& conall, size_t& pk ) const; size_t insert_object( const var_object_values& values, byte_allocator& tmp, byte_allocator& inl, string_t& err ); bool delete_object( size_t pk, byte_allocator& tmp, string_t& err ); bool delete_object( const var_object_values& key, byte_allocator& tmp, byte_allocator& inl, string_t& err ); bool update_object( size_t pk, const var_object_values& values, byte_allocator& tmp, byte_allocator& inl, string_t& err ); bool find_by_conditions( const xml_designer* parser, var_container& container, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool find_by_condition( const xml_designer* parser, var_container& container, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool find_by_row( const var_object_values& values, var_container& container, byte_allocator& tmp ) const; private: vt_types cast_to_common_type(vt_types type, const var_value& in, var_value& out, byte_allocator& tmp ) const; vt_types map_type( vt_types type ) const; bool process_returns(const xml_designer* parser, list_returns_index_t& container, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool process_values( const xml_designer* parser, var_object_values& container, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool process_where( const xml_designer* parser, var_container& container, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool process_condition(const xml_designer* parser, var_container& container, bool intersect, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool process_group( const xml_designer* parser, var_container& container, bool intersect, byte_allocator& tmp, byte_allocator& inl, string_t& err ) const; bool process_error( xml_designer* parser, const char* err ) const; const var_object_map_t* get_v_object_pointer(vt_types type, bool searchable ) const; var_object_map_t* get_v_object_pointer(vt_types type, bool searchable ); private: const var_object_schema& _schema; unique_key_generator _key_generator; variant_factory _var_factory; var_object_map_t _uint32_type_map; var_object_map_t _double_type_map; var_object_map_t _uint64_type_map; var_object_map_t _string_type_map; var_object_map_t _searchable_string_type_map; var_object_map_t _fuzzy_string_type_map; var_object_map_t _numeric_type_map; var_object_map_t _binary_type_map; var_object_map_t _guid_type_map; object_map_allocator_t _objs_all; iter_vec_allocator_t _iter_vec_all; object_map_data_t _objs_map; fuzzy_matcher* _fuzzy_engine; }; #pragma pack() END_TERIMBER_NAMESPACE #endif

© Copyright Terimber 2003-.