/usr/include/sdsl/int_vector.hpp is in libsdsl-dev 2.0.3-4.
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 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 | /* sdsl - succinct data structures library
Copyright (C) 2008-2013 Simon Gog
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/ .
*/
/*! \file int_vector.hpp
\brief int_vector.hpp contains the sdsl::int_vector class.
\author Simon Gog
*/
#ifndef INCLUDED_SDSL_INT_VECTOR
#define INCLUDED_SDSL_INT_VECTOR
#include "bits.hpp"
#include "structure_tree.hpp"
#include "util.hpp"
#include "io.hpp"
#include "config.hpp"
#include "uintx_t.hpp"
#include "memory_management.hpp"
#include "ram_fs.hpp"
#include "sfstream.hpp"
#include <iosfwd> // forward declaration of ostream
#include <stdexcept> // for exceptions
#include <iostream> // for cerr
#include <typeinfo>
#include <cassert>
#include <iterator>
#include <cstdlib>
#include <cstddef>
#include <ctime> // for rand initialization
#include <cstring> // for memcpy
#include <ostream>
#include <istream>
#include <string>
#include <initializer_list>
#include <type_traits>
#include <vector>
//! Namespace for the succinct data structure library.
namespace sdsl
{
typedef uint64_t std_size_type_for_int_vector;
template<uint8_t t_width=0>
class int_vector;
template<class int_vector_type>
class mm_item;
namespace algorithm
{
template<uint8_t t_width>
static void calculate_sa(const unsigned char* c,
typename int_vector<t_width>::size_type len,
int_vector<t_width>& sa);
}
//! bit_vector is a specialization of the int_vector.
typedef int_vector<1> bit_vector;
template<class t_int_vector>
class int_vector_reference;
template<class t_int_vector>
class int_vector_iterator_base;
template<class t_int_vector>
class int_vector_iterator;
template<class t_int_vector>
class int_vector_const_iterator;
template<uint8_t t_width>
class int_vector_mapper;
template<uint8_t b, uint8_t t_patter_len> // forward declaration
class rank_support_v;
class rank_support;
class select_support;
template<uint8_t t_bit_pattern, uint8_t t_pattern_len>
class select_support_mcl;
namespace coder
{
class fibonacci;
class elias_delta;
class elias_gamma;
template<uint8_t t_width> class comma;
}
template<uint8_t t_width>
struct int_vec_category_trait {
typedef iv_tag type;
};
template<>
struct int_vec_category_trait<1> {
typedef bv_tag type;
};
template<uint8_t t_width>
struct int_vector_trait {
typedef uint64_t value_type;
typedef int_vector<t_width> int_vector_type;
typedef int_vector_reference<int_vector_type> reference;
typedef const uint64_t const_reference;
typedef uint8_t int_width_type;
typedef int_vector_iterator<int_vector_type> iterator;
typedef int_vector_const_iterator<int_vector_type> const_iterator;
static iterator begin(int_vector_type* v, uint64_t*) {
return iterator(v, 0);
}
static iterator end(int_vector_type* v, uint64_t*, int_vector_size_type) {
return iterator(v, v->size()*v->width()) ;
}
static const_iterator begin(const int_vector_type* v, const uint64_t*) {
return const_iterator(v, 0);
}
static const_iterator end(const int_vector_type* v, const uint64_t*, int_vector_size_type) {
return const_iterator(v, v->size()*v->width());
}
};
template<>
struct int_vector_trait<64> {
typedef uint64_t value_type;
typedef int_vector<64> int_vector_type;
typedef uint64_t& reference;
typedef const uint64_t const_reference;
typedef const uint8_t int_width_type;
typedef uint64_t* iterator;
typedef const uint64_t* const_iterator;
static iterator begin(int_vector_type*, uint64_t* begin) {
return begin;
}
static iterator end(int_vector_type*, uint64_t* begin, int_vector_size_type size) {
return begin+size;
}
static const_iterator begin(const int_vector_type*, const uint64_t* begin) {
return begin;
}
static const_iterator end(const int_vector_type*, const uint64_t* begin, int_vector_size_type size) {
return begin+size;
}
};
template<>
struct int_vector_trait<32> {
typedef uint32_t value_type;
typedef int_vector<32> int_vector_type;
typedef uint32_t& reference;
typedef const uint32_t const_reference;
typedef const uint8_t int_width_type;
typedef uint32_t* iterator;
typedef const uint32_t* const_iterator;
static iterator begin(int_vector_type*, uint64_t* begin) {
return (uint32_t*)begin;
}
static iterator end(int_vector_type*, uint64_t* begin, int_vector_size_type size) {
return ((uint32_t*)begin)+size;
}
static const_iterator begin(const int_vector_type*, const uint64_t* begin) {
return (uint32_t*)begin;
}
static const_iterator end(const int_vector_type*, const uint64_t* begin, int_vector_size_type size) {
return ((uint32_t*)begin)+size;
}
};
template<>
struct int_vector_trait<16> {
typedef uint16_t value_type;
typedef int_vector<16> int_vector_type;
typedef uint16_t& reference;
typedef const uint16_t const_reference;
typedef const uint8_t int_width_type;
typedef uint16_t* iterator;
typedef const uint16_t* const_iterator;
static iterator begin(int_vector_type*, uint64_t* begin) {
return (uint16_t*)begin;
}
static iterator end(int_vector_type*, uint64_t* begin, int_vector_size_type size) {
return ((uint16_t*)begin)+size;
}
static const_iterator begin(const int_vector_type*, const uint64_t* begin) {
return (uint16_t*)begin;
}
static const_iterator end(const int_vector_type*, const uint64_t* begin, int_vector_size_type size) {
return ((uint16_t*)begin)+size;
}
};
template<>
struct int_vector_trait<8> {
typedef uint8_t value_type;
typedef int_vector<8> int_vector_type;
typedef uint8_t& reference;
typedef const uint8_t const_reference;
typedef const uint8_t int_width_type;
typedef uint8_t* iterator;
typedef const uint8_t* const_iterator;
static iterator begin(int_vector_type*, uint64_t* begin) {
return (uint8_t*)begin;
}
static iterator end(int_vector_type*, uint64_t* begin, int_vector_size_type size) {
return ((uint8_t*)begin)+size;
}
static const_iterator begin(const int_vector_type*, const uint64_t* begin) {
return (uint8_t*)begin;
}
static const_iterator end(const int_vector_type*, const uint64_t* begin, int_vector_size_type size) {
return ((uint8_t*)begin)+size;
}
};
//! A generic vector class for integers of width \f$w\in [1..64]\f$.
/*! \author Simon Gog
*
* This generic vector class could be used to generate a vector
* that contains integers of fixed width \f$w\in [1..64]\f$.
*
* \tparam t_width Width of the integer. If set to `0` it is variable
* during runtime, otherwise fixed at compile time.
* @ingroup int_vector
*/
template<uint8_t t_width>
class int_vector
{
private:
static_assert(t_width <= 64 , "int_vector: width of must be at most 64bits.");
public:
typedef typename int_vector_trait<t_width>::value_type value_type;
typedef typename int_vector_trait<t_width>::iterator iterator;
typedef typename int_vector_trait<t_width>::const_iterator const_iterator;
typedef typename int_vector_trait<t_width>::reference reference;
typedef typename int_vector_trait<t_width>::const_reference const_reference;
typedef int_vector_reference<int_vector>* pointer;
typedef const value_type* const_pointer;
typedef ptrdiff_t difference_type;
typedef int_vector_size_type size_type;
typedef typename int_vector_trait<t_width>::int_width_type int_width_type;
typedef rank_support_v<1,1> rank_1_type;
typedef rank_support_v<0,1> rank_0_type;
typedef select_support_mcl<1,1> select_1_type;
typedef select_support_mcl<0,1> select_0_type;
typedef typename int_vec_category_trait<t_width>::type index_category;
friend struct int_vector_trait<t_width>;
friend class int_vector_iterator_base<int_vector>;
friend class int_vector_iterator<int_vector>;
friend class int_vector_const_iterator<int_vector>;
friend class int_vector_mapper<t_width>;
friend class coder::elias_delta;
friend class coder::elias_gamma;
friend class coder::fibonacci;
template<uint8_t> friend class coder::comma;
friend class memory_manager;
enum { fixed_int_width = t_width }; // make template parameter accessible
private:
size_type m_size; //!< Number of bits needed to store int_vector.
uint64_t* m_data; //!< Pointer to the memory for the bits.
int_width_type m_width; //!< Width of the integers.
public:
//! Constructor for int_vector.
/*! \param size Number of elements. Default value is 0.
\param default_value Initialize all value to `default value`.
\param int_width The width of each integer.
\sa resize, width
*/
int_vector(size_type size = 0, value_type default_value = 0,
uint8_t int_width = t_width);
//! Constructor for initializer_list.
template<class t_T>
int_vector(std::initializer_list<t_T> il) : int_vector() {
resize(il.size());
size_type idx = 0;
for (auto x : il) {
(*this)[idx++] = x;
}
}
//! Move constructor.
int_vector(int_vector&& v);
//! Copy constructor.
int_vector(const int_vector& v);
//! Destructor.
~int_vector();
//! Equivalent to size() == 0.
bool empty() const {
return 0==m_size;
}
//! Swap method for int_vector.
void swap(int_vector& v);
//! Resize the int_vector in terms of elements.
/*! \param size The size to resize the int_vector in terms of elements.
*/
void resize(const size_type size) {
bit_resize(size * width());
}
//! Resize the int_vector in terms of bits.
/*! \param size The size to resize the int_vector in terms of bits.
*/
void bit_resize(const size_type size);
//! The number of elements in the int_vector.
/*! \sa max_size, bit_size, capacity
*/
size_type size() const {
return m_size/m_width;
}
//! Maximum size of the int_vector.
/*! \sa size, bit_size, capacity
*/
static size_type max_size() {
return ((size_type)1)<<(sizeof(size_type)*8-6);
}
//! The number of bits in the int_vector.
/*! \sa size, max_size, bit_size, capacity
*/
size_type bit_size() const {
return m_size;
}
//! Returns the size of the occupied bits of the int_vector.
/*! The capacity of a int_vector is greater or equal to the
bit_size of the vector: capacity() >= bit_size().
\sa size, bit_size, max_size, capacity
*/
size_type capacity() const {
return ((m_size+63)>>6)<<6;
}
//! Pointer to the raw data of the int_vector
/*! \returns Const pointer to the raw data of the int_vector
*/
const uint64_t* data() const {
return m_data;
}
//! Pointer to the raw data of the int_vector
/*! \returns pointer to the raw data of the int_vector
*/
uint64_t* data() {
return m_data;
}
//! Get the integer value of the binary string of length len starting at position idx in the int_vector.
/*! \param idx Starting index of the binary representation of the integer.
\param len Length of the binary representation of the integer. Default value is 64.
\returns The integer value of the binary string of length len starting at position idx.
\sa setInt, getBit, setBit
*/
value_type get_int(size_type idx, const uint8_t len=64) const;
//! Set the bits from position idx to idx+len-1 to the binary representation of integer x.
/*! The bit at position idx represents the least significant bit(lsb), and the bit at
position idx+len-1 the most significant bit (msb) of x.
\param idx Starting index of the binary representation of x.
\param x The integer to store in the int_vector.
\param len The length used to store x in the int_vector. Default value is 64.
\sa getInt, getBit, setBit
*/
void set_int(size_type idx, value_type x, const uint8_t len=64);
//! Returns the width of the integers which are accessed via the [] operator.
/*! \returns The width of the integers which are accessed via the [] operator.
\sa width
*/
uint8_t width() const {
return m_width;
}
//! Sets the width of the integers which are accessed via the [] operator, if t_width equals 0.
/*! \param intWidth New width of the integers accessed via the [] operator.
\note This method has no effect if t_width is in the range [1..64].
\sa width
*/
void width(uint8_t) { }
// Write data (without header) to a stream.
size_type write_data(std::ostream& out) const;
//! Serializes the int_vector to a stream.
/*! \return The number of bytes written to out.
* \sa load
*/
size_type serialize(std::ostream& out, structure_tree_node* v=nullptr,
std::string name = "", bool write_fixed_as_variable=false) const;
//! Load the int_vector for a stream.
void load(std::istream& in);
//! non const version of [] operator
/*! \param i Index the i-th integer of length width().
* \return A reference to the i-th integer of length width().
*/
inline reference operator[](const size_type& i);
//! const version of [] operator
/*! \param i Index the i-th integer of length width().
* \return The value of the i-th integer of length width().
*/
inline const_reference operator[](const size_type& i) const;
//! Assignment operator.
/*! \param v The vector v which should be assigned
*/
int_vector& operator=(const int_vector& v);
//! Move assignment operator.
int_vector& operator=(int_vector&& v);
//! Equality operator for two int_vectors.
/*! Two int_vectors are equal if
* - capacities and sizes are equal and
* - width are equal and
* - the bits in the range [0..bit_size()-1] are equal.
*/
bool operator==(const int_vector& v) const;
//! Inequality operator for two int_vectors.
/*! Two int_vectors are not equal if
* - capacities and sizes are not equal or
* - int widths are not equal or
* - the bits in the range [0..bit_size()-1] are not equal.
*/
bool operator!=(const int_vector& v) const;
//! Less operator for two int_vectors
/*! int_vector w is less than v if
* - w[i]==v[i] for i<j and w[j]<v[j] with j in [0, min(w.size(), v.size()) )
* - or w[i]==v[i] for all i < min(w.size(), v.size()) and w.size()<v.size().
* \sa operator>
*/
bool operator<(const int_vector& v) const;
//! Greater operator for two int_vectors
/*! int_vector w is greater than v if
* - w[i]==v[i] for i<j and w[j]>v[j] with j in [0, min(w.size(), v.size()) )
* - or w[i]==v[i] for all i < min(w.size(), v.size()) and w.size()>v.size().
*/
bool operator>(const int_vector& v) const;
//! Less or equal operator
bool operator<=(const int_vector& v) const;
//! Greater of equal operator
bool operator>=(const int_vector& v) const;
//! Iterator that points to the first element of the int_vector.
/*! Time complexity guaranty is O(1).
*/
const iterator begin() {
return int_vector_trait<t_width>::begin(this, m_data);
}
//! Iterator that points to the element after the last element of int_vector.
/*! Time complexity guaranty is O(1).
*/
const iterator end() {
return int_vector_trait<t_width>::end(this, m_data, (m_size/m_width));
}
//! Const iterator that points to the first element of the int_vector.
const const_iterator begin() const {
return int_vector_trait<t_width>::begin(this, m_data);
}
//! Const iterator that points to the element after the last element of int_vector.
const const_iterator end() const {
return int_vector_trait<t_width>::end(this, m_data, (m_size/m_width));
}
//! Flip all bits of bit_vector
void flip() {
static_assert(1 == t_width, "int_vector: flip() is available only for bit_vector.");
}
//! Read the size and int_width of a int_vector
static void read_header(int_vector_size_type& size, int_width_type& int_width, std::istream& in) {
read_member(size, in);
if (0 == t_width) {
read_member(int_width, in);
}
}
//! Write the size and int_width of a int_vector
static uint64_t write_header(uint64_t size, uint8_t int_width, std::ostream& out) {
uint64_t written_bytes = write_member(size, out);
if (0 == t_width) {
written_bytes += write_member(int_width, out);
}
return written_bytes;
}
struct raw_wrapper {
const int_vector& vec;
raw_wrapper() = delete;
raw_wrapper(const int_vector& _vec) : vec(_vec) {}
size_type
serialize(std::ostream& out, structure_tree_node* v=nullptr, std::string name="")const {
structure_tree_node* child = structure_tree::add_child(v, name, util::class_name(*this));
auto written_bytes = vec.write_data(out);
structure_tree::add_size(child, written_bytes);
return written_bytes;
}
};
const raw_wrapper raw = raw_wrapper(*this);
};
template<>
void int_vector<0>::width(const uint8_t);
template<>
void bit_vector::flip();
//! A proxy class that acts as a reference to an integer of length \p len bits in a int_vector.
/*! \tparam t_int_vector The specific int_vector class.
*/
template<class t_int_vector>
class int_vector_reference
{
public:
typedef typename t_int_vector::value_type value_type;
private:
typename t_int_vector::value_type* const m_word;
const uint8_t m_offset;
const uint8_t m_len; //!< Length of the integer referred to in bits.
public:
//! Constructor for the reference class
/*! \param word Pointer to the corresponding 64bit word in the int_vector.
\param offset Offset to the starting bit (offset in [0..63])
\param len length of the integer, should be v->width()!!!
*/
int_vector_reference(value_type* word, uint8_t offset, uint8_t len):
m_word(word),m_offset(offset),m_len(len) {};
//! Assignment operator for the proxy class
/*!
The integer x is assign to the referenced
position in the t_int_vector with the specified width
of the int_vector
\param x 64bit integer to assign
\return A const_reference to the assigned reference
*/
int_vector_reference& operator=(value_type x) {
bits::write_int(m_word, x, m_offset, m_len);
return *this;
};
int_vector_reference& operator=(const int_vector_reference& x) {
return *this = value_type(x);
};
//! Cast the reference to a int_vector<>::value_type
operator value_type()const {
return bits::read_int(m_word, m_offset, m_len);
}
//! Prefix increment of the proxy object
int_vector_reference& operator++() {
value_type x = bits::read_int(m_word, m_offset, m_len);
bits::write_int(m_word, x+1, m_offset, m_len);
return *this;
}
//! Postfix increment of the proxy object
value_type operator++(int) {
value_type val = (typename t_int_vector::value_type)*this;
++(*this);
return val;
}
//! Prefix decrement of the proxy object
int_vector_reference& operator--() {
value_type x = bits::read_int(m_word, m_offset, m_len);
bits::write_int(m_word, x-1, m_offset, m_len);
return *this;
}
//! Postfix decrement of the proxy object
value_type operator--(int) {
value_type val = (value_type)*this;
--(*this);
return val;
}
//! Add assign from the proxy object
int_vector_reference& operator+=(const value_type x) {
value_type w = bits::read_int(m_word, m_offset, m_len);
bits::write_int(m_word, w+x, m_offset, m_len);
return *this;
}
//! Subtract assign from the proxy object
int_vector_reference& operator-=(const value_type x) {
value_type w = bits::read_int(m_word, m_offset, m_len);
bits::write_int(m_word, w-x, m_offset, m_len);
return *this;
}
bool operator==(const int_vector_reference& x)const {
return value_type(*this) == value_type(x);
}
bool operator<(const int_vector_reference& x)const {
return value_type(*this) < value_type(x);
}
};
// For C++11
template<class t_int_vector>
inline void swap(int_vector_reference<t_int_vector> x,
int_vector_reference<t_int_vector> y)
{
// TODO: more efficient solution?
typename int_vector_reference<t_int_vector>::value_type tmp = x;
x = y;
y = tmp;
}
// For C++11
template<class t_int_vector>
inline void swap(typename int_vector_reference<t_int_vector>::value_type& x,
int_vector_reference<t_int_vector> y)
{
// TODO: more efficient solution?
typename int_vector_reference<t_int_vector>::value_type tmp = x;
x = y;
y = tmp;
}
// For C++11
template<class t_int_vector>
inline void swap(int_vector_reference<t_int_vector> x,
typename int_vector_reference<t_int_vector>::value_type& y)
{
// TODO: more efficient solution?
typename int_vector_reference<t_int_vector>::value_type tmp = x;
x = y;
y = tmp;
}
// specialization for int_vector_reference for int_vector == bit_vector
// special thanks to Timo Beller, who pointed out that the specialization is missing
// Same implementation as in stl_bvector.h.
template<>
class int_vector_reference<bit_vector>
{
public:
typedef bool value_type;
private:
uint64_t* const m_word;
uint64_t m_mask;
public:
//! Constructor for the reference class
/*! \param word Pointer to the corresponding 64bit word in the int_vector.
\param offset Offset to the starting bit (offset in [0..63])
*/
int_vector_reference(uint64_t* word, uint8_t offset, uint8_t):
m_word(word),m_mask(1ULL<<offset) {};
//! Assignment operator for the proxy class
int_vector_reference& operator=(bool x) {
if (x)
*m_word |= m_mask;
else
*m_word &= ~m_mask;
return *this;
};
int_vector_reference& operator=(const int_vector_reference& x) {
return *this = bool(x);
};
//! Cast the reference to a bool
operator bool()const {
return !!(*m_word & m_mask);
}
bool operator==(const int_vector_reference& x)const {
return bool(*this) == bool(x);
}
bool operator<(const int_vector_reference& x)const {
return !bool(*this) && bool(x);
}
};
// For C++11
template<>
inline void swap(int_vector_reference<bit_vector> x,
int_vector_reference<bit_vector> y)
{
// TODO: more efficient solution?
bool tmp = x;
x = y;
y = tmp;
}
// For C++11
template<>
inline void swap(bool& x,
int_vector_reference<bit_vector> y)
{
// TODO: more efficient solution?
bool tmp = x;
x = y;
y = tmp;
}
// For C++11
template<>
inline void swap(int_vector_reference<bit_vector> x,
bool& y)
{
// TODO: more efficient solution?
bool tmp = x;
x = y;
y = tmp;
}
template<class t_int_vector>
class int_vector_iterator_base: public std::iterator<std::random_access_iterator_tag, typename t_int_vector::value_type, typename t_int_vector::difference_type>
{
public:
typedef uint64_t size_type;
protected:
uint8_t m_offset;
uint8_t m_len;
public:
int_vector_iterator_base(uint8_t offset, uint8_t len):
m_offset(offset),m_len(len) {}
int_vector_iterator_base(const t_int_vector* v=nullptr, size_type idx=0):
m_offset(idx&0x3F), m_len(v==nullptr ? 0 : v->m_width) {}
};
template<class t_int_vector>
class int_vector_iterator : public int_vector_iterator_base<t_int_vector>
{
public:
typedef int_vector_reference<t_int_vector> reference;
typedef uint64_t value_type;
typedef int_vector_iterator iterator;
typedef reference* pointer;
typedef typename t_int_vector::size_type size_type;
typedef typename t_int_vector::difference_type difference_type;
friend class int_vector_const_iterator<t_int_vector>;
private:
using int_vector_iterator_base<t_int_vector>::m_offset; // make m_offset easy usable
using int_vector_iterator_base<t_int_vector>::m_len; // make m_len easy usable
typename t_int_vector::value_type* m_word;
public:
int_vector_iterator(t_int_vector* v=nullptr, size_type idx=0):
int_vector_iterator_base<t_int_vector>(v, idx),
m_word((v != nullptr) ? v->m_data + (idx>>6) : nullptr) {}
int_vector_iterator(const int_vector_iterator<t_int_vector>& it) :
int_vector_iterator_base<t_int_vector>(it), m_word(it.m_word) {
m_offset = it.m_offset;
m_len = it.m_len;
}
reference operator*() const {
return reference(m_word, m_offset, m_len);
}
//! Prefix increment of the Iterator
iterator& operator++() {
m_offset+=m_len;
if (m_offset >= 64) {
m_offset &= 0x3F;
++m_word;
}
return *this;
}
//! Postfix increment of the Iterator
iterator operator++(int) {
int_vector_iterator it = *this;
++(*this);
return it;
}
//! Prefix decrement of the Iterator
iterator& operator--() {
m_offset-=m_len;
if (m_offset >= 64) {
m_offset &= 0x3F;
--m_word;
}
return *this;
}
//! Postfix decrement of the Iterator
iterator operator--(int) {
int_vector_iterator it = *this;
--(*this);
return it;
}
iterator& operator+=(difference_type i) {
if (i<0)
return *this -= (-i);
difference_type t = i*m_len;
m_word += (t>>6);
if ((m_offset+=(t&0x3F))&~0x3F) { // if new offset is >= 64
++m_word; // add one to the word
m_offset&=0x3F; // offset = offset mod 64
}
return *this;
}
iterator& operator-=(difference_type i) {
if (i<0)
return *this += (-i);
difference_type t = i*m_len;
m_word -= (t>>6);
if ((m_offset-=(t&0x3F))&~0x3F) { // if new offset is < 0
--m_word;
m_offset&=0x3F;
}
return *this;
}
iterator& operator=(const int_vector_iterator<t_int_vector>& it) {
if (this != &it) {
m_word = it.m_word;
m_offset = it.m_offset;
m_len = it.m_len;
}
return *this;
}
iterator operator+(difference_type i) const {
iterator it = *this;
return it += i;
}
iterator operator-(difference_type i) const {
iterator it = *this;
return it -= i;
}
reference operator[](difference_type i) const {
return *(*this + i);
}
bool operator==(const int_vector_iterator& it)const {
return it.m_word == m_word && it.m_offset == m_offset;
}
bool operator!=(const int_vector_iterator& it)const {
return !(*this==it);
}
bool operator<(const int_vector_iterator& it)const {
if (m_word == it.m_word)
return m_offset < it.m_offset;
return m_word < it.m_word;
}
bool operator>(const int_vector_iterator& it)const {
if (m_word == it.m_word)
return m_offset > it.m_offset;
return m_word > it.m_word;
}
bool operator>=(const int_vector_iterator& it)const {
return !(*this < it);
}
bool operator<=(const int_vector_iterator& it)const {
return !(*this > it);
}
inline difference_type operator-(const int_vector_iterator& it) {
return (((m_word - it.m_word)<<6) + m_offset - it.m_offset) / m_len;
}
};
//template<class t_int_vector>
//void swap(const int_vector_iterator<t_int_vector> &x, const int_vector_iterator<t_int_vector> &y){
// x->swap(*y);
//}
template<class t_int_vector>
inline int_vector_iterator<t_int_vector> operator+(typename int_vector_iterator<t_int_vector>::difference_type n, const int_vector_iterator<t_int_vector>& it)
{
return it+n;
}
template<class t_int_vector>
class int_vector_const_iterator : public int_vector_iterator_base<t_int_vector>
{
public:
typedef typename t_int_vector::value_type const_reference;
typedef const typename t_int_vector::value_type* pointer;
typedef int_vector_const_iterator const_iterator;
typedef typename t_int_vector::size_type size_type;
typedef typename t_int_vector::difference_type difference_type;
template<class X>
friend typename int_vector_const_iterator<X>::difference_type
operator-(const int_vector_const_iterator<X>& x, const int_vector_const_iterator<X>& y);
friend class int_vector_iterator<t_int_vector>;
friend class int_vector_iterator_base<t_int_vector>;
private:
using int_vector_iterator_base<t_int_vector>::m_offset; // make m_offset easy usable
using int_vector_iterator_base<t_int_vector>::m_len; // make m_len easy usable
const typename t_int_vector::value_type* m_word;
public:
int_vector_const_iterator(const t_int_vector* v=nullptr, size_type idx=0):
int_vector_iterator_base<t_int_vector>(v, idx),
m_word((v != nullptr) ? v->m_data + (idx>>6) : nullptr) {}
int_vector_const_iterator(const int_vector_const_iterator& it):
int_vector_iterator_base<t_int_vector>(it), m_word(it.m_word) {
m_offset = it.m_offset;
m_len = it.m_len;
}
int_vector_const_iterator(const int_vector_iterator<t_int_vector>& it):
m_word(it.m_word) {
m_offset = it.m_offset;
m_len = it.m_len;
}
const_reference operator*() const {
if (m_offset+m_len <= 64) {
return ((*m_word)>>m_offset)&bits::lo_set[m_len];
}
return ((*m_word)>>m_offset) |
((*(m_word+1) & bits::lo_set[(m_offset+m_len)&0x3F])<<(64-m_offset));
}
//! Prefix increment of the Iterator
const_iterator& operator++() {
m_offset+=m_len;
if (m_offset >= 64) {
m_offset &= 0x3F;
++m_word;
}
return *this;
}
//! Postfix increment of the Iterator
const_iterator operator++(int) {
int_vector_const_iterator it = *this;
++(*this);
return it;
}
//! Prefix decrement of the Iterator
const_iterator& operator--() {
m_offset-=m_len;
if (m_offset >= 64) {
m_offset &= 0x3F;
--m_word;
}
return *this;
}
//! Postfix decrement of the Iterator
const_iterator operator--(int) {
int_vector_const_iterator it = *this;
--(*this);
return it;
}
const_iterator& operator+=(difference_type i) {
if (i<0)
return *this -= (-i);
difference_type t = i*m_len;
m_word += (t>>6);
if ((m_offset+=(t&0x3F))&~0x3F) {// if new offset >= 64
++m_word; // add one to the word
m_offset&=0x3F; // offset = offset mod 64
}
return *this;
}
const_iterator& operator-=(difference_type i) {
if (i<0)
return *this += (-i);
difference_type t = i*m_len;
m_word -= (t>>6);
if ((m_offset-=(t&0x3F))&~0x3F) {// if new offset is < 0
--m_word;
m_offset&=0x3F;
}
return *this;
}
const_iterator operator+(difference_type i) const {
const_iterator it = *this;
return it += i;
}
const_iterator operator-(difference_type i) const {
const_iterator it = *this;
return it -= i;
}
const_reference operator[](difference_type i) const {
return *(*this + i);
}
bool operator==(const int_vector_const_iterator& it)const {
return it.m_word == m_word && it.m_offset == m_offset;
}
bool operator!=(const int_vector_const_iterator& it)const {
return !(*this==it);
}
bool operator<(const int_vector_const_iterator& it)const {
if (m_word == it.m_word)
return m_offset < it.m_offset;
return m_word < it.m_word;
}
bool operator>(const int_vector_const_iterator& it)const {
if (m_word == it.m_word)
return m_offset > it.m_offset;
return m_word > it.m_word;
}
bool operator>=(const int_vector_const_iterator& it)const {
return !(*this < it);
}
bool operator<=(const int_vector_const_iterator& it)const {
return !(*this > it);
}
};
template<class t_int_vector>
inline typename int_vector_const_iterator<t_int_vector>::difference_type
operator-(const int_vector_const_iterator<t_int_vector>& x,
const int_vector_const_iterator<t_int_vector>& y)
{
return (((x.m_word - y.m_word)<<6) + x.m_offset - y.m_offset) / x.m_len;
}
template<class t_int_vector>
inline int_vector_const_iterator<t_int_vector>
operator+(typename int_vector_const_iterator<t_int_vector>::difference_type n,
const int_vector_const_iterator<t_int_vector>& it)
{
return it + n;
}
template<class t_bv>
inline typename std::enable_if<std::is_same<typename t_bv::index_category ,bv_tag>::value, std::ostream&>::type
operator<<(std::ostream& os, const t_bv& bv)
{
for (auto b : bv) {
os << b;
}
return os;
}
// ==== int_vector implementation ====
template<uint8_t t_width>
inline int_vector<t_width>::int_vector(size_type size, value_type default_value, uint8_t intWidth):
m_size(0), m_data(nullptr), m_width(t_width)
{
width(intWidth);
resize(size);
util::set_to_value(*this, default_value); // new initialization
}
template<uint8_t t_width>
inline int_vector<t_width>::int_vector(int_vector&& v) :
m_size(v.m_size), m_data(v.m_data), m_width(v.m_width)
{
v.m_data = nullptr; // ownership of v.m_data now transfered
v.m_size = 0;
}
template<uint8_t t_width>
inline int_vector<t_width>::int_vector(const int_vector& v):
m_size(0), m_data(nullptr), m_width(v.m_width)
{
bit_resize(v.bit_size());
if (v.capacity() > 0) {
if (memcpy(m_data, v.data() ,v.capacity()/8)==nullptr) {
throw std::bad_alloc(); // LCOV_EXCL_LINE
}
}
width(v.m_width);
}
template<uint8_t t_width>
int_vector<t_width>& int_vector<t_width>::operator=(const int_vector& v)
{
if (this != &v) {// if v is not the same object
bit_resize(v.bit_size());
if (v.bit_size()>0) {
if (memcpy(m_data, v.data() ,v.capacity()/8)==nullptr) {
throw std::bad_alloc(); // LCOV_EXCL_LINE
}
}
width(v.width());
}
return *this;
}
template<uint8_t t_width>
int_vector<t_width>& int_vector<t_width>::operator=(int_vector&& v)
{
swap(v);
return *this;
}
// Destructor
template<uint8_t t_width>
int_vector<t_width>::~int_vector()
{
memory_manager::clear(*this);
}
template<uint8_t t_width>
void int_vector<t_width>::swap(int_vector& v)
{
if (this != &v) { // if v and _this_ are not the same object
size_type size = m_size;
uint64_t* data = m_data;
uint8_t int_width = m_width;
m_size = v.m_size;
m_data = v.m_data;
width(v.m_width);
v.m_size = size;
v.m_data = data;
v.width(int_width);
}
}
template<uint8_t t_width>
void int_vector<t_width>::bit_resize(const size_type size)
{
memory_manager::resize(*this, size);
}
template<uint8_t t_width>
auto int_vector<t_width>::get_int(size_type idx, const uint8_t len)const -> value_type
{
#ifdef SDSL_DEBUG
if (idx+len > m_size) {
throw std::out_of_range("OUT_OF_RANGE_ERROR: int_vector::get_int(size_type, uint8_t); idx+len > size()!");
}
if (len > 64) {
throw std::out_of_range("OUT_OF_RANGE_ERROR: int_vector::get_int(size_type, uint8_t); len>64!");
}
#endif
return bits::read_int(m_data+(idx>>6), idx&0x3F, len);
}
template<uint8_t t_width>
inline void int_vector<t_width>::set_int(size_type idx, value_type x, const uint8_t len)
{
#ifdef SDSL_DEBUG
if (idx+len > m_size) {
throw std::out_of_range("OUT_OF_RANGE_ERROR: int_vector::set_int(size_type, uint8_t); idx+len > size()!");
}
if (len > 64) {
throw std::out_of_range("OUT_OF_RANGE_ERROR: int_vector::set_int(size_type, uint8_t); len>64!");
}
#endif
bits::write_int(m_data+(idx>>6), x, idx&0x3F, len);
}
template<uint8_t t_width>
inline auto int_vector<t_width>::operator[](const size_type& idx) -> reference {
assert(idx < this->size());
size_type i = idx * m_width;
return reference(this->m_data + (i>>6), i&0x3F, m_width);
}
// specialized [] operator for 64 bit access.
template<>
inline auto int_vector<64>::operator[](const size_type& idx) -> reference {
assert(idx < this->size());
return *(this->m_data+idx);
}
// specialized [] operator for 32 bit access.
template<>
inline auto int_vector<32>::operator[](const size_type& idx) -> reference {
assert(idx < this->size());
return *(((uint32_t*)(this->m_data))+idx);
}
// specialized [] operator for 16 bit access.
template<>
inline auto int_vector<16>::operator[](const size_type& idx) -> reference {
assert(idx < this->size());
return *(((uint16_t*)(this->m_data))+idx);
}
// specialized [] operator for 8 bit access.
template<>
inline auto int_vector<8>::operator[](const size_type& idx) -> reference {
assert(idx < this->size());
return *(((uint8_t*)(this->m_data))+idx);
}
template<uint8_t t_width>
inline auto
int_vector<t_width>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return get_int(idx * t_width, t_width);
}
template<>
inline auto
int_vector<0>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return get_int(idx * m_width, m_width);
}
template<>
inline auto
int_vector<64>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return *(this->m_data+idx);
}
template<>
inline auto
int_vector<32>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return *(((uint32_t*)this->m_data)+idx);
}
template<>
inline auto
int_vector<16>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return *(((uint16_t*)this->m_data)+idx);
}
template<>
inline auto
int_vector<8>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return *(((uint8_t*)this->m_data)+idx);
}
template<>
inline auto
int_vector<1>::operator[](const size_type& idx)const -> const_reference
{
assert(idx < this->size());
return ((*(m_data+(idx>>6)))>>(idx&0x3F))&1;
}
template<uint8_t t_width>
bool int_vector<t_width>::operator==(const int_vector& v)const
{
if (capacity() != v.capacity())
return false;
if (bit_size() != v.bit_size())
return false;
if (empty())
return true;
const uint64_t* data1 = v.data();
const uint64_t* data2 = data();
for (size_type i=0; i < (capacity()>>6)-1; ++i) {
if (*(data1++) != *(data2++))
return false;
}
int8_t l = 64-(capacity()-bit_size());
return ((*data1)&bits::lo_set[l])==((*data2)&bits::lo_set[l]);
}
template<uint8_t t_width>
bool int_vector<t_width>::operator<(const int_vector& v)const
{
size_type min_size = size();
if (min_size > v.size())
min_size = v.size();
for (auto it = begin(), end = begin()+min_size, it_v = v.begin(); it!=end; ++it, ++it_v) {
if (*it == *it_v)
continue;
else
return *it < *it_v;
}
return size() < v.size();
}
template<uint8_t t_width>
bool int_vector<t_width>::operator>(const int_vector& v)const
{
size_type min_size = size();
if (min_size > v.size())
min_size = v.size();
for (auto it = begin(), end = begin()+min_size, it_v = v.begin(); it!=end; ++it, ++it_v) {
if (*it == *it_v)
continue;
else
return *it > *it_v;
}
return size() > v.size();
}
template<uint8_t t_width>
bool int_vector<t_width>::operator<=(const int_vector& v)const
{
return *this==v or *this<v;
}
template<uint8_t t_width>
bool int_vector<t_width>::operator>=(const int_vector& v)const
{
return *this==v or *this>v;
}
template<uint8_t t_width>
bool int_vector<t_width>::operator!=(const int_vector& v)const
{
return !(*this==v);
}
template<uint8_t t_width>
typename int_vector<t_width>::size_type int_vector<t_width>::write_data(std::ostream& out) const
{
size_type written_bytes = 0;
uint64_t* p = m_data;
size_type idx = 0;
while (idx+conf::SDSL_BLOCK_SIZE < (capacity()>>6)) {
out.write((char*) p, conf::SDSL_BLOCK_SIZE*sizeof(uint64_t));
written_bytes += conf::SDSL_BLOCK_SIZE*sizeof(uint64_t);
p += conf::SDSL_BLOCK_SIZE;
idx += conf::SDSL_BLOCK_SIZE;
}
out.write((char*) p, ((capacity()>>6)-idx)*sizeof(uint64_t));
written_bytes += ((capacity()>>6)-idx)*sizeof(uint64_t);
return written_bytes;
}
template<uint8_t t_width>
typename int_vector<t_width>::size_type int_vector<t_width>::serialize(std::ostream& out,
structure_tree_node* v,
std::string name,
bool write_fixed_as_variable) const
{
structure_tree_node* child = structure_tree::add_child(v, name, util::class_name(*this));
size_type written_bytes = 0;
if (t_width > 0 and write_fixed_as_variable) {
written_bytes += int_vector<0>::write_header(m_size, t_width, out);
} else {
written_bytes += int_vector<t_width>::write_header(m_size, m_width, out);
}
written_bytes += write_data(out);
structure_tree::add_size(child, written_bytes);
return written_bytes;
}
template<uint8_t t_width>
void int_vector<t_width>::load(std::istream& in)
{
size_type size;
int_vector<t_width>::read_header(size, m_width, in);
bit_resize(size);
uint64_t* p = m_data;
size_type idx = 0;
while (idx+conf::SDSL_BLOCK_SIZE < (capacity()>>6)) {
in.read((char*) p, conf::SDSL_BLOCK_SIZE*sizeof(uint64_t));
p += conf::SDSL_BLOCK_SIZE;
idx += conf::SDSL_BLOCK_SIZE;
}
in.read((char*) p, ((capacity()>>6)-idx)*sizeof(uint64_t));
}
}// end namespace sdsl
#include "int_vector_buffer.hpp"
#endif
|