/usr/include/libalglib/ap.h is in libalglib-dev 3.10.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 | /*************************************************************************
ALGLIB 3.10.0 (source code generated 2015-08-19)
Copyright (c) Sergey Bochkanov (ALGLIB project).
>>> SOURCE LICENSE >>>
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 (www.fsf.org); either version 2 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.
A copy of the GNU General Public License is available at
http://www.fsf.org/licensing/licenses
>>> END OF LICENSE >>>
*************************************************************************/
#ifndef _ap_h
#define _ap_h
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <string>
#include <cstring>
#include <math.h>
#if defined(__CODEGEARC__)
#include <list>
#include <vector>
#elif defined(__BORLANDC__)
#include <list.h>
#include <vector.h>
#else
#include <list>
#include <vector>
#endif
#define AE_USE_CPP
/* Definitions */
#define AE_UNKNOWN 0
#define AE_MSVC 1
#define AE_GNUC 2
#define AE_SUNC 3
#define AE_INTEL 1
#define AE_SPARC 2
#define AE_WINDOWS 1
#define AE_POSIX 2
#define AE_LOCK_ALIGNMENT 16
/* in case no OS is defined, use AE_UNKNOWN */
#ifndef AE_OS
#define AE_OS AE_UNKNOWN
#endif
/* automatically determine compiler */
#define AE_COMPILER AE_UNKNOWN
#ifdef __GNUC__
#undef AE_COMPILER
#define AE_COMPILER AE_GNUC
#endif
#if defined(__SUNPRO_C)||defined(__SUNPRO_CC)
#undef AE_COMPILER
#define AE_COMPILER AE_SUNC
#endif
#ifdef _MSC_VER
#undef AE_COMPILER
#define AE_COMPILER AE_MSVC
#endif
/* compiler-specific definitions */
#if AE_COMPILER==AE_MSVC
#define ALIGNED __declspec(align(8))
#elif AE_COMPILER==AE_GNUC
#define ALIGNED __attribute__((aligned(8)))
#else
#define ALIGNED
#endif
/* now we are ready to include headers */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <setjmp.h>
#include <math.h>
#include <stddef.h>
#if defined(AE_HAVE_STDINT)
#include <stdint.h>
#endif
/*
* SSE2 intrinsics
*
* Preprocessor directives below:
* - include headers for SSE2 intrinsics
* - define AE_HAS_SSE2_INTRINSICS definition
*
* These actions are performed when we have:
* - x86 architecture definition (AE_CPU==AE_INTEL)
* - compiler which supports intrinsics
*
* Presence of AE_HAS_SSE2_INTRINSICS does NOT mean that our CPU
* actually supports SSE2 - such things should be determined at runtime
* with ae_cpuid() call. It means that we are working under Intel and
* out compiler can issue SSE2-capable code.
*
*/
#if defined(AE_CPU)
#if AE_CPU==AE_INTEL
#if AE_COMPILER==AE_MSVC
#include <emmintrin.h>
#define AE_HAS_SSE2_INTRINSICS
#endif
#if AE_COMPILER==AE_GNUC
#include <xmmintrin.h>
#define AE_HAS_SSE2_INTRINSICS
#endif
#if AE_COMPILER==AE_SUNC
#include <xmmintrin.h>
#include <emmintrin.h>
#define AE_HAS_SSE2_INTRINSICS
#endif
#endif
#endif
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS DECLARATIONS FOR BASIC FUNCTIONALITY
// LIKE MEMORY MANAGEMENT FOR VECTORS/MATRICES WHICH IS SHARED
// BETWEEN C++ AND PURE C LIBRARIES
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
/* if we work under C++ environment, define several conditions */
#ifdef AE_USE_CPP
#define AE_USE_CPP_BOOL
#define AE_USE_CPP_ERROR_HANDLING
#define AE_USE_CPP_SERIALIZATION
#endif
/*
* define ae_int32_t, ae_int64_t, ae_int_t, ae_bool, ae_complex, ae_error_type and ae_datatype
*/
#if defined(AE_INT32_T)
typedef AE_INT32_T ae_int32_t;
#endif
#if defined(AE_HAVE_STDINT) && !defined(AE_INT32_T)
typedef int32_t ae_int32_t;
#endif
#if !defined(AE_HAVE_STDINT) && !defined(AE_INT32_T)
#if AE_COMPILER==AE_MSVC
typedef __int32 ae_int32_t;
#endif
#if (AE_COMPILER==AE_GNUC) || (AE_COMPILER==AE_SUNC) || (AE_COMPILER==AE_UNKNOWN)
typedef int ae_int32_t;
#endif
#endif
#if defined(AE_INT64_T)
typedef AE_INT64_T ae_int64_t;
#endif
#if defined(AE_HAVE_STDINT) && !defined(AE_INT64_T)
typedef int64_t ae_int64_t;
#endif
#if !defined(AE_HAVE_STDINT) && !defined(AE_INT64_T)
#if AE_COMPILER==AE_MSVC
typedef __int64 ae_int64_t;
#endif
#if (AE_COMPILER==AE_GNUC) || (AE_COMPILER==AE_SUNC) || (AE_COMPILER==AE_UNKNOWN)
typedef signed long long ae_int64_t;
#endif
#endif
#if !defined(AE_INT_T)
typedef ptrdiff_t ae_int_t;
#endif
#if !defined(AE_USE_CPP_BOOL)
#define ae_bool char
#define ae_true 1
#define ae_false 0
#else
#define ae_bool bool
#define ae_true true
#define ae_false false
#endif
typedef struct { double x, y; } ae_complex;
typedef enum
{
ERR_OK = 0,
ERR_OUT_OF_MEMORY = 1,
ERR_XARRAY_TOO_LARGE = 2,
ERR_ASSERTION_FAILED = 3
} ae_error_type;
typedef ae_int_t ae_datatype;
/*
* other definitions
*/
enum { OWN_CALLER=1, OWN_AE=2 };
enum { ACT_UNCHANGED=1, ACT_SAME_LOCATION=2, ACT_NEW_LOCATION=3 };
enum { DT_BOOL=1, DT_INT=2, DT_REAL=3, DT_COMPLEX=4 };
enum { CPU_SSE2=1 };
/************************************************************************
x-string (zero-terminated):
owner OWN_CALLER or OWN_AE. Determines what to do on realloc().
If vector is owned by caller, X-interface will just set
ptr to NULL before realloc(). If it is owned by X, it
will call ae_free/x_free/aligned_free family functions.
last_action ACT_UNCHANGED, ACT_SAME_LOCATION, ACT_NEW_LOCATION
contents is either: unchanged, stored at the same location,
stored at the new location.
this field is set on return from X.
ptr pointer to the actual data
Members of this structure are ae_int64_t to avoid alignment problems.
************************************************************************/
typedef struct
{
ALIGNED ae_int64_t owner;
ALIGNED ae_int64_t last_action;
ALIGNED char *ptr;
} x_string;
/************************************************************************
x-vector:
cnt number of elements
datatype one of the DT_XXXX values
owner OWN_CALLER or OWN_AE. Determines what to do on realloc().
If vector is owned by caller, X-interface will just set
ptr to NULL before realloc(). If it is owned by X, it
will call ae_free/x_free/aligned_free family functions.
last_action ACT_UNCHANGED, ACT_SAME_LOCATION, ACT_NEW_LOCATION
contents is either: unchanged, stored at the same location,
stored at the new location.
this field is set on return from X interface and may be
used by caller as hint when deciding what to do with data
(if it was ACT_UNCHANGED or ACT_SAME_LOCATION, no array
reallocation or copying is required).
ptr pointer to the actual data
Members of this structure are ae_int64_t to avoid alignment problems.
************************************************************************/
typedef struct
{
ALIGNED ae_int64_t cnt;
ALIGNED ae_int64_t datatype;
ALIGNED ae_int64_t owner;
ALIGNED ae_int64_t last_action;
ALIGNED void *ptr;
} x_vector;
/************************************************************************
x-matrix:
rows number of rows. may be zero only when cols is zero too.
cols number of columns. may be zero only when rows is zero too.
stride stride, i.e. distance between first elements of rows (in bytes)
datatype one of the DT_XXXX values
owner OWN_CALLER or OWN_AE. Determines what to do on realloc().
If vector is owned by caller, X-interface will just set
ptr to NULL before realloc(). If it is owned by X, it
will call ae_free/x_free/aligned_free family functions.
last_action ACT_UNCHANGED, ACT_SAME_LOCATION, ACT_NEW_LOCATION
contents is either: unchanged, stored at the same location,
stored at the new location.
this field is set on return from X interface and may be
used by caller as hint when deciding what to do with data
(if it was ACT_UNCHANGED or ACT_SAME_LOCATION, no array
reallocation or copying is required).
ptr pointer to the actual data, stored rowwise
Members of this structure are ae_int64_t to avoid alignment problems.
************************************************************************/
typedef struct
{
ALIGNED ae_int64_t rows;
ALIGNED ae_int64_t cols;
ALIGNED ae_int64_t stride;
ALIGNED ae_int64_t datatype;
ALIGNED ae_int64_t owner;
ALIGNED ae_int64_t last_action;
ALIGNED void *ptr;
} x_matrix;
/************************************************************************
dynamic block which may be automatically deallocated during stack unwinding
p_next next block in the stack unwinding list.
NULL means that this block is not in the list
deallocator deallocator function which should be used to deallocate block.
NULL for "special" blocks (frame/stack boundaries)
ptr pointer which should be passed to the deallocator.
may be null (for zero-size block), DYN_BOTTOM or DYN_FRAME
for "special" blocks (frame/stack boundaries).
************************************************************************/
typedef struct ae_dyn_block
{
struct ae_dyn_block * volatile p_next;
/* void *deallocator; */
void (*deallocator)(void*);
void * volatile ptr;
} ae_dyn_block;
/************************************************************************
frame marker
************************************************************************/
typedef struct ae_frame
{
ae_dyn_block db_marker;
} ae_frame;
/************************************************************************
ALGLIB environment state
************************************************************************/
typedef struct ae_state
{
/*
* endianness type: AE_LITTLE_ENDIAN or AE_BIG_ENDIAN
*/
ae_int_t endianness;
/*
* double value for NAN
*/
double v_nan;
/*
* double value for +INF
*/
double v_posinf;
/*
* double value for -INF
*/
double v_neginf;
/*
* pointer to the top block in a stack of frames
* which hold dynamically allocated objects
*/
ae_dyn_block * volatile p_top_block;
ae_dyn_block last_block;
/*
* jmp_buf for cases when C-style exception handling is used
*/
#ifndef AE_USE_CPP_ERROR_HANDLING
jmp_buf * volatile break_jump;
#endif
/*
* ae_error_type of the last error (filled when exception is thrown)
*/
ae_error_type volatile last_error;
/*
* human-readable message (filled when exception is thrown)
*/
const char* volatile error_msg;
/*
* threading information:
* a) current thread pool
* b) current worker thread
* c) parent task (one we are solving right now)
* d) thread exception handler (function which must be called
* by ae_assert before raising exception).
*
* NOTE: we use void* to store pointers in order to avoid explicit dependency on smp.h
*/
void *worker_thread;
void *parent_task;
void (*thread_exception_handler)(void*);
} ae_state;
/************************************************************************
Serializer
************************************************************************/
typedef struct
{
ae_int_t mode;
ae_int_t entries_needed;
ae_int_t entries_saved;
ae_int_t bytes_asked;
ae_int_t bytes_written;
#ifdef AE_USE_CPP_SERIALIZATION
std::string *out_cppstr;
#endif
char *out_str;
const char *in_str;
} ae_serializer;
typedef void(*ae_deallocator)(void*);
typedef struct ae_vector
{
/*
* Number of elements in array, cnt>=0
*/
ae_int_t cnt;
/*
* Either DT_BOOL, DT_INT, DT_REAL or DT_COMPLEX
*/
ae_datatype datatype;
/*
* If ptr points to memory owned and managed by ae_vector itself,
* this field is ae_false. If vector was attached to x_vector structure
* with ae_vector_attach_to_x(), this field is ae_true.
*/
ae_bool is_attached;
/*
* ae_dyn_block structure which manages data in ptr. This structure
* is responsible for automatic deletion of object when its frame
* is destroyed.
*/
ae_dyn_block data;
/*
* Pointer to data.
* User usually works with this field.
*/
union
{
void *p_ptr;
ae_bool *p_bool;
ae_int_t *p_int;
double *p_double;
ae_complex *p_complex;
} ptr;
} ae_vector;
typedef struct ae_matrix
{
ae_int_t rows;
ae_int_t cols;
ae_int_t stride;
ae_datatype datatype;
/*
* If ptr points to memory owned and managed by ae_vector itself,
* this field is ae_false. If vector was attached to x_vector structure
* with ae_vector_attach_to_x(), this field is ae_true.
*/
ae_bool is_attached;
ae_dyn_block data;
union
{
void *p_ptr;
void **pp_void;
ae_bool **pp_bool;
ae_int_t **pp_int;
double **pp_double;
ae_complex **pp_complex;
} ptr;
} ae_matrix;
typedef struct ae_smart_ptr
{
/* pointer to subscriber; all changes in ptr are translated to subscriber */
void **subscriber;
/* pointer to object */
void *ptr;
/* whether smart pointer owns ptr */
ae_bool is_owner;
/* whether object pointed by ptr is dynamic - clearing such object requires BOTH
calling destructor function AND calling ae_free for memory occupied by object. */
ae_bool is_dynamic;
/* destructor function for pointer; clears all dynamically allocated memory */
void (*destroy)(void*);
/* frame entry; used to ensure automatic deallocation of smart pointer in case of exception/exit */
ae_dyn_block frame_entry;
} ae_smart_ptr;
/*************************************************************************
Lock.
This structure provides OS-independent non-reentrant lock:
* under Windows/Posix systems it uses system-provided locks
* under Boost it uses OS-independent lock provided by Boost package
* when no OS is defined, it uses "fake lock" (just stub which is not thread-safe):
a) "fake lock" can be in locked or free mode
b) "fake lock" can be used only from one thread - one which created lock
c) when thread acquires free lock, it immediately returns
d) when thread acquires busy lock, program is terminated
(because lock is already acquired and no one else can free it)
*************************************************************************/
typedef struct
{
/*
* Pointer to _lock structure. This pointer has type void* in order to
* make header file OS-independent (lock declaration depends on OS).
*/
void *ptr;
} ae_lock;
/*************************************************************************
Shared pool: data structure used to provide thread-safe access to pool of
temporary variables.
*************************************************************************/
typedef struct ae_shared_pool_entry
{
void * volatile obj;
void * volatile next_entry;
} ae_shared_pool_entry;
typedef struct ae_shared_pool
{
/* lock object which protects pool */
ae_lock pool_lock;
/* seed object (used to create new instances of temporaries) */
void * volatile seed_object;
/*
* list of recycled OBJECTS:
* 1. entries in this list store pointers to recycled objects
* 2. every time we retrieve object, we retrieve first entry from this list,
* move it to recycled_entries and return its obj field to caller/
*/
ae_shared_pool_entry * volatile recycled_objects;
/*
* list of recycled ENTRIES:
* 1. this list holds entries which are not used to store recycled objects;
* every time recycled object is retrieved, its entry is moved to this list.
* 2. every time object is recycled, we try to fetch entry for him from this list
* before allocating it with malloc()
*/
ae_shared_pool_entry * volatile recycled_entries;
/* enumeration pointer, points to current recycled object*/
ae_shared_pool_entry * volatile enumeration_counter;
/* size of object; this field is used when we call malloc() for new objects */
ae_int_t size_of_object;
/* initializer function; accepts pointer to malloc'ed object, initializes its fields */
void (*init)(void* dst, ae_state* state);
/* copy constructor; accepts pointer to malloc'ed, but not initialized object */
void (*init_copy)(void* dst, void* src, ae_state* state);
/* destructor function; */
void (*destroy)(void* ptr);
/* frame entry; contains pointer to the pool object itself */
ae_dyn_block frame_entry;
} ae_shared_pool;
ae_int_t ae_misalignment(const void *ptr, size_t alignment);
void* ae_align(void *ptr, size_t alignment);
void* aligned_malloc(size_t size, size_t alignment);
void aligned_free(void *block);
void* ae_malloc(size_t size, ae_state *state);
void ae_free(void *p);
ae_int_t ae_sizeof(ae_datatype datatype);
void ae_touch_ptr(void *p);
void ae_state_init(ae_state *state);
void ae_state_clear(ae_state *state);
#ifndef AE_USE_CPP_ERROR_HANDLING
void ae_state_set_break_jump(ae_state *state, jmp_buf *buf);
#endif
void ae_break(ae_state *state, ae_error_type error_type, const char *msg);
void ae_frame_make(ae_state *state, ae_frame *tmp);
void ae_frame_leave(ae_state *state);
void ae_db_attach(ae_dyn_block *block, ae_state *state);
ae_bool ae_db_malloc(ae_dyn_block *block, ae_int_t size, ae_state *state, ae_bool make_automatic);
ae_bool ae_db_realloc(ae_dyn_block *block, ae_int_t size, ae_state *state);
void ae_db_free(ae_dyn_block *block);
void ae_db_swap(ae_dyn_block *block1, ae_dyn_block *block2);
void ae_vector_init(ae_vector *dst, ae_int_t size, ae_datatype datatype, ae_state *state);
void ae_vector_init_copy(ae_vector *dst, ae_vector *src, ae_state *state);
void ae_vector_init_from_x(ae_vector *dst, x_vector *src, ae_state *state);
void ae_vector_attach_to_x(ae_vector *dst, x_vector *src, ae_state *state);
ae_bool ae_vector_set_length(ae_vector *dst, ae_int_t newsize, ae_state *state);
void ae_vector_clear(ae_vector *dst);
void ae_vector_destroy(ae_vector *dst);
void ae_swap_vectors(ae_vector *vec1, ae_vector *vec2);
void ae_matrix_init(ae_matrix *dst, ae_int_t rows, ae_int_t cols, ae_datatype datatype, ae_state *state);
void ae_matrix_init_copy(ae_matrix *dst, ae_matrix *src, ae_state *state);
void ae_matrix_init_from_x(ae_matrix *dst, x_matrix *src, ae_state *state);
void ae_matrix_attach_to_x(ae_matrix *dst, x_matrix *src, ae_state *state);
ae_bool ae_matrix_set_length(ae_matrix *dst, ae_int_t rows, ae_int_t cols, ae_state *state);
void ae_matrix_clear(ae_matrix *dst);
void ae_matrix_destroy(ae_matrix *dst);
void ae_swap_matrices(ae_matrix *mat1, ae_matrix *mat2);
void ae_smart_ptr_init(ae_smart_ptr *dst, void **subscriber, ae_state *state);
void ae_smart_ptr_clear(void *_dst); /* accepts ae_smart_ptr* */
void ae_smart_ptr_destroy(void *_dst);
void ae_smart_ptr_assign(ae_smart_ptr *dst, void *new_ptr, ae_bool is_owner, ae_bool is_dynamic, void (*destroy)(void*));
void ae_smart_ptr_release(ae_smart_ptr *dst);
void ae_yield();
void ae_init_lock(ae_lock *lock);
void ae_acquire_lock(ae_lock *lock);
void ae_release_lock(ae_lock *lock);
void ae_free_lock(ae_lock *lock);
void ae_shared_pool_init(void *_dst, ae_state *state);
void ae_shared_pool_init_copy(void *_dst, void *_src, ae_state *state);
void ae_shared_pool_clear(void *dst);
void ae_shared_pool_destroy(void *dst);
ae_bool ae_shared_pool_is_initialized(void *_dst);
void ae_shared_pool_set_seed(
ae_shared_pool *dst,
void *seed_object,
ae_int_t size_of_object,
void (*init)(void* dst, ae_state* state),
void (*init_copy)(void* dst, void* src, ae_state* state),
void (*destroy)(void* ptr),
ae_state *state);
void ae_shared_pool_retrieve(
ae_shared_pool *pool,
ae_smart_ptr *pptr,
ae_state *state);
void ae_shared_pool_recycle(
ae_shared_pool *pool,
ae_smart_ptr *pptr,
ae_state *state);
void ae_shared_pool_clear_recycled(
ae_shared_pool *pool,
ae_state *state);
void ae_shared_pool_first_recycled(
ae_shared_pool *pool,
ae_smart_ptr *pptr,
ae_state *state);
void ae_shared_pool_next_recycled(
ae_shared_pool *pool,
ae_smart_ptr *pptr,
ae_state *state);
void ae_shared_pool_reset(
ae_shared_pool *pool,
ae_state *state);
void ae_x_set_vector(x_vector *dst, ae_vector *src, ae_state *state);
void ae_x_set_matrix(x_matrix *dst, ae_matrix *src, ae_state *state);
void ae_x_attach_to_vector(x_vector *dst, ae_vector *src);
void ae_x_attach_to_matrix(x_matrix *dst, ae_matrix *src);
void x_vector_clear(x_vector *dst);
ae_bool x_is_symmetric(x_matrix *a);
ae_bool x_is_hermitian(x_matrix *a);
ae_bool x_force_symmetric(x_matrix *a);
ae_bool x_force_hermitian(x_matrix *a);
ae_bool ae_is_symmetric(ae_matrix *a);
ae_bool ae_is_hermitian(ae_matrix *a);
ae_bool ae_force_symmetric(ae_matrix *a);
ae_bool ae_force_hermitian(ae_matrix *a);
void ae_serializer_init(ae_serializer *serializer);
void ae_serializer_clear(ae_serializer *serializer);
void ae_serializer_alloc_start(ae_serializer *serializer);
void ae_serializer_alloc_entry(ae_serializer *serializer);
ae_int_t ae_serializer_get_alloc_size(ae_serializer *serializer);
#ifdef AE_USE_CPP_SERIALIZATION
void ae_serializer_sstart_str(ae_serializer *serializer, std::string *buf);
void ae_serializer_ustart_str(ae_serializer *serializer, const std::string *buf);
#endif
void ae_serializer_sstart_str(ae_serializer *serializer, char *buf);
void ae_serializer_ustart_str(ae_serializer *serializer, const char *buf);
void ae_serializer_serialize_bool(ae_serializer *serializer, ae_bool v, ae_state *state);
void ae_serializer_serialize_int(ae_serializer *serializer, ae_int_t v, ae_state *state);
void ae_serializer_serialize_double(ae_serializer *serializer, double v, ae_state *state);
void ae_serializer_unserialize_bool(ae_serializer *serializer, ae_bool *v, ae_state *state);
void ae_serializer_unserialize_int(ae_serializer *serializer, ae_int_t *v, ae_state *state);
void ae_serializer_unserialize_double(ae_serializer *serializer, double *v, ae_state *state);
void ae_serializer_stop(ae_serializer *serializer);
/************************************************************************
Service functions
************************************************************************/
void ae_assert(ae_bool cond, const char *msg, ae_state *state);
ae_int_t ae_cpuid();
/************************************************************************
Real math functions:
* IEEE-compliant floating point comparisons
* standard functions
************************************************************************/
ae_bool ae_fp_eq(double v1, double v2);
ae_bool ae_fp_neq(double v1, double v2);
ae_bool ae_fp_less(double v1, double v2);
ae_bool ae_fp_less_eq(double v1, double v2);
ae_bool ae_fp_greater(double v1, double v2);
ae_bool ae_fp_greater_eq(double v1, double v2);
ae_bool ae_isfinite_stateless(double x, ae_int_t endianness);
ae_bool ae_isnan_stateless(double x, ae_int_t endianness);
ae_bool ae_isinf_stateless(double x, ae_int_t endianness);
ae_bool ae_isposinf_stateless(double x, ae_int_t endianness);
ae_bool ae_isneginf_stateless(double x, ae_int_t endianness);
ae_int_t ae_get_endianness();
ae_bool ae_isfinite(double x,ae_state *state);
ae_bool ae_isnan(double x, ae_state *state);
ae_bool ae_isinf(double x, ae_state *state);
ae_bool ae_isposinf(double x,ae_state *state);
ae_bool ae_isneginf(double x,ae_state *state);
double ae_fabs(double x, ae_state *state);
ae_int_t ae_iabs(ae_int_t x, ae_state *state);
double ae_sqr(double x, ae_state *state);
double ae_sqrt(double x, ae_state *state);
ae_int_t ae_sign(double x, ae_state *state);
ae_int_t ae_round(double x, ae_state *state);
ae_int_t ae_trunc(double x, ae_state *state);
ae_int_t ae_ifloor(double x, ae_state *state);
ae_int_t ae_iceil(double x, ae_state *state);
ae_int_t ae_maxint(ae_int_t m1, ae_int_t m2, ae_state *state);
ae_int_t ae_minint(ae_int_t m1, ae_int_t m2, ae_state *state);
double ae_maxreal(double m1, double m2, ae_state *state);
double ae_minreal(double m1, double m2, ae_state *state);
double ae_randomreal(ae_state *state);
ae_int_t ae_randominteger(ae_int_t maxv, ae_state *state);
double ae_sin(double x, ae_state *state);
double ae_cos(double x, ae_state *state);
double ae_tan(double x, ae_state *state);
double ae_sinh(double x, ae_state *state);
double ae_cosh(double x, ae_state *state);
double ae_tanh(double x, ae_state *state);
double ae_asin(double x, ae_state *state);
double ae_acos(double x, ae_state *state);
double ae_atan(double x, ae_state *state);
double ae_atan2(double y, double x, ae_state *state);
double ae_log(double x, ae_state *state);
double ae_pow(double x, double y, ae_state *state);
double ae_exp(double x, ae_state *state);
/************************************************************************
Complex math functions:
* basic arithmetic operations
* standard functions
************************************************************************/
ae_complex ae_complex_from_i(ae_int_t v);
ae_complex ae_complex_from_d(double v);
ae_complex ae_c_neg(ae_complex lhs);
ae_bool ae_c_eq(ae_complex lhs, ae_complex rhs);
ae_bool ae_c_neq(ae_complex lhs, ae_complex rhs);
ae_complex ae_c_add(ae_complex lhs, ae_complex rhs);
ae_complex ae_c_mul(ae_complex lhs, ae_complex rhs);
ae_complex ae_c_sub(ae_complex lhs, ae_complex rhs);
ae_complex ae_c_div(ae_complex lhs, ae_complex rhs);
ae_bool ae_c_eq_d(ae_complex lhs, double rhs);
ae_bool ae_c_neq_d(ae_complex lhs, double rhs);
ae_complex ae_c_add_d(ae_complex lhs, double rhs);
ae_complex ae_c_mul_d(ae_complex lhs, double rhs);
ae_complex ae_c_sub_d(ae_complex lhs, double rhs);
ae_complex ae_c_d_sub(double lhs, ae_complex rhs);
ae_complex ae_c_div_d(ae_complex lhs, double rhs);
ae_complex ae_c_d_div(double lhs, ae_complex rhs);
ae_complex ae_c_conj(ae_complex lhs, ae_state *state);
ae_complex ae_c_sqr(ae_complex lhs, ae_state *state);
double ae_c_abs(ae_complex z, ae_state *state);
/************************************************************************
Complex BLAS operations
************************************************************************/
ae_complex ae_v_cdotproduct(const ae_complex *v0, ae_int_t stride0, const char *conj0, const ae_complex *v1, ae_int_t stride1, const char *conj1, ae_int_t n);
void ae_v_cmove(ae_complex *vdst, ae_int_t stride_dst, const ae_complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void ae_v_cmoveneg(ae_complex *vdst, ae_int_t stride_dst, const ae_complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void ae_v_cmoved(ae_complex *vdst, ae_int_t stride_dst, const ae_complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void ae_v_cmovec(ae_complex *vdst, ae_int_t stride_dst, const ae_complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, ae_complex alpha);
void ae_v_cadd(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void ae_v_caddd(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void ae_v_caddc(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, ae_complex alpha);
void ae_v_csub(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void ae_v_csubd(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void ae_v_csubc(ae_complex *vdst, ae_int_t stride_dst, const ae_complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, ae_complex alpha);
void ae_v_cmuld(ae_complex *vdst, ae_int_t stride_dst, ae_int_t n, double alpha);
void ae_v_cmulc(ae_complex *vdst, ae_int_t stride_dst, ae_int_t n, ae_complex alpha);
/************************************************************************
Real BLAS operations
************************************************************************/
double ae_v_dotproduct(const double *v0, ae_int_t stride0, const double *v1, ae_int_t stride1, ae_int_t n);
void ae_v_move(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n);
void ae_v_moveneg(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n);
void ae_v_moved(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void ae_v_add(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n);
void ae_v_addd(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void ae_v_sub(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n);
void ae_v_subd(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void ae_v_muld(double *vdst, ae_int_t stride_dst, ae_int_t n, double alpha);
/************************************************************************
Other functions
************************************************************************/
ae_int_t ae_v_len(ae_int_t a, ae_int_t b);
/*
extern const double ae_machineepsilon;
extern const double ae_maxrealnumber;
extern const double ae_minrealnumber;
extern const double ae_pi;
*/
#define ae_machineepsilon 5E-16
#define ae_maxrealnumber 1E300
#define ae_minrealnumber 1E-300
#define ae_pi 3.1415926535897932384626433832795
/************************************************************************
RComm functions
************************************************************************/
typedef struct rcommstate
{
int stage;
ae_vector ia;
ae_vector ba;
ae_vector ra;
ae_vector ca;
} rcommstate;
void _rcommstate_init(rcommstate* p, ae_state *_state);
void _rcommstate_init_copy(rcommstate* dst, rcommstate* src, ae_state *_state);
void _rcommstate_clear(rcommstate* p);
void _rcommstate_destroy(rcommstate* p);
/************************************************************************
Allocation counter, inactive by default.
Turned on when needed for debugging purposes.
************************************************************************/
extern ae_int64_t _alloc_counter;
extern ae_bool _use_alloc_counter;
/************************************************************************
debug functions (must be turned on by preprocessor definitions):
* tickcount(), which is wrapper around GetTickCount()
* flushconsole(), fluches console
* ae_debugrng(), returns random number generated with high-quality random numbers generator
* ae_set_seed(), sets seed of the debug RNG (NON-THREAD-SAFE!!!)
* ae_get_seed(), returns two seed values of the debug RNG (NON-THREAD-SAFE!!!)
************************************************************************/
#ifdef AE_DEBUG4WINDOWS
#define flushconsole(s) fflush(stdout)
#define tickcount(s) _tickcount()
int _tickcount();
#endif
#ifdef AE_DEBUG4POSIX
#define flushconsole(s) fflush(stdout)
#define tickcount(s) _tickcount()
int _tickcount();
#endif
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS DECLARATIONS FOR C++ RELATED FUNCTIONALITY
//
/////////////////////////////////////////////////////////////////////////
namespace alglib
{
typedef alglib_impl::ae_int_t ae_int_t;
/********************************************************************
Class forwards
********************************************************************/
class complex;
ae_int_t vlen(ae_int_t n1, ae_int_t n2);
/********************************************************************
Exception class.
********************************************************************/
class ap_error
{
public:
std::string msg;
ap_error();
ap_error(const char *s);
static void make_assertion(bool bClause);
static void make_assertion(bool bClause, const char *p_msg);
private:
};
/********************************************************************
Complex number with double precision.
********************************************************************/
class complex
{
public:
complex();
complex(const double &_x);
complex(const double &_x, const double &_y);
complex(const complex &z);
complex& operator= (const double& v);
complex& operator+=(const double& v);
complex& operator-=(const double& v);
complex& operator*=(const double& v);
complex& operator/=(const double& v);
complex& operator= (const complex& z);
complex& operator+=(const complex& z);
complex& operator-=(const complex& z);
complex& operator*=(const complex& z);
complex& operator/=(const complex& z);
alglib_impl::ae_complex* c_ptr();
const alglib_impl::ae_complex* c_ptr() const;
std::string tostring(int dps) const;
double x, y;
};
const alglib::complex operator/(const alglib::complex& lhs, const alglib::complex& rhs);
const bool operator==(const alglib::complex& lhs, const alglib::complex& rhs);
const bool operator!=(const alglib::complex& lhs, const alglib::complex& rhs);
const alglib::complex operator+(const alglib::complex& lhs);
const alglib::complex operator-(const alglib::complex& lhs);
const alglib::complex operator+(const alglib::complex& lhs, const alglib::complex& rhs);
const alglib::complex operator+(const alglib::complex& lhs, const double& rhs);
const alglib::complex operator+(const double& lhs, const alglib::complex& rhs);
const alglib::complex operator-(const alglib::complex& lhs, const alglib::complex& rhs);
const alglib::complex operator-(const alglib::complex& lhs, const double& rhs);
const alglib::complex operator-(const double& lhs, const alglib::complex& rhs);
const alglib::complex operator*(const alglib::complex& lhs, const alglib::complex& rhs);
const alglib::complex operator*(const alglib::complex& lhs, const double& rhs);
const alglib::complex operator*(const double& lhs, const alglib::complex& rhs);
const alglib::complex operator/(const alglib::complex& lhs, const alglib::complex& rhs);
const alglib::complex operator/(const double& lhs, const alglib::complex& rhs);
const alglib::complex operator/(const alglib::complex& lhs, const double& rhs);
double abscomplex(const alglib::complex &z);
alglib::complex conj(const alglib::complex &z);
alglib::complex csqr(const alglib::complex &z);
void setnworkers(alglib::ae_int_t nworkers);
/********************************************************************
Level 1 BLAS functions
NOTES:
* destination and source should NOT overlap
* stride is assumed to be positive, but it is not
assert'ed within function
* conj_src parameter specifies whether complex source is conjugated
before processing or not. Pass string which starts with 'N' or 'n'
("No conj", for example) to use unmodified parameter. All other
values will result in conjugation of input, but it is recommended
to use "Conj" in such cases.
********************************************************************/
double vdotproduct(const double *v0, ae_int_t stride0, const double *v1, ae_int_t stride1, ae_int_t n);
double vdotproduct(const double *v1, const double *v2, ae_int_t N);
alglib::complex vdotproduct(const alglib::complex *v0, ae_int_t stride0, const char *conj0, const alglib::complex *v1, ae_int_t stride1, const char *conj1, ae_int_t n);
alglib::complex vdotproduct(const alglib::complex *v1, const alglib::complex *v2, ae_int_t N);
void vmove(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n);
void vmove(double *vdst, const double* vsrc, ae_int_t N);
void vmove(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void vmove(alglib::complex *vdst, const alglib::complex* vsrc, ae_int_t N);
void vmoveneg(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n);
void vmoveneg(double *vdst, const double *vsrc, ae_int_t N);
void vmoveneg(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void vmoveneg(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N);
void vmove(double *vdst, ae_int_t stride_dst, const double* vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void vmove(double *vdst, const double *vsrc, ae_int_t N, double alpha);
void vmove(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void vmove(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, double alpha);
void vmove(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex* vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, alglib::complex alpha);
void vmove(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, alglib::complex alpha);
void vadd(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n);
void vadd(double *vdst, const double *vsrc, ae_int_t N);
void vadd(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void vadd(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N);
void vadd(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void vadd(double *vdst, const double *vsrc, ae_int_t N, double alpha);
void vadd(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void vadd(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, double alpha);
void vadd(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, alglib::complex alpha);
void vadd(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, alglib::complex alpha);
void vsub(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n);
void vsub(double *vdst, const double *vsrc, ae_int_t N);
void vsub(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n);
void vsub(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N);
void vsub(double *vdst, ae_int_t stride_dst, const double *vsrc, ae_int_t stride_src, ae_int_t n, double alpha);
void vsub(double *vdst, const double *vsrc, ae_int_t N, double alpha);
void vsub(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, double alpha);
void vsub(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, double alpha);
void vsub(alglib::complex *vdst, ae_int_t stride_dst, const alglib::complex *vsrc, ae_int_t stride_src, const char *conj_src, ae_int_t n, alglib::complex alpha);
void vsub(alglib::complex *vdst, const alglib::complex *vsrc, ae_int_t N, alglib::complex alpha);
void vmul(double *vdst, ae_int_t stride_dst, ae_int_t n, double alpha);
void vmul(double *vdst, ae_int_t N, double alpha);
void vmul(alglib::complex *vdst, ae_int_t stride_dst, ae_int_t n, double alpha);
void vmul(alglib::complex *vdst, ae_int_t N, double alpha);
void vmul(alglib::complex *vdst, ae_int_t stride_dst, ae_int_t n, alglib::complex alpha);
void vmul(alglib::complex *vdst, ae_int_t N, alglib::complex alpha);
/********************************************************************
string conversion functions !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
********************************************************************/
/********************************************************************
1- and 2-dimensional arrays
********************************************************************/
class ae_vector_wrapper
{
public:
ae_vector_wrapper();
virtual ~ae_vector_wrapper();
void setlength(ae_int_t iLen);
ae_int_t length() const;
void attach_to(alglib_impl::ae_vector *ptr);
void allocate_own(ae_int_t size, alglib_impl::ae_datatype datatype);
const alglib_impl::ae_vector* c_ptr() const;
alglib_impl::ae_vector* c_ptr();
private:
ae_vector_wrapper(const ae_vector_wrapper &rhs);
const ae_vector_wrapper& operator=(const ae_vector_wrapper &rhs);
protected:
//
// Copies source vector RHS into current object.
//
// Current object is considered empty (this function should be
// called from copy constructor).
//
void create(const ae_vector_wrapper &rhs);
//
// Copies array given by string into current object. Additional
// parameter DATATYPE contains information about type of the data
// in S and type of the array to create.
//
// Current object is considered empty (this function should be
// called from copy constructor).
//
void create(const char *s, alglib_impl::ae_datatype datatype);
//
// Assigns RHS to current object.
//
// It has several branches depending on target object status:
// * in case it is proxy object, data are copied into memory pointed by
// proxy. Function checks that source has exactly same size as target
// (exception is thrown on failure).
// * in case it is non-proxy object, data allocated by object are cleared
// and a copy of RHS is created in target.
//
// NOTE: this function correctly handles assignments of the object to itself.
//
void assign(const ae_vector_wrapper &rhs);
alglib_impl::ae_vector *p_vec;
alglib_impl::ae_vector vec;
};
class boolean_1d_array : public ae_vector_wrapper
{
public:
boolean_1d_array();
boolean_1d_array(const char *s);
boolean_1d_array(const boolean_1d_array &rhs);
boolean_1d_array(alglib_impl::ae_vector *p);
const boolean_1d_array& operator=(const boolean_1d_array &rhs);
virtual ~boolean_1d_array() ;
const ae_bool& operator()(ae_int_t i) const;
ae_bool& operator()(ae_int_t i);
const ae_bool& operator[](ae_int_t i) const;
ae_bool& operator[](ae_int_t i);
void setcontent(ae_int_t iLen, const bool *pContent );
ae_bool* getcontent();
const ae_bool* getcontent() const;
std::string tostring() const;
};
class integer_1d_array : public ae_vector_wrapper
{
public:
integer_1d_array();
integer_1d_array(const char *s);
integer_1d_array(const integer_1d_array &rhs);
integer_1d_array(alglib_impl::ae_vector *p);
const integer_1d_array& operator=(const integer_1d_array &rhs);
virtual ~integer_1d_array();
const ae_int_t& operator()(ae_int_t i) const;
ae_int_t& operator()(ae_int_t i);
const ae_int_t& operator[](ae_int_t i) const;
ae_int_t& operator[](ae_int_t i);
void setcontent(ae_int_t iLen, const ae_int_t *pContent );
ae_int_t* getcontent();
const ae_int_t* getcontent() const;
std::string tostring() const;
};
class real_1d_array : public ae_vector_wrapper
{
public:
real_1d_array();
real_1d_array(const char *s);
real_1d_array(const real_1d_array &rhs);
real_1d_array(alglib_impl::ae_vector *p);
const real_1d_array& operator=(const real_1d_array &rhs);
virtual ~real_1d_array();
const double& operator()(ae_int_t i) const;
double& operator()(ae_int_t i);
const double& operator[](ae_int_t i) const;
double& operator[](ae_int_t i);
void setcontent(ae_int_t iLen, const double *pContent );
double* getcontent();
const double* getcontent() const;
std::string tostring(int dps) const;
};
class complex_1d_array : public ae_vector_wrapper
{
public:
complex_1d_array();
complex_1d_array(const char *s);
complex_1d_array(const complex_1d_array &rhs);
complex_1d_array(alglib_impl::ae_vector *p);
const complex_1d_array& operator=(const complex_1d_array &rhs);
virtual ~complex_1d_array();
const alglib::complex& operator()(ae_int_t i) const;
alglib::complex& operator()(ae_int_t i);
const alglib::complex& operator[](ae_int_t i) const;
alglib::complex& operator[](ae_int_t i);
void setcontent(ae_int_t iLen, const alglib::complex *pContent );
alglib::complex* getcontent();
const alglib::complex* getcontent() const;
std::string tostring(int dps) const;
};
class ae_matrix_wrapper
{
public:
ae_matrix_wrapper();
virtual ~ae_matrix_wrapper();
const ae_matrix_wrapper& operator=(const ae_matrix_wrapper &rhs);
void setlength(ae_int_t rows, ae_int_t cols);
ae_int_t rows() const;
ae_int_t cols() const;
bool isempty() const;
ae_int_t getstride() const;
void attach_to(alglib_impl::ae_matrix *ptr);
void allocate_own(ae_int_t rows, ae_int_t cols, alglib_impl::ae_datatype datatype);
const alglib_impl::ae_matrix* c_ptr() const;
alglib_impl::ae_matrix* c_ptr();
private:
ae_matrix_wrapper(const ae_matrix_wrapper &rhs);
protected:
//
// Copies source matrix RHS into current object.
//
// Current object is considered empty (this function should be
// called from copy constructor).
//
void create(const ae_matrix_wrapper &rhs);
//
// Copies array given by string into current object. Additional
// parameter DATATYPE contains information about type of the data
// in S and type of the array to create.
//
// Current object is considered empty (this function should be
// called from copy constructor).
//
void create(const char *s, alglib_impl::ae_datatype datatype);
//
// Assigns RHS to current object.
//
// It has several branches depending on target object status:
// * in case it is proxy object, data are copied into memory pointed by
// proxy. Function checks that source has exactly same size as target
// (exception is thrown on failure).
// * in case it is non-proxy object, data allocated by object are cleared
// and a copy of RHS is created in target.
//
// NOTE: this function correctly handles assignments of the object to itself.
//
void assign(const ae_matrix_wrapper &rhs);
alglib_impl::ae_matrix *p_mat;
alglib_impl::ae_matrix mat;
};
class boolean_2d_array : public ae_matrix_wrapper
{
public:
boolean_2d_array();
boolean_2d_array(const boolean_2d_array &rhs);
boolean_2d_array(alglib_impl::ae_matrix *p);
boolean_2d_array(const char *s);
virtual ~boolean_2d_array();
const ae_bool& operator()(ae_int_t i, ae_int_t j) const;
ae_bool& operator()(ae_int_t i, ae_int_t j);
const ae_bool* operator[](ae_int_t i) const;
ae_bool* operator[](ae_int_t i);
void setcontent(ae_int_t irows, ae_int_t icols, const bool *pContent );
std::string tostring() const ;
};
class integer_2d_array : public ae_matrix_wrapper
{
public:
integer_2d_array();
integer_2d_array(const integer_2d_array &rhs);
integer_2d_array(alglib_impl::ae_matrix *p);
integer_2d_array(const char *s);
virtual ~integer_2d_array();
const ae_int_t& operator()(ae_int_t i, ae_int_t j) const;
ae_int_t& operator()(ae_int_t i, ae_int_t j);
const ae_int_t* operator[](ae_int_t i) const;
ae_int_t* operator[](ae_int_t i);
void setcontent(ae_int_t irows, ae_int_t icols, const ae_int_t *pContent );
std::string tostring() const;
};
class real_2d_array : public ae_matrix_wrapper
{
public:
real_2d_array();
real_2d_array(const real_2d_array &rhs);
real_2d_array(alglib_impl::ae_matrix *p);
real_2d_array(const char *s);
virtual ~real_2d_array();
const double& operator()(ae_int_t i, ae_int_t j) const;
double& operator()(ae_int_t i, ae_int_t j);
const double* operator[](ae_int_t i) const;
double* operator[](ae_int_t i);
void setcontent(ae_int_t irows, ae_int_t icols, const double *pContent );
std::string tostring(int dps) const;
};
class complex_2d_array : public ae_matrix_wrapper
{
public:
complex_2d_array();
complex_2d_array(const complex_2d_array &rhs);
complex_2d_array(alglib_impl::ae_matrix *p);
complex_2d_array(const char *s);
virtual ~complex_2d_array();
const alglib::complex& operator()(ae_int_t i, ae_int_t j) const;
alglib::complex& operator()(ae_int_t i, ae_int_t j);
const alglib::complex* operator[](ae_int_t i) const;
alglib::complex* operator[](ae_int_t i);
void setcontent(ae_int_t irows, ae_int_t icols, const alglib::complex *pContent );
std::string tostring(int dps) const;
};
/********************************************************************
CSV operations: reading CSV file to real matrix.
This function reads CSV file and stores its contents to double
precision 2D array. Format of the data file must conform to RFC 4180
specification, with additional notes:
* file size should be less than 2GB
* ASCI encoding, UTF-8 without BOM (in header names) are supported
* any character (comma/tab/space) may be used as field separator, as
long as it is distinct from one used for decimal point
* multiple subsequent field separators (say, two spaces) are treated
as MULTIPLE separators, not one big separator
* both comma and full stop may be used as decimal point. Parser will
automatically determine specific character being used. Both fixed
and exponential number formats are allowed. Thousand separators
are NOT allowed.
* line may end with \n (Unix style) or \r\n (Windows style), parser
will automatically adapt to chosen convention
* escaped fields (ones in double quotes) are not supported
INPUT PARAMETERS:
filename relative/absolute path
separator character used to separate fields. May be ' ',
',', '\t'. Other separators are possible too.
flags several values combined with bitwise OR:
* alglib::CSV_SKIP_HEADERS - if present, first row
contains headers and will be skipped. Its
contents is used to determine fields count, and
that's all.
If no flags are specified, default value 0x0 (or
alglib::CSV_DEFAULT, which is same) should be used.
OUTPUT PARAMETERS:
out 2D matrix, CSV file parsed with atof()
HANDLING OF SPECIAL CASES:
* file does not exist - alglib::ap_error exception is thrown
* empty file - empty array is returned (no exception)
* skip_first_row=true, only one row in file - empty array is returned
* field contents is not recognized by atof() - field value is replaced
by 0.0
********************************************************************/
void read_csv(const char *filename, char separator, int flags, alglib::real_2d_array &out);
/********************************************************************
dataset information.
can store regression dataset, classification dataset, or non-labeled
task:
* nout==0 means non-labeled task (clustering, for example)
* nout>0 && nclasses==0 means regression task
* nout>0 && nclasses>0 means classification task
********************************************************************/
/*class dataset
{
public:
dataset():nin(0), nout(0), nclasses(0), trnsize(0), valsize(0), tstsize(0), totalsize(0){};
int nin, nout, nclasses;
int trnsize;
int valsize;
int tstsize;
int totalsize;
alglib::real_2d_array trn;
alglib::real_2d_array val;
alglib::real_2d_array tst;
alglib::real_2d_array all;
};
bool opendataset(std::string file, dataset *pdataset);
//
// internal functions
//
std::string strtolower(const std::string &s);
bool readstrings(std::string file, std::list<std::string> *pOutput);
bool readstrings(std::string file, std::list<std::string> *pOutput, std::string comment);
void explodestring(std::string s, char sep, std::vector<std::string> *pOutput);
std::string xtrim(std::string s);*/
/********************************************************************
Constants and functions introduced for compatibility with AlgoPascal
********************************************************************/
extern const double machineepsilon;
extern const double maxrealnumber;
extern const double minrealnumber;
extern const double fp_nan;
extern const double fp_posinf;
extern const double fp_neginf;
extern const ae_int_t endianness;
static const int CSV_DEFAULT = 0x0;
static const int CSV_SKIP_HEADERS = 0x1;
int sign(double x);
double randomreal();
ae_int_t randominteger(ae_int_t maxv);
int round(double x);
int trunc(double x);
int ifloor(double x);
int iceil(double x);
double pi();
double sqr(double x);
int maxint(int m1, int m2);
int minint(int m1, int m2);
double maxreal(double m1, double m2);
double minreal(double m1, double m2);
bool fp_eq(double v1, double v2);
bool fp_neq(double v1, double v2);
bool fp_less(double v1, double v2);
bool fp_less_eq(double v1, double v2);
bool fp_greater(double v1, double v2);
bool fp_greater_eq(double v1, double v2);
bool fp_isnan(double x);
bool fp_isposinf(double x);
bool fp_isneginf(double x);
bool fp_isinf(double x);
bool fp_isfinite(double x);
}//namespace alglib
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTIONS CONTAINS DECLARATIONS FOR OPTIMIZED LINEAR ALGEBRA CODES
// IT IS SHARED BETWEEN C++ AND PURE C LIBRARIES
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
#define ALGLIB_INTERCEPTS_ABLAS
void _ialglib_vzero(ae_int_t n, double *p, ae_int_t stride);
void _ialglib_vzero_complex(ae_int_t n, ae_complex *p, ae_int_t stride);
void _ialglib_vcopy(ae_int_t n, const double *a, ae_int_t stridea, double *b, ae_int_t strideb);
void _ialglib_vcopy_complex(ae_int_t n, const ae_complex *a, ae_int_t stridea, double *b, ae_int_t strideb, const char *conj);
void _ialglib_vcopy_dcomplex(ae_int_t n, const double *a, ae_int_t stridea, double *b, ae_int_t strideb, const char *conj);
void _ialglib_mcopyblock(ae_int_t m, ae_int_t n, const double *a, ae_int_t op, ae_int_t stride, double *b);
void _ialglib_mcopyunblock(ae_int_t m, ae_int_t n, const double *a, ae_int_t op, double *b, ae_int_t stride);
void _ialglib_mcopyblock_complex(ae_int_t m, ae_int_t n, const ae_complex *a, ae_int_t op, ae_int_t stride, double *b);
void _ialglib_mcopyunblock_complex(ae_int_t m, ae_int_t n, const double *a, ae_int_t op, ae_complex* b, ae_int_t stride);
ae_bool _ialglib_i_rmatrixgemmf(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
ae_matrix *b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
double beta,
ae_matrix *c,
ae_int_t ic,
ae_int_t jc);
ae_bool _ialglib_i_cmatrixgemmf(ae_int_t m,
ae_int_t n,
ae_int_t k,
ae_complex alpha,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
ae_matrix *b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
ae_complex beta,
ae_matrix *c,
ae_int_t ic,
ae_int_t jc);
ae_bool _ialglib_i_cmatrixrighttrsmf(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
ae_matrix *x,
ae_int_t i2,
ae_int_t j2);
ae_bool _ialglib_i_rmatrixrighttrsmf(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
ae_matrix *x,
ae_int_t i2,
ae_int_t j2);
ae_bool _ialglib_i_cmatrixlefttrsmf(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
ae_matrix *x,
ae_int_t i2,
ae_int_t j2);
ae_bool _ialglib_i_rmatrixlefttrsmf(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
ae_matrix *x,
ae_int_t i2,
ae_int_t j2);
ae_bool _ialglib_i_cmatrixherkf(ae_int_t n,
ae_int_t k,
double alpha,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
ae_matrix *c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper);
ae_bool _ialglib_i_rmatrixsyrkf(ae_int_t n,
ae_int_t k,
double alpha,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
ae_matrix *c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper);
ae_bool _ialglib_i_cmatrixrank1f(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_vector *u,
ae_int_t uoffs,
ae_vector *v,
ae_int_t voffs);
ae_bool _ialglib_i_rmatrixrank1f(ae_int_t m,
ae_int_t n,
ae_matrix *a,
ae_int_t ia,
ae_int_t ja,
ae_vector *u,
ae_int_t uoffs,
ae_vector *v,
ae_int_t voffs);
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS PARALLEL SUBROUTINES
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
}
#endif
|