/usr/include/Bpp/Numeric/VectorTools.h is in libbpp-core-dev 2.1.0-1.
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 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 | //
// File: VectorTools.h
// Created by: Julien Dutheil
// Created on: Fri Mar 14 14:16:32 2003
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for numerical calculus.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#ifndef _VECTORTOOLS_H_
#define _VECTORTOOLS_H_
#include "VectorExceptions.h"
#include "NumTools.h"
#include "AdaptiveKernelDensityEstimation.h"
#include "Matrix/Matrix.h"
#include "../Io/OutputStream.h"
#include "../App/ApplicationTools.h"
// From the STL:
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <complex>
namespace bpp
{
typedef std::vector<std::complex<double> > Vcomplex;
typedef std::vector<Vcomplex> VVcomplex;
typedef std::vector<VVcomplex> VVVcomplex;
typedef std::vector<std::complex<long double> > Vlcomplex;
typedef std::vector<Vlcomplex> VVlcomplex;
typedef std::vector<VVlcomplex> VVVlcomplex;
typedef std::vector<double> Vdouble;
typedef std::vector<Vdouble> VVdouble;
typedef std::vector<VVdouble> VVVdouble;
typedef std::vector<VVVdouble> VVVVdouble;
typedef std::vector<long double> Vldouble;
typedef std::vector<Vldouble> VVldouble;
typedef std::vector<VVldouble> VVVldouble;
typedef std::vector<VVVldouble> VVVVldouble;
typedef std::vector<int> Vint;
typedef std::vector<Vint> VVint;
typedef std::vector<VVint> VVVint;
typedef std::vector<VVVint> VVVVint;
/**
* @name Element-wise operations.
* @{
*/
template<class T>
std::vector<T> operator+(const std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
size_t size;
if (v1.size() != v2.size())
{
throw DimensionException("VectorTools::operator+", v1.size(), v2.size());
}
else
{
size = v1.size();
}
std::vector<T> result(size);
for (size_t i = 0; i < size; i++)
{
result[i] = v1[i] + v2[i];
}
return result;
}
template<class T>
std::vector<T> operator-(const std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
size_t size;
if (v1.size() != v2.size())
{
throw DimensionException("VectorTools::operator-", v1.size(), v2.size());
}
else
{
size = v1.size();
}
std::vector<T> result(size);
for (size_t i = 0; i < size; i++)
{
result[i] = v1[i] - v2[i];
}
return result;
}
template<class T>
std::vector<T> operator*(const std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
size_t size;
if (v1.size() != v2.size())
{
throw DimensionException("VectorTools::operator*", v1.size(), v2.size());
}
else
{
size = v1.size();
}
std::vector<T> result(size);
for (size_t i = 0; i < size; i++)
{
result[i] = v1[i] * v2[i];
}
return result;
}
template<class T>
std::vector<T> operator/(const std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
size_t size;
if (v1.size() != v2.size())
{
throw DimensionException("VectorTools::operator/", v1.size(), v2.size());
}
else
{
size = v1.size();
}
std::vector<T> result(size);
for (size_t i = 0; i < size; i++)
{
result[i] = v1[i] / v2[i];
}
return result;
}
template<class T, class C>
std::vector<T> operator+(const std::vector<T>& v1, const C& c)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = v1[i] + c;
}
return result;
}
template<class T, class C>
std::vector<T> operator+(const C& c, const std::vector<T>& v1)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = c + v1[i];
}
return result;
}
template<class T, class C>
std::vector<T> operator-(const std::vector<T>& v1, const C& c)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = v1[i] - c;
}
return result;
}
template<class T, class C>
std::vector<T> operator-(const C& c, const std::vector<T>& v1)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = c - v1[i];
}
return result;
}
template<class T, class C>
std::vector<T> operator*(const std::vector<T>& v1, const C& c)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = v1[i] * c;
}
return result;
}
template<class T, class C>
std::vector<T> operator*(const C& c, const std::vector<T>& v1)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = c * v1[i];
}
return result;
}
template<class T, class C>
std::vector<T> operator/(const std::vector<T>& v1, const C& c)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = v1[i] / c;
}
return result;
}
template<class T, class C>
std::vector<T> operator/(const C& c, const std::vector<T>& v1)
{
std::vector<T> result(v1.size());
for (size_t i = 0; i < result.size(); i++)
{
result[i] = c / v1[i];
}
return result;
}
template<class T>
void operator+=(std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] += v2[i];
}
}
template<class T>
void operator-=(std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] -= v2[i];
}
}
template<class T>
void operator*=(std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] *= v2[i];
}
}
template<class T>
void operator/=(std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] /= v2[i];
}
}
template<class T, class C>
void operator+=(std::vector<T>& v1, const C& c)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] += c;
}
}
template<class T, class C>
void operator-=(std::vector<T>& v1, const C& c)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] -= c;
}
}
template<class T, class C>
void operator*=(std::vector<T>& v1, const C& c)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] *= c;
}
}
template<class T, class C>
void operator/=(std::vector<T>& v1, const C& c)
{
for (size_t i = 0; i < v1.size(); i++)
{
v1[i] /= c;
}
}
/** @} */
/******************************************************************************/
class VectorTools
{
public:
VectorTools() {}
virtual ~VectorTools() {}
public:
/**
* @name Matrix-like functions to resize arrays.
*
* @{
*/
template<class T>
static void resize2(VVdouble& vv, size_t n1, size_t n2)
{
vv.resize(n1);
for (size_t i = 0; i < n1; i++) { vv[i].resize(n2); }
}
template<class T>
static void resize3(VVVdouble& vvv, size_t n1, size_t n2, size_t n3)
{
vvv.resize(n1);
for (size_t i = 0; i < n1; i++)
{
vvv[i].resize(n2);
for (size_t j = 0; j < n2; j++)
{
vvv[i][j].resize(n3);
}
}
}
static void resize4(VVVVdouble& vvvv, size_t n1, size_t n2, size_t n3, size_t n4)
{
vvvv.resize(n1);
for (size_t i = 0; i < n1; i++)
{
vvvv[i].resize(n2);
for (size_t j = 0; j < n2; j++)
{
vvvv[i][j].resize(n3);
for (size_t k = 0; k < n3; k++)
{
vvvv[i][j][k].resize(n4);
}
}
}
}
/** @} */
template<class T>
static void fill(std::vector<T>& v, T value)
{
for (typename std::vector<T>::iterator it = v.begin(); it < v.end(); it++)
{
*it = value;
}
}
/**
* @brief Build a sequence std::vector.
*
* Build a std::vector from a value to another with a specified step.
* This works for numerical values for which additions, subtractions and division
* makes sens.
*
* @param from The begining.
* @param to The end.
* @param by The step.
* @return A std::vector containing the sequence.
*/
template<class T>
static std::vector<T> seq(T from, T to, T by)
{
std::vector<T> v;
if (from < to)
{
// for (T i = from ; i <= to ; i += by) { // Not good for double, 'to'
for (T i = from; i <= to + (by / 100); i += by)
{ // must be a little bit larger
v.push_back(i);
}
}
else
{
for (T i = from; i >= to - (by / 100); i -= by)
{
v.push_back(i);
}
}
return v;
}
/**
* @brief Send the position of the first occurence of 'which'.
*
* Comparisons are performed using the == operator.
* Maximum complexity: O(v.size()).
*
* @param v The std::vector to search.
* @param which The element to search.
* @return The position of which in v.
*/
template<class T>
static size_t which(const std::vector<T>& v, const T& which) throw (ElementNotFoundException<T> )
{
for (size_t i = 0; i < v.size(); i++)
{
if (v[i] == which) return i;
}
throw ElementNotFoundException<T>("VectorTools::which.", &v, &which);
}
/**
* @brief Send the positions of all occurences of 'which'.
*
* Comparisons are performed using the == operator.
* Complexity: O(v.size()).
*
* @param v The std::vector to search.
* @param which The element to search.
* @return A std::vector containing the positions of which in v.
*/
template<class T>
static std::vector<size_t> whichAll(const std::vector<T>& v, const T& which) throw (ElementNotFoundException<T> )
{
std::vector<size_t> w;
for (size_t i = 0; i < v.size(); i++)
{
if (v[i] == which) w.push_back(i);
}
if (w.size())
return w;
throw ElementNotFoundException<T>("VectorTools::whichAll.", &v, &which);
}
/**
* @brief Send a new std::vector with unique elements.
*
* The input std::vector is copied, and the copy is sorted using QuickSort algorithm.
* A one-pass loop then look for duplicates and copy unique element to a result std::vector.
* The output std::vector is hence sorted.
*
* If v is empty, it is passed 'as is' in return (after being copied).
*
* @param v the std::vector to parse.
*/
template<class T>
static std::vector<T> unique(const std::vector<T>& v)
{
if (v.size() == 0) return v;
std::vector<T> sortedV(v.begin(), v.end());
sort(sortedV.begin(), sortedV.end());
std::vector<T> uniq;
uniq.push_back(sortedV[0]);
for (size_t i = 1; i < sortedV.size(); i++)
{
if (sortedV[i] != sortedV[i - 1]) uniq.push_back(sortedV[i]);
}
return uniq;
}
/**
* @brief Tell if the std::vector as unique elements.
*
* The input std::vector is copied, and the copy is sorted using QuickSort algorithm.
* A one-pass loop then look for duplicates.
*
* If v is empty, the method returns 'true'.
*
* @param v the std::vector to parse.
*/
template<class T>
static bool isUnique(const std::vector<T>& v)
{
if (v.size() == 0) return true;
std::vector<T> sortedV(v.begin(), v.end());
sort(sortedV.begin(), sortedV.end());
for (size_t i = 1; i < sortedV.size(); i++)
{
if (sortedV[i] == sortedV[i - 1]) return false;
}
return true;
}
/**
* @author Laurent Gueguen
* @param v1 the std::vector of elements,
* @param v2 the std::vector of the selected positions
* @return the std::vector of the selected elements, in the order of the
* required positions
*/
template<class T>
static std::vector<T> extract(const std::vector<T>& v1, const std::vector<int>& v2)
{
std::vector<T> v(v2.size());
for (size_t i = 0; i < v2.size(); i++)
{
v[i] = v1[v2[i]];
}
return v;
}
/**
* @brief Count each element of a std::vector.
*
* @return A map with keys = unique std::vector values and values = count for each std::vector value.
* @param v the std::vector to parse.
*/
template<class T>
static std::map<T, size_t> countValues(const std::vector<T>& v)
{
std::map<T, size_t> c;
for (size_t i = 0; i < v.size(); i++)
{
c[v[i]]++;
}
return c;
}
/**
* @brief Get the break points for a given number of classes.
*
* Given a std::vector of values, return the values that cut the range of values
* in a given number of classes.
*
* @param v The std::vector to parse.
* @param n The expected number of classes.
* @return a std::vector of size = n + 1 containing the breaking points.
*/
static std::vector<double> breaks(const std::vector<double>& v, unsigned int n);
/**
* @brief Get the optimal class number following Scott's method.
*
* Use Scott's (1979) method to compute the optimal class number for histogram.
*
* Scott, D.W. (1979) On optimal and data-based histograms. Biometrika, 66, 605¿610.
*
* @param v The std::vector to parse.
* @return The number of classes.
*/
template<class T>
static size_t nclassScott(const std::vector<T>& v)
{
std::vector<T> r1 = VectorTools::range(v);
T r = r1[1] - r1[0];
double n = v.size();
double h = 3.5 * VectorTools::sd<T, double>(v) * std::pow(n, -1. / 3);
return (size_t) ceil(r / h);
}
/**
* @return The product of all elements in a std::vector.
* @param v1 A std::vector.
*/
template<class T>
static T prod(const std::vector<T>& v1)
{
T p = 1;
for (size_t i = 0; i < v1.size(); i++) { p *= v1[i]; }
return p;
}
/**
* @return The cumulative product of all elements in a std::vector.
* @param v1 A std::vector.
* @author Julien Dutheil
*/
template<class T>
static std::vector<T> cumProd(const std::vector<T>& v1)
{
std::vector<T> p(v1.size());
if (v1.size() == 0) return p;
p[0] = v1[0];
for (size_t i = 1; i < v1.size(); i++) { p[i] = v1[i] * p[i - 1]; }
return p;
}
/**
* @return The sum of all elements in a std::vector.
* @param v1 A std::vector.
*/
template<class T>
static T sum(const std::vector<T>& v1)
{
T s = 0;
for (size_t i = 0; i < v1.size(); i++) { s += v1[i]; }
return s;
}
/**
* @return The cumulative sum of all elements in a std::vector.
* @param v1 A std::vector.
* @author Julien Dutheil
*/
template<class T>
static std::vector<T> cumSum(const std::vector<T>& v1)
{
std::vector<T> s(v1.size());
if (v1.size() == 0) return s;
s[0] = v1[0];
for (size_t i = 1; i < v1.size(); i++) { s[i] = v1[i] + s[i - 1]; }
return s;
}
/**
* @author Laurent Gueguen
* @return Log-normalize std::vector v1, ie add a constant to the elements of v
* such that @f$\sum_i(\exp(v_i)) = 1@f$.
* @param v std::vector.
*/
template<class T>
static void logNorm(std::vector<T>& v)
{
T M = max(v);
T x = std::exp(v[0] - M);
for (size_t i = 1; i < v.size(); i++)
{
x += std::exp(v[i] - M);
}
v -= M + std::log(x);
}
/**
* @author Laurent Gueguen
* @return From std::vector v1, return @f$\log(\sum_i(\exp(v1_i)))@f$.
* @param v1 a std::vector.
*/
template<class T>
static T logSumExp(const std::vector<T>& v1)
{
T M = max(v1);
T x = std::exp(v1[0] - M);
for (size_t i = 1; i < v1.size(); i++)
{
x += std::exp(v1[i] - M);
}
return std::log(x) + M;
}
/**
* @author Laurent Gueguen
* @return From std::vector v1, return @f$\log(\sum_i(v2_i * \exp(v1_i)))@f$.
* @param v1 a std::vector.
* @param v2 another std::vector.
*/
template<class T>
static T logSumExp(const std::vector<T>& v1, const std::vector<T>& v2)
{
size_t size;
if (v1.size() != v2.size())
throw DimensionException("VectorTools::logsumexp", v1.size(), v2.size());
else
size = v1.size();
T M = max(v1);
T x = v2[0] * std::exp(v1[0] - M);
for (size_t i = 1; i < size; i++)
{
x += v2[i] * std::exp(v1[i] - M);
}
return std::log(x) + M;
}
/**
* @author Laurent Gueguen
* @return From std::vector v1, return @f$\log(\textrm{mean}_i(\exp(v1_i)))@f$.
* @param v1 a std::vector.
*/
template<class T>
static T logMeanExp(const std::vector<T>& v1)
{
T M = max(v1);
T x = std::exp(v1[0] - M);
for (size_t i = 1; i < v1.size(); i++)
{
x += std::exp(v1[i] - M);
}
return std::log(x) + M - std::log(v1.size());
}
/**
* @author Laurent Gueguen
* @return From std::vector v1, return @f$\sum_i(\exp(v1_i))@f$.
* @param v1 a std::vector.
*/
template<class T>
static T sumExp(const std::vector<T>& v1)
{
T M = max(v1);
T x = std::exp(v1[0] - M);
for (size_t i = 1; i < v1.size(); i++)
{
x += std::exp(v1[i] - M);
}
return x * std::exp(M);
}
/**
* @author Laurent Gueguen
* @return From std::vector v1, return @f$\sum_i(v2_i * \exp(v1_i))@f$.
* @param v1 a std::vector.
* @param v2 another std::vector.
*/
template<class T>
static T sumExp(const std::vector<T>& v1, const std::vector<T>& v2)
{
size_t size;
if (v1.size() != v2.size())
throw DimensionException("VectorTools::logsumexp", v1.size(), v2.size());
else
size = v1.size();
T M = max(v1);
T x = v2[0] * std::exp(v1[0] - M);
for (size_t i = 1; i < size; i++)
{
x += v2[i] * std::exp(v1[i] - M);
}
return x * std::exp(M);
}
/**
* @name These methods apply the corresponding function to each element
* and return the result in a new std::vector.
*
* @{
*/
template<class T>
static std::vector<double> log(const std::vector<T>& v1)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v2.size(); i++) { v2[i] = std::log(v1[i]); }
return v2;
}
template<class T>
static std::vector<double> log(const std::vector<T>& v1, double base)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v2.size(); i++) { v2[i] = std::log(v1[i]) / std::log(base); }
return v2;
}
template<class T>
static std::vector<double> exp(const std::vector<T>& v1)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v2.size(); i++) { v2[i] = std::exp(v1[i]); }
return v2;
}
template<class T>
static std::vector<double> cos(const std::vector<T>& v1)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v2.size(); i++) { v2[i] = std::cos(v1[i]); }
return v2;
}
template<class T>
static std::vector<double> sin(const std::vector<T>& v1)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v2.size(); i++) { v2[i] = std::sin(v1[i]); }
return v2;
}
template<class T>
static std::vector<double> log10(const std::vector<T>& v1)
{
std::vector<double> v2(v1.size());
for (size_t i = 0; i < v1.size(); i++) { v2[i] = std::log10(v1[i]); }
return v2;
}
template<class T>
static std::vector<T> fact(const std::vector<T>& v1)
{
std::vector<T> v2(v1.size());
for (size_t i = 0; i < v1.size(); i++) { v2[i] = NumTools::fact<T>(v1[i]); }
return v2;
}
template<class T>
static std::vector<T> sqr(const std::vector<T>& v1)
{
std::vector<T> v2(v1.size());
for (size_t i = 0; i < v1.size(); i++) { v2[i] = NumTools::sqr<T>(v1[i]); }
return v2;
}
template<class T>
static std::vector<T> pow(const std::vector<T>& v1, T& b)
{
std::vector<T> v2(v1.size());
for (size_t i = 0; i < v1.size(); i++) { v2[i] = std::pow(v1[i], b); }
return v2;
}
/** @} */
/**
* @brief Concatenate a std::vector after converting to string.
*
* @param v The std::vector to concatenate.
* @param delim A string which is used to separate the values (default is " ").
*/
template<class T>
static std::string paste(const std::vector<T>& v, const std::string& delim = " ")
{
std::ostringstream out;
for (size_t i = 0; i < v.size(); i++)
{
out << v[i];
if (i < v.size() - 1)
out << delim;
}
return out.str();
}
/**
* @brief Print a std::vector to a stream.
* @param v1 A std::vector.
* @param out A stream.
* @param delim A string which is used to separate the values (default is " ").
*/
template<class T>
static void print(const std::vector<T>& v1, OutputStream& out = * ApplicationTools::message, const std::string& delim = " ")
{
for (size_t i = 0; i < v1.size(); i++)
{
out << v1[i];
if (i < v1.size() - 1)
out << delim;
}
out.endLine();
}
/**
* @brief Print a std::vector to a stream in R format
* @param v1 A std::vector.
* @param variableName the variable name (default "x").
* @param out A stream (default cout).
*/
template<class T>
static void printForR(const std::vector<T>& v1, std::string variableName = "x", std::ostream& out = std::cout)
{
out.precision(12);
out << variableName << "<-c(";
for (size_t i = 0; i < v1.size(); i++)
{
out << v1[i];
if (i < v1.size() - 1)
out << ", ";
}
out << ")" << std::endl;
}
/**
* @return The scalar product of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType scalar(const std::vector<InputType>& v1, const std::vector<InputType>& v2) throw (DimensionException)
{
if (v1.size() != v2.size())
{
throw DimensionException("VectorFunctions::scalar", v1.size(), v2.size());
}
OutputType result = 0;
for (size_t i = 0; i < v1.size(); i++)
{
result += v1[i] * v2[i];
}
return result;
}
/**
* This dt product correspond to the dot product <v1,v2> in the space defined by
* @f[
* M =
* \begin{pmatrix}
* w_1 & \ldots & \\
* \vdots & w_2 & \ldots\\
* & \vdots & \ddots\\
* \end{pmatrix}
* @f]
* @return The "weighted" scalar product of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param w A std::vector of weights.
* @throw DimensionException If the two std::vector do not have the same length or do not match the length of the weights.
*/
template<class InputType, class OutputType>
static OutputType scalar(const std::vector<InputType>& v1, const std::vector<InputType>& v2, const std::vector<InputType>& w) throw (DimensionException)
{
if (v1.size() != w.size())
{
throw DimensionException("VectorFunctions::scalar", v1.size(), w.size());
}
if (v2.size() != w.size())
{
throw DimensionException("VectorFunctions::scalar", v2.size(), w.size());
}
OutputType result = 0;
for (size_t i = 0; i < v1.size(); i++)
{
result += v1[i] * v2[i] * w[i];
}
return result;
}
/**
* @return The scalar Kronecker product of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class T>
static std::vector<T> kroneckerMult(const std::vector<T>& v1, const std::vector<T>& v2) throw (DimensionException)
{
size_t n1 = v1.size();
size_t n2 = v2.size();
std::vector<T> v3(n1 * n2);
for (size_t i = 0; i < n1; i++)
{
T v1i = v1[i];
for (size_t j = 0; j < n2; j++)
{
v3[i * n2 + j] = v1i * v2[j];
}
}
return v3;
}
/**
* @return The norm of a std::vector (@f$\sqrt{\sum_i^n x_i^2}@f$).
* @param v1 A std::vector.
*/
template<class InputType, class OutputType>
static OutputType norm(const std::vector<InputType>& v1)
{
OutputType result = 0;
for (size_t i = 0; i < v1.size(); i++)
{
result += v1[i] * v1[i];
}
return sqrt(result);
}
/**
* @return The "weighted" norm of a std::vector (@f$\sqrt{\sum_i^n x_i^2}@f$).
* @param v1 A std::vector.
* @param w A std::vector of weights.
* @throw DimensionException If v1 and w do not have the same length.
* @see scalar.
*/
template<class InputType, class OutputType>
static OutputType norm(const std::vector<InputType>& v1, const std::vector<InputType>& w) throw (DimensionException)
{
if (v1.size() != w.size())
{
throw DimensionException("VectorFunctions::norm", v1.size(), w.size());
}
OutputType result = 0;
for (size_t i = 0; i < v1.size(); i++)
{
result += v1[i] * v1[i] * w[i];
}
return sqrt(result);
}
/**
* @return The cosinus of the angle of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cos(const std::vector<InputType>& v1, const std::vector<InputType>& v2) throw (DimensionException)
{
return scalar<InputType, OutputType>(v1, v2)
/ (norm<InputType, OutputType>(v1) * norm<InputType, OutputType>(v2));
}
/**
* @return The weighted cosinus of the angle of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param w A std::vector of weights.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cos(const std::vector<InputType>& v1, const std::vector<InputType>& v2, const std::vector<InputType>& w) throw (DimensionException)
{
return scalar<InputType, OutputType>(v1, v2, w)
/ (norm<InputType, OutputType>(v1, w) * norm<InputType, OutputType>(v2, w));
}
/**
* @name Extrema.
*
* @{
*/
/**
* @brief Template function to get the minimum value of a std::vector.
*
* The < operator must be defined for the specified class.
*
* @param v The input std::vector.
* @return The minimum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static T min(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFunctions::min()", &v);
T mini = v[0];
for (size_t i = 1; i < v.size(); i++)
{
if (v[i] < mini) mini = v[i];
}
return mini;
}
/**
* @brief Template function to get the maximum value of a std::vector.
*
* The > operator must be defined for the specified class.
*
* @param v The input std::vector.
* @return The maximum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static T max(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFuntions::max()", &v);
T maxi = v[0];
for (size_t i = 1; i < v.size(); i++)
{
if (v[i] > maxi) maxi = v[i];
}
return maxi;
}
/**
* @brief Template function to get the index of the maximum value of a std::vector.
*
* The > operator must be defined for the specified class.
* The position sent is the first one matching the maximum value.
*
* @param v The input std::vector.
* @return The position of the maximum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static size_t whichMax(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFuntions::whichMax()", &v);
T maxi = v[0];
size_t pos = 0;
for (size_t i = 1; i < v.size(); i++)
{
if (v[i] > maxi)
{
maxi = v[i];
pos = i;
}
}
return pos;
}
/**
* @brief Template function to get the index of the minimum value of a std::vector.
*
* The < operator must be defined for the specified class.
* The position sent is the first one matching the maximum value.
*
* @param v The input std::vector.
* @return The position of the minimum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static size_t whichMin(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFunctions::whichMin()", &v);
T mini = v[0];
size_t pos = 0;
for (size_t i = 1; i < v.size(); i++)
{
if (v[i] < mini)
{
mini = v[i];
pos = i;
}
}
return pos;
}
/**
* @brief Template function to get the indices of the maximum value of a std::vector.
*
* The > and == operator must be defined for the specified class.
* All positions matching the maximum value are returned.
*
* @param v The input std::vector.
* @return A vector of positions matching the maximum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static std::vector<size_t> whichMaxAll(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFuntions::whichMaxAll()", &v);
T maxi = max(v);
std::vector<size_t> pos;
for (size_t i = 0; i < v.size(); i++)
{
if (v[i] == maxi)
{
pos.push_back(i);
}
}
return pos;
}
/**
* @brief Template function to get the indices of the minimum value of a std::vector.
*
* The < and == operator must be defined for the specified class.
* All positions matching the maximum value are returned.
*
* @param v The input std::vector.
* @return A vector of positions matching the minimum value in the std::vector.
* @throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static std::vector<size_t> whichMinAll(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0) throw EmptyVectorException<T>("VectorFuntions::whichMinAll()", &v);
T mini = min(v);
std::vector<size_t> pos;
for (size_t i = 0; i < v.size(); i++)
{
if (v[i] == mini)
{
pos.push_back(i);
}
}
return pos;
}
/**
* @brief Template function to get both extrema of a std::vector.
*
* Both < and > operators must be defined for the specified class.
*
* @param v The input std::vector.
* @return A std::vector of size 2 which values are min(v) and max(v).
* throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static std::vector<T> range(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0)
throw EmptyVectorException<T>("VectorTools::range()", &v);
std::vector<T> r(2);
r[0] = r[1] = v[0];
for (size_t i = 1; i < v.size(); i++)
{
if (v[i] < r[0]) r[0] = v[i];
if (v[i] > r[1]) r[1] = v[i];
}
return r;
}
private:
template<class T> class order_Cmp_
{
const std::vector<T>& values_;
public:
order_Cmp_(const std::vector<T>& v) : values_(v) {}
bool operator()(size_t a, size_t b) { return values_[a] < values_[b]; }
};
public:
/**
* @brief Template function to get the order of elements in the input vector.
*
* This function is equivalent to the R 'order' function. It will sort elements by increasing size, so that [0] in the resulting outptu vector is the indice of the minimum element in the input vector, [1] is the second minimum, etc.
*
* @param v The input std::vector.
* @return Vector with sorted positions, according to input vector.
* throw EmptyVectorException If the input std::vector is empty.
*/
template<class T>
static std::vector<size_t> order(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
if (v.size() == 0)
throw EmptyVectorException<T>("VectorTools::sort()", &v);
// Private inner class:
std::vector<size_t> index(v.size());
for (size_t i = 0; i < index.size(); ++i)
{
index[i] = i;
}
sort(index.begin(), index.end(), order_Cmp_<T>(v));
return index;
}
/** @} */
/**
* @brief Template function to get the absolute value of all elements of a std::vector.
*
*
* @param v The input std::vector.
* @return A vector with all absolute values.
*/
template<class T>
static std::vector<T> abs(const std::vector<T>& v) throw (EmptyVectorException<T> )
{
std::vector<T> vabs(v.size());
for (size_t i = 1; i < v.size(); i++)
{
vabs[i] = std::abs(v[i]);
}
return vabs;
}
/**
* @return The mean value of the std::vector.
* @param v1 A std::vector.
*/
template<class InputType, class OutputType>
static OutputType mean(const std::vector<InputType>& v1)
{
return (OutputType)sum<InputType>(v1) / (OutputType)v1.size();
}
/**
* @return The weighted mean value of the std::vector.
* @param v1 A std::vector.
* @param w A std::vector of weights.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
*/
template<class InputType, class OutputType>
static OutputType mean(const std::vector<InputType>& v1, const std::vector<InputType>& w, bool normalizeWeights = true)
{
if (normalizeWeights)
{
std::vector<InputType> wn = w / sum(w);
return scalar<InputType, OutputType>(v1, wn);
}
else
{
return scalar<InputType, OutputType>(v1, w);
}
}
/**
* @return The median value of the std::vector.
* @param v1 A std::vector.
*/
template<class InputType>
static InputType median(std::vector<InputType>& v1)
{
InputType med = 0;
if (v1.size() == 0) return med;
if (v1.size() == 1) return v1[0];
sort(v1.begin(), v1.end());
size_t i = v1.size() / 2;
if (v1.size() % 2 == 0)
{
// Vector size is pair
med = double((v1[i - 1] + v1[i]) / 2);
}
else
{
// Vector size is impair
med = v1[i];
}
return med;
}
/**
* @brief Set the mean of a std::vector to be 0.
*
* @return A std::vector with mean 0.
* @param v1 A std::vector.
*/
template<class InputType, class OutputType>
static std::vector<OutputType> center(const std::vector<InputType>& v1)
{
OutputType m = mean<InputType, OutputType>(v1);
std::vector<OutputType> v(v1.size());
for (size_t i = 0; i < v1.size(); i++)
{
v[i] = (OutputType)v1[i] - m;
}
return v;
}
/**
* @brief Set the weighted mean of a std::vector to be 0.
*
* @return A std::vector with mean 0.
* @param v1 A std::vector.
* @param w A std::vector of weights.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
*/
template<class InputType, class OutputType>
static std::vector<OutputType> center(const std::vector<InputType>& v1, const std::vector<InputType>& w, bool normalizeWeights = true)
{
OutputType m = mean<InputType, OutputType>(v1, w, normalizeWeights);
std::vector<OutputType> v(v1.size());
for (size_t i = 0; i < v1.size(); i++)
{
v[i] = (OutputType)v1[i] - m;
}
return v;
}
/**
* @return The covariance of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param unbiased Tell if an unbiased estimate must be computed.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cov(const std::vector<InputType>& v1, const std::vector<InputType>& v2, bool unbiased = true) throw (DimensionException)
{
OutputType n = (OutputType)v1.size();
OutputType x = scalar<InputType, OutputType>(
center<InputType, OutputType>(v1),
center<InputType, OutputType>(v2)
) / n;
if (unbiased) x = x * n / (n - 1);
return x;
}
/**
* @return The weighted covariance of two std::vectors.
* To have a population estimate you have to multiply by \f$\frac{n}{n-1}\f$.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param w A std::vector of weights.
* @param unbiased Tell if an unbiased estimate must be computed.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cov(const std::vector<InputType>& v1, const std::vector<InputType>& v2, const std::vector<InputType>& w, bool unbiased = true, bool normalizeWeights = true) throw (DimensionException)
{
if (normalizeWeights)
{
std::vector<InputType> wn = w / sum(w);
OutputType x = scalar<InputType, OutputType>(
center<InputType, OutputType>(v1, wn, false),
center<InputType, OutputType>(v2, wn, false),
wn
);
if (unbiased)
{
x = x / (1 - sum(sqr<double>(wn)));
}
return x;
}
else
{
OutputType x = scalar<InputType, OutputType>(
center<InputType, OutputType>(v1, w, false),
center<InputType, OutputType>(v2, w, false),
w
);
if (unbiased)
{
x = x / (1 - sum(sqr(w)));
}
return x;
}
}
/**
* @return The variance of the std::vector.
* @param v1 The sample std::vector.
* @param unbiased Tell if an unbiased estimate must be computed.
*/
template<class InputType, class OutputType>
static OutputType var(const std::vector<InputType>& v1, bool unbiased = true)
{
return cov<InputType, OutputType>(v1, v1, unbiased);
}
/**
* @return The weighted variance of the std::vector.
* @param v1 The sample std::vector.
* @param w A std::vector of weights.
* @param unbiased Tell if an unbiased estimate must be computed.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
* @throw DimensionException If v1 and w do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType var(const std::vector<InputType>& v1, const std::vector<InputType>& w, bool unbiased = true, bool normalizeWeights = true) throw (DimensionException)
{
return cov<InputType, OutputType>(v1, v1, w, unbiased, normalizeWeights);
}
/**
* @return The standard deviation of the std::vector.
* @param v1 The sample std::vector.
* @param unbiased Tell if an unbiased estimate must be computed.
*/
template<class InputType, class OutputType>
static OutputType sd(const std::vector<InputType>& v1, bool unbiased = true)
{
return sqrt(var<InputType, OutputType>(v1, unbiased));
}
/**
* @return The weighted standard deviation of the std::vector.
* @param v1 The sample std::vector.
* @param w A std::vector of weights.
* @param unbiased Tell if an unbiased estimate must be computed.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
* @throw DimensionException If v1 and w do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType sd(const std::vector<InputType>& v1, const std::vector<InputType>& w, bool unbiased = true, bool normalizeWeights = true) throw (DimensionException)
{
return sqrt(var<InputType, OutputType>(v1, w, unbiased, normalizeWeights));
}
/**
* @return The Pearson correlation coefficient of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cor(const std::vector<InputType>& v1, const std::vector<InputType>& v2) throw (DimensionException)
{
return cov<InputType, OutputType>(v1, v2)
/ ( sd<InputType, OutputType>(v1) * sd<InputType, OutputType>(v2) );
}
/**
* @return The weighted Pearson correlation coefficient of two std::vectors.
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param w A std::vector of weights.
* @param normalizeWeights Tell if weights should be normalized so that they sum to 1.
* @throw DimensionException If the two std::vector do not have the same length.
*/
template<class InputType, class OutputType>
static OutputType cor(const std::vector<InputType>& v1, const std::vector<InputType>& v2, const std::vector<InputType>& w, bool normalizeWeights = true) throw (DimensionException)
{
if (normalizeWeights)
{
std::vector<InputType> wn = w / sum(w);
return cov<InputType, OutputType>(v1, v2, wn, false, false)
/ ( sd<InputType, OutputType>(v1, wn, false, false) * sd<InputType, OutputType>(v2, wn, false, false) );
}
else
{
return cov<InputType, OutputType>(v1, v2, w, false, false)
/ ( sd<InputType, OutputType>(v1, w, false, false) * sd<InputType, OutputType>(v2, w, false, false) );
}
}
/**
* @return Compute the Shannon entropy indice of a vector of frequencies.
*
* The elements of the vector should contain frequencies
* of each modality of the variable and sum to one. This verification is left to the user
* though.
*
* @author Julien Dutheil
* @see shannonDiscrete for computing the shannon indice of a sample, discrete version.
* @see shannonContinuous for computing the shannon indice of a sample, continuous version.
*
* @param v The input std::vector.
* @param base The base of the logarithm to use.
*/
template<class InputType, class OutputType>
static OutputType shannon(const std::vector<InputType>& v, double base = 2.7182818)
{
OutputType s = 0;
for (size_t i = 0; i < v.size(); i++)
{
if (v[i] > 0) s += static_cast<OutputType>(v[i] * std::log(v[i]) / std::log(base));
}
return -s;
}
/**
* @return Compute the Shannon entropy indice of a vector.
*
* This is the discrete version. The vector is supposed to be a finite sample from
* a discrete distribution. The counts of each observed state are computed and used
* to compute the discrete entropy.
*
* @author Julien Dutheil
* @see shannonContinuous for the continuous version.
* @see shannon for direct computation from frequencies.
*
* @param v The input std::vector.
* @param base The base of the logarithm to use.
*/
template<class InputType, class OutputType>
static OutputType shannonDiscrete(const std::vector<InputType>& v, double base = 2.7182818)
{
std::map<InputType, double> counts;
for (size_t i = 0; i < v.size(); i++)
{
counts[v[i]]++;
}
OutputType s = 0;
double n = static_cast<double>(v.size());
for (typename std::map<InputType, double>::iterator it = counts.begin(); it != counts.end(); it++)
{
s += static_cast<OutputType>((it->second / n) * std::log(it->second / n) / std::log(base));
}
return -s;
}
/**
* @return Compute mutual information index from two samples from discrete variables.
*
* This is the discrete version. Each vector is supposed to be a finite sample from
* a discrete distribution. The counts of each (joint) observed state are computed
* and used to compute the discrete mutual information.
*
* @author Julien Dutheil
* @see miContinuous.
*
* @param v1 The first input vector.
* @param v2 The second input vector.
* @param base The base of the logarithm to use.
* @throw DimensionException if the two vectors do not have the same lengths.
*/
template<class InputType, class OutputType>
static OutputType miDiscrete(const std::vector<InputType>& v1, const std::vector<InputType>& v2, double base = 2.7182818) throw (DimensionException)
{
if (v1.size() != v2.size())
throw DimensionException("VectorTools::miDiscrete. The two samples must have the same length.", v2.size(), v1.size());
std::map<InputType, double> counts1;
std::map<InputType, double> counts2;
std::map<InputType, std::map<InputType, double> > counts12;
for (size_t i = 0; i < v1.size(); i++)
{
counts1[v1[i]]++;
counts2[v2[i]]++;
counts12[v1[i]][v2[i]]++;
}
OutputType s = 0;
double n = static_cast<double>(v1.size());
for (typename std::map<InputType, std::map<InputType, double> >::iterator it1 = counts12.begin(); it1 != counts12.end(); it1++)
{
for (typename std::map<InputType, double>::iterator it2 = it1->second.begin(); it2 != it1->second.end(); it2++)
{
s += static_cast<OutputType>((it2->second / n) * std::log(it2->second * n / (counts1[it1->first] * counts2[it2->first])) / std::log(base));
}
}
return s;
}
/**
* @return Compute the Shannon entropy indice of a sample from a continuous variable.
*
* This is the continuous version. The vector is supposed to be a finite sample from
* a continuous distribution. The density is of the distribution is estimated using
* a kernel method, and is used to compute the continuous entropy.
*
* Reference: Ivan Kojadinovic (2004) _Computational Statistics & Data Analysis_, 46:269-294
*
* @author Julien Dutheil
* @see shannon For the discrete version.
*
* @param v The input std::vector.
* @param base The base of the logarithm to use.
*/
template<class InputType, class OutputType>
static OutputType shannonContinuous(const std::vector<InputType>& v, double base = 2.7182818)
{
LinearMatrix<InputType> m(1, v.size());
for (size_t i = 0; i < v.size(); i++)
{
m(0, i) = v[i];
}
AdaptiveKernelDensityEstimation kd(m);
OutputType s = 0;
std::vector<double> x(1);
for (size_t i = 0; i < v.size(); i++)
{
x[0] = static_cast<double>(v[i]);
s += static_cast<OutputType>(std::log(kd.kDensity(x)) / std::log(base));
}
return -s / static_cast<double>(v.size());
}
/**
* @return Compute mutual information index from two samples from continuous variables.
*
* This is the continuous version. Each vector is supposed to be a finite sample from
* a continuous distribution. The density is of the distribution is estimated using
* a kernel method, as well as the joint density, and are used to compute the continuous
* mutual information.
*
* Reference: Ivan Kojadinovic (2004) _Computational Statistics & Data Analysis_, 46:269-294
*
* @author Julien Dutheil
* @see miDiscrete For the discrete version.
* @warning This function is experimental. Notably, bad kernel density estimates may lead to negative MI :(
*
* @param v1 The first input vector.
* @param v2 The second input vector.
* @param base The base of the logarithm to use.
* @throw DimensionException if the two vectors do not have the same lengths.
*/
template<class InputType, class OutputType>
static OutputType miContinuous(const std::vector<InputType>& v1, const std::vector<InputType>& v2, double base = 2.7182818) throw (DimensionException)
{
if (v1.size() != v2.size())
throw DimensionException("VectorTools::miContinuous. The two samples must have the same length.", v2.size(), v1.size());
LinearMatrix<InputType> m1(1, v1.size());
LinearMatrix<InputType> m2(1, v2.size());
LinearMatrix<InputType> m12(2, v1.size());
for (size_t i = 0; i < v1.size(); i++)
{
m1(0, i) = m12(0, i) = v1[i];
m2(0, i) = m12(1, i) = v2[i];
}
AdaptiveKernelDensityEstimation kd1(m1);
AdaptiveKernelDensityEstimation kd2(m2);
AdaptiveKernelDensityEstimation kd12(m12);
OutputType s = 0;
std::vector<double> x1(1);
std::vector<double> x2(1);
std::vector<double> x12(2);
for (size_t i = 0; i < v1.size(); i++)
{
x1[0] = x12[0] = static_cast<double>(v1[i]);
x2[0] = x12[1] = static_cast<double>(v2[i]);
s += static_cast<OutputType>(std::log(kd12.kDensity(x12) / (kd1.kDensity(x1) * kd2.kDensity(x2))) / std::log(base));
}
return s / static_cast<double>(v1.size());
}
/**
* @return 'true' if the two std::vectors contains the same elements, whatever their order in the container.
* @param v1 First std::vector.
* @param v2 Second std::vector.
*/
template<class T>
static bool haveSameElements(const std::vector<T>& v1, const std::vector<T>& v2)
{
std::vector<T> u1(v1);
std::vector<T> u2(v2);
if (u1.size() != u2.size()) return false;
std::sort(u1.begin(), u1.end());
std::sort(u2.begin(), u2.end());
return u1 == u2;
}
/**
* @return 'true' if the two std::vectors contains the same elements, <b>in the same frequency</b>, whatever their order in the container.
*
* @warning The two input std::vectors will be sorted.
*
* @param v1 First std::vector.
* @param v2 Second std::vector.
*/
template<class T>
static bool haveSameElements(std::vector<T>& v1, std::vector<T>& v2)
{
if (v1.size() != v2.size()) return false;
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
return v1 == v2;
}
/**
* @return 'true' if a the input std::vector contains the given element.
* @param vec The std::vector to check.
* @param el The element to look for.
*/
template<class T>
static bool contains(const std::vector<T>& vec, T el)
{
for (size_t i = 0; i < vec.size(); i++)
{
if (vec[i] == el) return true;
}
return false;
}
/**
* @return 'true' if a the first std::vector contains all elements of the second std::vector.
*
* @warning The two input std::vectors will be sorted.
*
* @param v1 The first std::vector to check.
* @param v2 The second std::vector to check.
*/
template<class T>
static bool containsAll(std::vector<T>& v1, std::vector<T>& v2)
{
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
size_t j = 0;
for (size_t i = 0; i < v2.size(); i++)
{
if (i > 0 && v2[i] == v2[i - 1]) continue;
while (j < v1.size() - 1 && v1[j] < v2[i]) j++;
if (v1[j] != v2[i]) return false;
}
return true;
}
/**
* @return A std::vector which is the union of two std::vectors passed as input.
* Duplicate element will be removed.
* @param vec1 Vector 1.
* @param vec2 Vector 2.
*/
template<class T>
static std::vector<T> vectorUnion(const std::vector<T>& vec1, const std::vector<T>& vec2)
{
std::vector<T> unionEl = vec1;
for (size_t j = 0; j < vec2.size(); j++)
{
if (!contains(unionEl, vec2[j]))
unionEl.push_back(vec2[j]);
}
return unionEl;
}
/**
* @return A std::vector which is the union of all std::vectors passed as input.
* Duplicate element will be removed.
* @param vecElementL A std::vector of std::vectors.
*/
template<class T>
static std::vector<T> vectorUnion(const std::vector< std::vector<T> >& vecElementL)
{
std::vector<T> unionEl;
for (size_t i = 0; i < vecElementL.size(); i++)
{
for (size_t j = 0; j < vecElementL[i].size(); j++)
{
if (!contains(unionEl, vecElementL[i][j]))
unionEl.push_back(vecElementL[i][j]);
}
}
return unionEl;
}
/**
* @return A std::vector which is the intersection of two std::vectors passed as input.
* @param vec1 Vector 1.
* @param vec2 Vector 2.
*/
template<class T>
static std::vector<T> vectorIntersection(const std::vector<T>& vec1, const std::vector<T>& vec2)
{
std::vector<T> interEl;
for (size_t i = 0; i < vec1.size(); i++)
{
if (contains(vec2, vec1[i])) interEl.push_back(vec1[i]);
}
return interEl;
}
/**
* @return A std::vector which is the intersection of all std::vectors passed as input.
* @param vecElementL A std::vector of std::vectors.
*/
template<class T>
static std::vector<T> vectorIntersection(const std::vector< std::vector<T> >& vecElementL)
{
if (vecElementL.size() == 1) return vecElementL[0];
std::vector<T> interEl;
if (vecElementL.size() == 0) return interEl;
for (size_t i = 0; i < vecElementL[0].size(); i++)
{
bool test = true;
for (size_t j = 1; test && j < vecElementL.size(); j++)
{
if (!contains(vecElementL[j], vecElementL[0][i])) test = false;
}
if (test) interEl.push_back(vecElementL[0][i]);
}
return interEl;
}
/**
* @brief Append the content of a std::vector to another one.
* @param vec1 Vector 1.
* @param vec2 Vector 2.
*/
template<class T>
static void append(std::vector<T>& vec1, const std::vector<T>& vec2)
{
vec1.insert(vec1.end(), vec2.begin(), vec2.end());
// for(size_t i = 0; i < vec2.size(); i++)
// {
// vec1.push_back(vec2[i]);
// }
}
/**
* @brief Prepend the content of a std::vector to another one.
* @param vec1 Vector 1.
* @param vec2 Vector 2.
*/
template<class T>
static void prepend(std::vector<T>& vec1, const std::vector<T>& vec2)
{
vec1.insert(vec1.begin(), vec2.begin(), vec2.end());
}
/**
* @return A single std::vector made of the concatenation of the std::vectors passed as input.
* @param vecElementL A std::vector of std::vectors.
*/
template<class T>
static std::vector<T> append(const std::vector< std::vector<T> >& vecElementL)
{
if (vecElementL.size() == 1) return vecElementL[0];
std::vector<T> v;
if (vecElementL.size() == 0) return v;
for (size_t i = 0; i < vecElementL[0].size(); i++)
{
v.push_back(vecElementL[0][i]);
}
return v;
}
/**
* @brief Extend the content of a std::vector with another one. Only the elements not present in the first vector will be added.
* @param vec1 Vector 1.
* @param vec2 Vector 2.
*/
template<class T>
static void extend(std::vector<T>& vec1, const std::vector<T>& vec2)
{
for (size_t i = 0; i < vec2.size(); i++)
{
if (!contains(vec1, vec2[i]))
vec1.push_back(vec2[i]);
}
}
/**
* @return A single std::vector made of the repetion of the std::vectors passed as input.
* @param vec A std::vector.
* @param n the number of repetitions
*/
template<class T>
static std::vector<T> rep(const std::vector<T>& vec, size_t n)
{
if (n == 1) return vec;
std::vector<T> v;
if (n == 0) return v;
v.resize(vec.size() * n);
for (size_t i = 0; i < v.size(); i++)
{
v[i] = vec[i % vec.size()];
}
return v;
}
/**
* @brief This function returns the difference of two std::vectors.
*
* @warning The two input std::vectors will be sorted. As a consequence, the output std::vector will be also sorted.
*
* @param v1 First std::vector.
* @param v2 Second std::vector.
* @param v3 A std::vector to be populated with all elements in v1 that are not found in v2.
*/
template<class T>
static void diff(std::vector<T>& v1, std::vector<T>& v2, std::vector<T>& v3)
{
if (v2.size() == 0) append(v3, v1);
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
size_t j = 0;
for (size_t i = 0; i < v1.size(); i++)
{
if (i > 0 && v1[i] == v1[i - 1]) continue;
while (j < v2.size() - 1 && v2[j] < v1[i]) j++;
if (v2[j] != v1[i]) v3.push_back(v1[i]);
}
}
/**
* @brief Test function.
* @return true if all tests are passed.
*/
static bool test();
};
} // end of namespace bpp.
#endif // _VECTORTOOLS_H_
|