/usr/include/Freeze/Map.h is in libzeroc-ice35-dev 3.5.1-6.4ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 | // **********************************************************************
//
// Copyright (c) 2003-2013 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#ifndef FREEZE_MAP_H
#define FREEZE_MAP_H
#include <Ice/Ice.h>
#include <iterator>
#include <Freeze/DB.h>
#include <Freeze/Exception.h>
#include <Freeze/Connection.h>
//
// Berkeley DB's DbEnv
//
class DbEnv;
namespace Freeze
{
class IteratorHelper;
class MapHelper;
class MapIndexI;
class MapHelperI;
class IteratorHelperI;
class SharedDb;
class FREEZE_API KeyCompareBase : public IceUtil::Shared
{
public:
KeyCompareBase(bool);
bool compareEnabled() const;
virtual int compare(const Key&, const Key&) = 0;
private:
const bool _enabled;
};
typedef IceUtil::Handle<KeyCompareBase> KeyCompareBasePtr;
class FREEZE_API MapIndexBase : public KeyCompareBase
{
public:
virtual ~MapIndexBase();
const std::string& name() const;
IteratorHelper* begin(bool) const;
IteratorHelper* untypedFind(const Key&, bool, bool) const;
IteratorHelper* untypedLowerBound(const Key&, bool) const;
IteratorHelper* untypedUpperBound(const Key&, bool) const;
int untypedCount(const Key&) const;
//
// Implemented by the generated code
//
virtual void marshalKey(const Value&, Key&) const = 0;
protected:
MapIndexBase(const std::string&, bool);
Ice::CommunicatorPtr _communicator;
Ice::EncodingVersion _encoding;
private:
friend class MapHelperI;
friend class IteratorHelperI;
friend class SharedDb;
friend class MapDb;
std::string _name;
MapIndexI* _impl;
const MapHelperI* _map;
};
typedef IceUtil::Handle<MapIndexBase> MapIndexBasePtr;
class FREEZE_API MapHelper
{
public:
static MapHelper*
create(const ConnectionPtr& connection,
const std::string& dbName,
const std::string& key,
const std::string& value,
const KeyCompareBasePtr&,
const std::vector<MapIndexBasePtr>&,
bool createDb);
static void
recreate(const ConnectionPtr& connection,
const std::string& dbName,
const std::string& key,
const std::string& value,
const KeyCompareBasePtr&,
const std::vector<MapIndexBasePtr>&);
virtual ~MapHelper() = 0;
virtual IteratorHelper*
find(const Key&, bool) const = 0;
virtual IteratorHelper*
lowerBound(const Key&, bool) const = 0;
virtual IteratorHelper*
upperBound(const Key&, bool) const = 0;
virtual void
put(const Key&, const Value&) = 0;
virtual size_t
erase(const Key&) = 0;
virtual size_t
count(const Key&) const = 0;
virtual void
clear() = 0;
virtual void
destroy() = 0;
virtual size_t
size() const = 0;
virtual void
closeAllIterators() = 0;
virtual const MapIndexBasePtr&
index(const std::string&) const = 0;
virtual void
closeDb() = 0;
virtual ConnectionPtr
getConnection() const = 0;
};
class FREEZE_API IteratorHelper
{
public:
static IteratorHelper*
create(const MapHelper& m, bool readOnly);
virtual
~IteratorHelper() ICE_NOEXCEPT_FALSE = 0;
virtual IteratorHelper*
clone() const = 0;
virtual const Key*
get() const = 0;
virtual void
get(const Key*&, const Value*&) const = 0;
virtual void
set(const Value&) = 0;
virtual void
erase() = 0;
virtual bool
next() const = 0;
};
//
// Forward declaration
//
template <typename key_type, typename mapped_type, typename KeyCodec, typename ValueCodec, typename Compare>
class Map;
template <typename key_type, typename mapped_type, typename KeyCodec, typename ValueCodec, typename Compare>
class ConstIterator;
//
// This is necessary for MSVC support.
//
struct IteratorBase
{
typedef std::forward_iterator_tag iterator_category;
};
//
// Database iterator. This implements a forward iterator with the
// restriction that it's only possible to explicitely write back into
// the database.
//
// Two iterators are equal if they use the same database and their
// current records have the same key.
//
// TODO: It's possible to implement bidirectional iterators, if
// necessary.
//
template<typename key_type, typename mapped_type, typename KeyCodec, typename ValueCodec, typename Compare>
class Iterator : public IteratorBase
{
public:
typedef ptrdiff_t difference_type;
typedef std::pair<const key_type, const mapped_type> value_type;
typedef value_type* pointer;
typedef value_type& reference;
Iterator(IteratorHelper* helper, const Ice::CommunicatorPtr& communicator, const Ice::EncodingVersion& encoding) :
_helper(helper),
_communicator(communicator),
_encoding(encoding),
_refValid(false)
{
}
Iterator() :
_encoding(Ice::Encoding_1_0),
_refValid(false)
{
}
Iterator(const Iterator& rhs) :
_communicator(rhs._communicator),
_encoding(rhs._encoding),
_refValid(false)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
}
Iterator& operator=(const Iterator& rhs)
{
if(this != &rhs)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
else
{
_helper.reset();
}
_communicator = rhs._communicator;
_encoding = rhs._encoding;
_refValid = false;
}
return *this;
}
~Iterator() ICE_NOEXCEPT_FALSE
{
}
bool operator==(const Iterator& rhs) const
{
if(_helper.get() == rhs._helper.get())
{
return true;
}
if(_helper.get() != 0 && rhs._helper.get() != 0)
{
const Key* lhsKey = _helper->get();
const Key* rhsKey = rhs._helper->get();
if(lhsKey != 0 && rhsKey != 0)
{
return *lhsKey == *rhsKey;
}
}
return false;
}
bool operator!=(const Iterator& rhs) const
{
return !(*this == rhs);
}
Iterator& operator++()
{
incr();
return *this;
}
Iterator operator++(int)
{
Iterator tmp = *this;
incr();
return tmp;
}
//
// Note that this doesn't follow the regular iterator mapping:
//
// value_type& operator*(), value_type operator*() const
//
value_type& operator*() const
{
if(!_refValid)
{
key_type key;
mapped_type value;
getCurrentValue(key, value);
//
// !IMPORTANT!
//
// This method has to cache the returned value to implement
// operator->().
//
const_cast<key_type&>(_ref.first) = key;
const_cast<mapped_type&>(_ref.second) = value;
_refValid = true;
}
return _ref;
}
value_type* operator->() { return &(operator*()); }
//
// This special method allows writing back into the database.
//
void set(const mapped_type& value)
{
assert(_helper.get());
Value v;
ValueCodec::write(value, v, _communicator, _encoding);
_helper->set(v);
_refValid = false;
}
private:
void incr()
{
assert(_helper.get() != 0);
if(!_helper->next())
{
//
// The iterator has been moved past the end, and is now
// invalid.
//
_helper.reset();
}
_refValid = false;
}
void getCurrentValue(key_type& key, mapped_type& value) const
{
assert(_helper.get() != 0);
const Key* k = 0;
const Value* v = 0;
_helper->get(k, v);
assert(k != 0);
assert(v != 0);
KeyCodec::read(key, *k, _communicator, _encoding);
ValueCodec::read(value, *v, _communicator, _encoding);
}
friend class ConstIterator<key_type, mapped_type, KeyCodec, ValueCodec, Compare>;
friend class Map<key_type, mapped_type, KeyCodec, ValueCodec, Compare>;
IceUtil::UniquePtr<IteratorHelper> _helper;
Ice::CommunicatorPtr _communicator;
Ice::EncodingVersion _encoding;
//
// Cached last return value. This is so that operator->() can
// actually return a pointer. The cached value is reused across
// multiple calls to operator->() if _refValid is true, which
// avoids problems in certain situations. For example, if
// _ref.second is an STL container and you use an STL algorithm
// such as transform, STLport (debug build) asserts that the
// addresses of the containers are the same. This would fail if
// the same value was not returned on subsequent calls to
// operator->().
//
mutable value_type _ref;
mutable bool _refValid;
};
//
// See Iterator comments for design notes
//
template <typename key_type, typename mapped_type, typename KeyCodec, typename ValueCodec, typename Compare>
class ConstIterator : public IteratorBase
{
public:
typedef ptrdiff_t difference_type;
typedef std::pair<const key_type, const mapped_type> value_type;
typedef value_type* pointer;
typedef value_type& reference;
ConstIterator(IteratorHelper* helper,
const Ice::CommunicatorPtr& communicator,
const Ice::EncodingVersion& encoding) :
_helper(helper),
_communicator(communicator),
_encoding(encoding),
_refValid(false)
{
}
ConstIterator() :
_encoding(Ice::Encoding_1_0),
_refValid(false)
{
}
ConstIterator(const ConstIterator& rhs) :
_communicator(rhs._communicator),
_encoding(rhs._encoding),
_refValid(false)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
}
//
// A Iterator can be converted to a ConstIterator (but not
// vice versa) - same for operator=.
//
ConstIterator(const Iterator<key_type, mapped_type, KeyCodec, ValueCodec, Compare>& rhs) :
_communicator(rhs._communicator),
_encoding(rhs._encoding),
_refValid(false)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
}
ConstIterator& operator=(const ConstIterator& rhs)
{
if(this != &rhs)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
else
{
_helper.reset();
}
_communicator = rhs._communicator;
_encoding = rhs._encoding;
_refValid = false;
}
return *this;
}
//
// Create const_iterator from iterator.
//
ConstIterator& operator=(const Iterator<key_type, mapped_type, KeyCodec, ValueCodec, Compare>& rhs)
{
if(rhs._helper.get() != 0)
{
_helper.reset(rhs._helper->clone());
}
else
{
_helper.reset();
}
_communicator = rhs._communicator;
_encoding = rhs._encoding;
_refValid = false;
return *this;
}
~ConstIterator()
{
}
bool operator==(const ConstIterator& rhs)
{
if(_helper.get() == rhs._helper.get())
{
return true;
}
if(_helper.get() != 0 && rhs._helper.get() != 0)
{
const Key* lhsKey = _helper->get();
const Key* rhsKey = rhs._helper->get();
if(lhsKey != 0 && rhsKey != 0)
{
return *lhsKey == *rhsKey;
}
}
return false;
}
bool operator!=(const ConstIterator& rhs)
{
return !(*this == rhs);
}
ConstIterator& operator++()
{
incr();
return *this;
}
ConstIterator operator++(int)
{
ConstIterator tmp = *this;
incr();
return tmp;
}
//
// Note that this doesn't follow the regular iterator mapping:
//
// value_type operator*() const
//
value_type& operator*() const
{
if(!_refValid)
{
key_type key;
mapped_type value;
getCurrentValue(key, value);
//
// !IMPORTANT!
//
// This method has to cache the returned value to implement
// operator->().
//
const_cast<key_type&>(_ref.first) = key;
const_cast<mapped_type&>(_ref.second) = value;
_refValid = true;
}
return _ref;
}
pointer operator->() const { return &(operator*()); }
private:
void incr()
{
assert(_helper.get() != 0);
if(!_helper->next())
{
//
// The iterator has been moved past the end, and is now
// invalid.
//
_helper.reset();
}
_refValid = false;
}
void getCurrentValue(key_type& key, mapped_type& value) const
{
assert(_helper.get() != 0);
const Key* k = 0;
const Value* v = 0;
_helper->get(k, v);
assert(k != 0);
assert(v != 0);
KeyCodec::read(key, *k, _communicator, _encoding);
ValueCodec::read(value, *v, _communicator, _encoding);
}
friend class Map<key_type, mapped_type, KeyCodec, ValueCodec, Compare>;
IceUtil::UniquePtr<IteratorHelper> _helper;
Ice::CommunicatorPtr _communicator;
Ice::EncodingVersion _encoding;
//
// Cached last return value. This is so that operator->() can
// actually return a pointer. The cached value is reused across
// multiple calls to operator->() if _refValid is true, which
// avoids problems in certain situations. For example, if
// _ref.second is an STL container and you use an STL algorithm
// such as transform, STLport (debug build) asserts that the
// addresses of the containers are the same. This would fail
// if the same value was not returned on subsequent calls
// to operator->().
//
mutable value_type _ref;
mutable bool _refValid;
};
struct IceEncodingCompare {};
template<typename key_type, typename KeyCodec, typename Compare>
class KeyCompare : public KeyCompareBase
{
public:
KeyCompare(const Compare& mapCompare,
const Ice::CommunicatorPtr& communicator,
const Ice::EncodingVersion& encoding) :
KeyCompareBase(true),
_compare(mapCompare),
_communicator(communicator),
_encoding(encoding)
{}
virtual int compare(const Key& dbKey1, const Key& dbKey2)
{
key_type key1;
KeyCodec::read(key1, dbKey1, _communicator, _encoding);
key_type key2;
KeyCodec::read(key2, dbKey2, _communicator, _encoding);
if(_compare(key1, key2))
{
return -1;
}
else if(_compare(key2, key1))
{
return 1;
}
else
{
return 0;
}
}
private:
Compare _compare;
const Ice::CommunicatorPtr _communicator;
const Ice::EncodingVersion _encoding;
};
//
// Partial template specialization:
// do nothing for the IceEncodingCompare comparator
//
template<typename key_type, typename KeyCodec>
class KeyCompare<key_type, KeyCodec, IceEncodingCompare> : public KeyCompareBase
{
public:
KeyCompare(const IceEncodingCompare&, const Ice::CommunicatorPtr&, const Ice::EncodingVersion&):
KeyCompareBase(false)
{}
virtual int compare(const Key&, const Key&)
{
assert(0);
return 0;
}
};
//
// Need to separate MapIndex template class because _communicator is
// set later
//
template<typename key_type, typename KeyCodec, typename Compare>
class MapIndex : public MapIndexBase
{
public:
virtual int compare(const Key& dbKey1, const Key& dbKey2)
{
key_type key1;
KeyCodec::read(key1, dbKey1, _communicator, _encoding);
key_type key2;
KeyCodec::read(key2, dbKey2, _communicator, _encoding);
if(_compare(key1, key2))
{
return -1;
}
else if(_compare(key2, key1))
{
return 1;
}
else
{
return 0;
}
}
protected:
MapIndex(const std::string& mapName, const Compare& mapCompare) :
MapIndexBase(mapName, true),
_compare(mapCompare)
{}
private:
Compare _compare;
};
//
// Partial template specialization:
// do nothing for the IceEncodingCompare comparator
//
template<typename key_type, typename KeyCodec>
class MapIndex<key_type, KeyCodec, IceEncodingCompare> : public MapIndexBase
{
public:
virtual int compare(const Key&, const Key&)
{
assert(0);
return 0;
}
protected:
MapIndex(const std::string& mapName, const IceEncodingCompare&):
MapIndexBase(mapName, false)
{}
};
//
// A sorted map, similar to a std::map, with one notable difference:
// operator[] is not provided.
//
//
// TODO: implement bidirectional iterators.
//
template<typename key_type, typename mapped_type,
typename KeyCodec, typename ValueCodec,
typename Compare = IceEncodingCompare>
class Map
{
public:
typedef std::pair<const key_type, const mapped_type> value_type;
typedef Iterator<key_type, mapped_type, KeyCodec, ValueCodec, Compare> iterator;
typedef ConstIterator<key_type, mapped_type, KeyCodec, ValueCodec, Compare> const_iterator;
//
// No definition for reference, const_reference, pointer or
// const_pointer.
//
typedef size_t size_type;
typedef ptrdiff_t difference_type;
//
// Allocators are not supported.
//
// allocator_type
//
//
// Constructors
//
Map(const Freeze::ConnectionPtr& connection,
const std::string& dbName,
bool createDb = true,
const Compare& compare = Compare()) :
_communicator(connection->getCommunicator()),
_encoding(connection->getEncoding())
{
KeyCompareBasePtr keyCompare = new KeyCompare<key_type, KeyCodec, Compare>(compare, _communicator, _encoding);
std::vector<MapIndexBasePtr> indices;
_helper.reset(MapHelper::create(connection, dbName, KeyCodec::typeId(), ValueCodec::typeId(), keyCompare,
indices, createDb));
}
template<class _InputIterator>
Map(const Freeze::ConnectionPtr& connection,
const std::string& dbName,
bool createDb,
_InputIterator first, _InputIterator last,
const Compare& compare = Compare()) :
_communicator(connection->getCommunicator()),
_encoding(connection->getEncoding())
{
KeyCompareBasePtr keyCompare = new KeyCompare<key_type, KeyCodec, Compare>(compare, _communicator, _encoding);
std::vector<MapIndexBasePtr> indices;
_helper.reset(MapHelper::create(connection, dbName, KeyCodec::typeId(), ValueCodec::typeId(), keyCompare,
indices, createDb));
while(first != last)
{
put(*first);
++first;
}
}
~Map()
{
}
// static void recreate(const Freeze::ConnectionPtr& connection,
// const std::string& dbName,
// const Compare& compare = Compare())
// {
// KeyCompareBasePtr keyCompare = new KeyCompare<key_type, KeyCodec, Compare>(compare,
// connection->getCommunicator(),
// connection->getEncoding());
// std::vector<MapIndexBasePtr> indices;
// MapHelper::recreate(connection, dbName, KeyCodec::typeId(), ValueCodec::typeId(), keyCompare, indices);
// }
bool operator==(const Map& rhs) const
{
//
// This does a memberwise equality for the entire contents of
// the database. While slow this is always correct. Database
// equality is not necessarily correct in the context of a
// transaction.
//
if(size() != rhs.size())
{
return false;
}
for(const_iterator p = rhs.begin() ; p != rhs.end() ; ++p)
{
const_iterator q = rhs.find(p->first);
if(q == rhs.end())
{
return false;
}
if(p->second != q->second)
{
return false;
}
}
return true;
}
bool operator!=(const Map& rhs) const
{
return !(*this == rhs);
}
void swap(Map& rhs)
{
MapHelper* tmp = _helper.release();
_helper.reset(rhs._helper.release());
rhs._helper.reset(tmp);
Ice::CommunicatorPtr tmpCom = _communicator;
Ice::EncodingVersion tmpEnc = _encoding;
_communicator = rhs._communicator;
_encoding = rhs._encoding;
rhs._communicator = tmpCom;
rhs._encoding = tmpEnc;
}
iterator begin()
{
try
{
return iterator(IteratorHelper::create(*_helper.get(), false), _communicator, _encoding);
}
catch(const NotFoundException&)
{
return iterator();
}
}
const_iterator begin() const
{
try
{
return const_iterator(IteratorHelper::create(*_helper.get(), true), _communicator, _encoding);
}
catch(const NotFoundException&)
{
return const_iterator();
}
}
iterator end()
{
return iterator();
}
const_iterator end() const
{
return const_iterator();
}
bool empty() const
{
return size() == 0;
}
size_type size() const
{
return _helper->size();
}
size_type max_size() const
{
return 0xffffffff; // TODO: is this the max?
}
//
// This method isn't implemented.
//
// mapped_type& operator[](const key_type& key)
//
//
// This method isn't in the STLport library - but it's referenced
// in "STL Tutorial and Reference Guide, Second Edition". It's not
// currently implemented.
//
// const mapped_type& operator[](const key_type& key) const;
//
//
// No allocators.
//
//allocator_type get_allocator() const;
//
iterator insert(iterator /*position*/, const value_type& key)
{
//
// position is ignored.
//
Key k;
KeyCodec::write(key.first, k, _communicator, _encoding);
iterator r = iterator(_helper->find(k, false), _communicator, _encoding);
if(r == end())
{
Value v;
ValueCodec::write(key.second, v, _communicator, _encoding);
_helper->put(k, v);
r = iterator(_helper->find(k, false), _communicator, _encoding);
}
return r;
}
std::pair<iterator, bool> insert(const value_type& key)
{
Key k;
KeyCodec::write(key.first, k, _communicator, _encoding);
iterator r = iterator(_helper->find(k, false), _communicator, _encoding);
bool inserted = false;
if(r == end())
{
Value v;
ValueCodec::write(key.second, v, _communicator, _encoding);
_helper->put(k, v);
inserted = true;
r = iterator(_helper->find(k, false), _communicator, _encoding);
}
return std::pair<iterator, bool>(r, inserted);
}
template <typename InputIterator>
void insert(InputIterator first, InputIterator last)
{
while(first != last)
{
insert(*first);
++first;
}
}
void put(const value_type& key)
{
//
// insert or replace
//
Key k;
Value v;
KeyCodec::write(key.first, k, _communicator, _encoding);
ValueCodec::write(key.second, v, _communicator, _encoding);
_helper->put(k, v);
}
template <typename InputIterator>
void put(InputIterator first, InputIterator last)
{
while(first != last)
{
put(*first);
++first;
}
}
void erase(iterator position)
{
assert(position._helper.get() != 0);
position._helper->erase();
}
size_type erase(const key_type& key)
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return _helper->erase(k);
}
void erase(iterator first, iterator last)
{
while(first != last)
{
first._helper->erase();
++first;
}
}
void clear()
{
_helper->clear();
}
//
// destroy is not a standard function
//
void destroy()
{
_helper->destroy();
}
//
// closeDb closes the underlying Berkeley DB database
//
void closeDb()
{
_helper->closeDb();
}
iterator find(const key_type& key)
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return iterator(_helper->find(k, false), _communicator, _encoding);
}
const_iterator find(const key_type& key) const
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return const_iterator(_helper->find(k, true), _communicator, _encoding);
}
size_type count(const key_type& key) const
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return _helper->count(k);
}
iterator lower_bound(const key_type& key)
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return iterator(_helper->lowerBound(k, false), _communicator, _encoding);
}
const_iterator lower_bound(const key_type& key) const
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return iterator(_helper->lowerBound(k, true), _communicator, _encoding);
}
iterator upper_bound(const key_type& key)
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return iterator(_helper->upperBound(k, false), _communicator, _encoding);
}
const_iterator upper_bound(const key_type& key) const
{
Key k;
KeyCodec::write(key, k, _communicator, _encoding);
return iterator(_helper->upperBound(k, true), _communicator, _encoding);
}
std::pair<iterator, iterator> equal_range(const key_type& key)
{
return std::make_pair(lower_bound(key), upper_bound(key));
}
std::pair<const_iterator, const_iterator>
equal_range(const key_type& key) const
{
return std::make_pair(lower_bound(key), upper_bound(key));
}
const Ice::CommunicatorPtr&
communicator() const
{
return _communicator;
}
//
// getConnection returns the associated connection
//
ConnectionPtr getConnection() const
{
return _helper->getConnection();
}
protected:
Map(const Ice::CommunicatorPtr& mapCommunicator, const Ice::EncodingVersion& encoding) :
_communicator(mapCommunicator),
_encoding(encoding)
{
}
IceUtil::UniquePtr<MapHelper> _helper;
Ice::CommunicatorPtr _communicator;
Ice::EncodingVersion _encoding;
};
}
#endif
|