File: bqb_math.h

package info (click to toggle)
travis 200504%2Bhf2-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 7,540 kB
  • sloc: cpp: 135,321; makefile: 38
file content (1121 lines) | stat: -rwxr-xr-x 24,482 bytes parent folder | download
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
/***********************************************************************************

    LibBQB - File Format and Compression Algorithms for Trajectories of
             Volumetric Data and Atom Positions

    https://brehm-research.de/bqb

    Free software, licensed under GNU LGPL v3

    Copyright (c) Martin Brehm and Martin Thomas,
                  Martin Luther University Halle-Wittenberg, Germany,
                  2016 - 2020.

    Please cite:  M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
                  for Trajectories of Atom Positions and Volumetric Data",
                  J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.

    --------------------------------------------------------------------------------

    LibBQB is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.

***********************************************************************************/



#ifndef BQB_MATH_H
#define BQB_MATH_H


// This must always be the first include directive
#include "bqb_config.h"

#include "bqb_tools.h"



class CBQBInterface;



#ifdef BQB_INSIDE_TRAVIS


#include "xdvector3.h"
#include "xdvectorn.h"
#include "xdmatrix3.h"
#include "xdmatrixmn.h"

#define bqbpow2 pow2
#define bqbpow3 pow3
#define bqbpow4 pow4
#define bqbpow5 pow5

#define CBQBDVector3  CxDVector3
#define CBQBDVectorN  CxDVectorN
#define CBQBDMatrix3  CxDMatrix3
#define CBQBDMatrixMN CxDMatrixMN


#else


class CBQBDMatrix3;
class CBQBDVector3;
class CBQBDMatrixMN;
class CBQBDVectorN;


inline double bqbpow2(double x) { return x*x; }
inline double bqbpow3(double x) { return x*x*x; }
inline double bqbpow4(double x) { return (x*x)*(x*x); }
inline double bqbpow5(double x) { return (x*x*x)*(x*x); }


#endif



class CBQBMath { // Encapsulates everything that may print to log
public:

	explicit CBQBMath(CBQBInterface &i) : m_IF(i) {
	}

	void DumpMatrix(const CBQBDMatrix3 &m) const;

	void DumpMatrixSmall(const CBQBDMatrix3 &m) const;

	void DumpMatrix(const CBQBDMatrixMN &m) const;

	void DumpMatrixSmall(const CBQBDMatrixMN &m) const;

	void InvertMatrix(CBQBDMatrix3 &m);

	double Angle(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2) const;

	double Angle_Deg(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2) const;

	double DotP(const CBQBDVectorN &vec1, const CBQBDVectorN &vec2) const;

	double Angle(const CBQBDVectorN &vec1, const CBQBDVectorN &vec2) const;

	double Angle_Deg(const CBQBDVectorN &vec1, const CBQBDVectorN &vec2) const;

private:
	CBQBInterface &m_IF;
};



#ifndef BQB_INSIDE_TRAVIS


//double Dihedral(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2, const CBQBDVector3 &norm, bool absolute);



class CBQBDVector3
{
public:
	CBQBDVector3() {
	}


	~CBQBDVector3() {
	}
	

	CBQBDVector3(const CBQBDVector3 &v) {
		m_pData[0] = v.m_pData[0];
		m_pData[1] = v.m_pData[1];
		m_pData[2] = v.m_pData[2];
	}


	explicit CBQBDVector3(double f) {
		m_pData[0] = f;
		m_pData[1] = f;
		m_pData[2] = f;
	}


	CBQBDVector3(double x, double y, double z) {
		m_pData[0] = x;
		m_pData[1] = y;
		m_pData[2] = z;
	}


	double &GetAt(int i) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::GetAt(int): %d...",i);
		#endif
		return m_pData[i];
	}


	double &operator [] (int i) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator [] (int): %d\n",i);
		#endif
		return GetAt(i);
	}


	double GetAt(int i) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::GetAt(int): %d...",i);
		#endif
		#ifdef DEBUG_ARRAYS
			if (i > 2) {
				printf("CBQBDVector3::GetAt(int): Boundary Error (%d/3)...",i);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double operator [] (int i) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator [] (int): %d\n",i);
		#endif
		return GetAt(i);
	}


	CBQBDVector3 operator + (const CBQBDVector3 &v) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator + (CBQBDVector3&)\n");
		#endif
		return CBQBDVector3(m_pData[0]+v.m_pData[0],m_pData[1]+v.m_pData[1],m_pData[2]+v.m_pData[2]);
	}


	CBQBDVector3 operator - (const CBQBDVector3 &v) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator - (CBQBDVector3&)\n");
		#endif
		return CBQBDVector3(m_pData[0]-v.m_pData[0],m_pData[1]-v.m_pData[1],m_pData[2]-v.m_pData[2]);
	}


	CBQBDVector3 operator * (double f) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator * (double)\n");
		#endif
		return CBQBDVector3(m_pData[0]*f,m_pData[1]*f,m_pData[2]*f);
	}


	CBQBDVector3 operator / (double f) const {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator / (double)\n");
		#endif
		return CBQBDVector3(m_pData[0]/f,m_pData[1]/f,m_pData[2]/f);
	}


	void operator += (const CBQBDVector3 &v) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator += (CBQBDVector3&)\n");
		#endif
		m_pData[0] += v.m_pData[0];
		m_pData[1] += v.m_pData[1];
		m_pData[2] += v.m_pData[2];
	}


	void operator -= (const CBQBDVector3 &v) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator -= (CBQBDVector3&)\n");
		#endif
		m_pData[0] -= v.m_pData[0];
		m_pData[1] -= v.m_pData[1];
		m_pData[2] -= v.m_pData[2];
	}


	void operator *= (double f) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator *= (double)\n");
		#endif
		m_pData[0] *= f;
		m_pData[1] *= f;
		m_pData[2] *= f;
	}


	void operator /= (double f) {
		#ifdef DEBUG_CDVECTOR3
			printf("@ CBQBDVector3::operator /= (double)\n");
		#endif
		m_pData[0] /= f;
		m_pData[1] /= f;
		m_pData[2] /= f;
	}


	double GetLength() const {
		return sqrt(m_pData[0]*m_pData[0]+m_pData[1]*m_pData[1]+m_pData[2]*m_pData[2]);
	}


	double GetLengthSqr() const {
		return m_pData[0]*m_pData[0]+m_pData[1]*m_pData[1]+m_pData[2]*m_pData[2];
	}


	void Normalize() {
		double l;
		l = GetLength();
		m_pData[0] /= l;
		m_pData[1] /= l;
		m_pData[2] /= l;
	}


	void Chop(double d) {
		if ((m_pData[0] != 0) && (fabs(m_pData[0]) < d))
			m_pData[0] = 0;
		if ((m_pData[1] != 0) && (fabs(m_pData[1]) < d))
			m_pData[1] = 0;
		if ((m_pData[2] != 0) && (fabs(m_pData[2]) < d))
			m_pData[2] = 0;
	}


	void PointRoot(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2, const CBQBDVector3 &point);


private:
	double m_pData[3];
};



inline void Swap(CBQBDVector3 &vec1, CBQBDVector3 &vec2) {
	CBQBDVector3 t;
	t = vec1;
	vec1 = vec2;
	vec2 = t;
}


inline CBQBDVector3 operator * (double f, const CBQBDVector3 &v) {
	return v*f;
}


inline CBQBDVector3 CrossP(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2) {
	return CBQBDVector3(vec1[1]*vec2[2] - vec1[2]*vec2[1],
		vec1[2]*vec2[0] - vec1[0]*vec2[2],
		vec1[0]*vec2[1] - vec1[1]*vec2[0]);
}


inline double DotP(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2) {
	return vec1[0]*vec2[0]+vec1[1]*vec2[1]+vec1[2]*vec2[2];
}


inline double VecDist(const CBQBDVector3 &vec1, const CBQBDVector3 &vec2) {
	return sqrt((vec1[0]-vec2[0])*(vec1[0]-vec2[0]) + (vec1[1]-vec2[1])*(vec1[1]-vec2[1]) + (vec1[2]-vec2[2])*(vec1[2]-vec2[2]));
}


inline CBQBDVector3 Normalize(const CBQBDVector3 &vec) {
	double tf;
	tf = vec.GetLength();
	return CBQBDVector3(vec[0]/tf,vec[1]/tf,vec[2]/tf);
}



class CBQBDMatrix3 {
public:

	CBQBDMatrix3() {
	}

	~CBQBDMatrix3() {
	}


	CBQBDMatrix3(const CBQBDMatrix3 &m) {
		m_pData[0] = m.m_pData[0];
		m_pData[1] = m.m_pData[1];
		m_pData[2] = m.m_pData[2];
		m_pData[3] = m.m_pData[3];
		m_pData[4] = m.m_pData[4];
		m_pData[5] = m.m_pData[5];
		m_pData[6] = m.m_pData[6];
		m_pData[7] = m.m_pData[7];
		m_pData[8] = m.m_pData[8];
	}


	explicit CBQBDMatrix3(double f) {
		m_pData[0] = f;
		m_pData[1] = f;
		m_pData[2] = f;
		m_pData[3] = f;
		m_pData[4] = f;
		m_pData[5] = f;
		m_pData[6] = f;
		m_pData[7] = f;
		m_pData[8] = f;
	}


	CBQBDMatrix3(double a, double b, double c, double d, double e, double f, double g, double h, double i) {
		m_pData[0] = a;
		m_pData[1] = b;
		m_pData[2] = c;
		m_pData[3] = d;
		m_pData[4] = e;
		m_pData[5] = f;
		m_pData[6] = g;
		m_pData[7] = h;
		m_pData[8] = i;
	}


	double &GetAt(int i) {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::GetAt(int): %d...",i);
		#endif
		return m_pData[i];
	}


	double &GetAt(int i, int j) {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::GetAt(int, int): %d, %d...",i,j);
		#endif
		return m_pData[i*3+j];
	}


	double &operator [] (int i) {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator [] (int): %d\n",i);
		#endif
		return GetAt(i);
	}


	double GetAt(int i) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::GetAt(int): %d...",i);
		#endif
		return m_pData[i];
	}


	double GetAt(int i, int j) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::GetAt(int, int): %d, %d...",i,j);
		#endif
		return m_pData[i*3+j];
	}


	double operator [] (int i) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator [] (int): %d\n",i);
		#endif
		return GetAt(i);
	}


	double &operator () (int i, int j) {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator () (int, int): %d, %d\n",i,j);
		#endif
		return GetAt(i,j);
	}


	double operator () (int i, int j) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator () (int, int): %d, %d\n",i,j);
		#endif
		return GetAt(i,j);
	}


	void operator *= (double f) {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator *= (double)\n");
		#endif
		m_pData[0] *= f;
		m_pData[1] *= f;
		m_pData[2] *= f;
		m_pData[3] *= f;
		m_pData[4] *= f;
		m_pData[5] *= f;
		m_pData[6] *= f;
		m_pData[7] *= f;
		m_pData[8] *= f;
	}


	CBQBDMatrix3 operator * (const CBQBDMatrix3 &m) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator * (CBQBDMatrix3)\n");
		#endif
		return CBQBDMatrix3(
			GetAt(0,0)*m.GetAt(0,0) + GetAt(1,0)*m.GetAt(0,1) + GetAt(2,0)*m.GetAt(0,2),
			GetAt(0,1)*m.GetAt(0,0) + GetAt(1,1)*m.GetAt(0,1) + GetAt(2,1)*m.GetAt(0,2),
			GetAt(0,2)*m.GetAt(0,0) + GetAt(1,2)*m.GetAt(0,1) + GetAt(2,2)*m.GetAt(0,2),
			GetAt(0,0)*m.GetAt(1,0) + GetAt(1,0)*m.GetAt(1,1) + GetAt(2,0)*m.GetAt(1,2),
			GetAt(0,1)*m.GetAt(1,0) + GetAt(1,1)*m.GetAt(1,1) + GetAt(2,1)*m.GetAt(1,2),
			GetAt(0,2)*m.GetAt(1,0) + GetAt(1,2)*m.GetAt(1,1) + GetAt(2,2)*m.GetAt(1,2),
			GetAt(0,0)*m.GetAt(2,0) + GetAt(1,0)*m.GetAt(2,1) + GetAt(2,0)*m.GetAt(2,2),
			GetAt(0,1)*m.GetAt(2,0) + GetAt(1,1)*m.GetAt(2,1) + GetAt(2,1)*m.GetAt(2,2),
			GetAt(0,2)*m.GetAt(2,0) + GetAt(1,2)*m.GetAt(2,1) + GetAt(2,2)*m.GetAt(2,2)
			);
	}


	CBQBDVector3 operator * (const CBQBDVector3 &v) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator * (CBQBDVector3)\n");
		#endif
		return CBQBDVector3(
			GetAt(0,0)*v[0] + GetAt(1,0)*v[1] + GetAt(2,0)*v[2],
			GetAt(0,1)*v[0] + GetAt(1,1)*v[1] + GetAt(2,1)*v[2],
			GetAt(0,2)*v[0] + GetAt(1,2)*v[1] + GetAt(2,2)*v[2]);
	}


	CBQBDMatrix3 operator * (double f) const {
		#ifdef DEBUG_CMATRIX3
			printf("@ CBQBDMatrix3::operator * (double)\n");
		#endif
		return CBQBDMatrix3(m_pData[0]*f,m_pData[1]*f,m_pData[2]*f,m_pData[3]*f,m_pData[4]*f,m_pData[5]*f,m_pData[6]*f,m_pData[7]*f,m_pData[8]*f);
	}


	void RotMat(const CBQBDVector3 &vec, double a) {
		double ca, sa;
		ca = cos(a);
		sa = sin(a);
		GetAt(0,0) = (vec[0]*vec[0]*(1.0-ca) + ca);
		GetAt(1,0) = (vec[0]*vec[1]*(1.0-ca) - vec[2]*sa);
		GetAt(2,0) = (vec[0]*vec[2]*(1.0-ca) + vec[1]*sa);
		GetAt(0,1) = (vec[1]*vec[0]*(1.0-ca) + vec[2]*sa);
		GetAt(1,1) = (vec[1]*vec[1]*(1.0-ca) + ca);
		GetAt(2,1) = (vec[1]*vec[2]*(1.0-ca) - vec[0]*sa);
		GetAt(0,2) = (vec[2]*vec[0]*(1.0-ca) - vec[1]*sa);
		GetAt(1,2) = (vec[2]*vec[1]*(1.0-ca) + vec[0]*sa);
		GetAt(2,2) = (vec[2]*vec[2]*(1.0-ca) + ca);
	}


	void Unity() { 
		GetAt(0,0) = 1;
		GetAt(1,0) = 0;
		GetAt(2,0) = 0;
		GetAt(0,1) = 0;
		GetAt(1,1) = 1;
		GetAt(2,1) = 0;
		GetAt(0,2) = 0;
		GetAt(1,2) = 0;
		GetAt(2,2) = 1;
	}


	CBQBDMatrix3 Transpose() {
		return CBQBDMatrix3(
			GetAt(0,0), GetAt(1,0), GetAt(2,0),
			GetAt(0,1), GetAt(1,1), GetAt(2,1),
			GetAt(0,2), GetAt(1,2), GetAt(2,2));
	}


	double Det() {
		#define _deta11 GetAt(0,0)
		#define _deta12 GetAt(0,1)
		#define _deta13 GetAt(0,2)
		#define _deta21 GetAt(1,0)
		#define _deta22 GetAt(1,1)
		#define _deta23 GetAt(1,2)
		#define _deta31 GetAt(2,0)
		#define _deta32 GetAt(2,1)
		#define _deta33 GetAt(2,2)

		return  _deta11 * (_deta33*_deta22 - _deta32*_deta23)
			  - _deta21 * (_deta33*_deta12 - _deta32*_deta13)
			  + _deta31 * (_deta23*_deta12 - _deta22*_deta13);
	}


private:
	double m_pData[9];
};



class CBQBDVectorN {
public:

	CBQBDVectorN() {
		m_iDim = 0;
		m_pData = NULL;
	}


	~CBQBDVectorN() {
		if (m_pData != NULL) {
			delete[] m_pData;
			m_pData = NULL;
		}
	}


	CBQBDVectorN(const CBQBDVectorN &v) {
		m_iDim = v.m_iDim;
		m_pData = new double[m_iDim];
		memcpy(m_pData,v.m_pData,sizeof(double)*m_iDim);
	}


	CBQBDVectorN & operator = (const CBQBDVectorN &v) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator = (const CBQBDVectorN &)\n");
		#endif
		if (m_pData != NULL)
			delete[] m_pData;
		m_iDim = v.m_iDim;
		m_pData = new double[m_iDim];
		memcpy(m_pData,v.m_pData,sizeof(double)*m_iDim);
		return *this;
	}


	CBQBDVectorN(int i, double f) {
		int z;
		m_iDim = i;
		m_pData = new double[m_iDim];
		for (z=0;z<m_iDim;z++)
			m_pData[z] = f;
	}


	explicit CBQBDVectorN(int i) {
		m_iDim = i;
		m_pData = new double[m_iDim];
	}


	void ZeroVector() {
		memset(m_pData,0,sizeof(double)*m_iDim);
	}


	int GetDim() const {
		return m_iDim;
	}


	double &GetAt(int i) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::GetAt(int): %d...",i);
		#endif
		#ifdef DEBUG_ARRAYS
			if (i >= m_iDim) {
				printf("& CBQBDVectorN::GetAt(int): Boundary Error (%d/%d).\n",i,m_iDim);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double &operator [] (int i) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator [] (int): %d\n",i);
		#endif
		#ifdef DEBUG_ARRAYS
			if ((i < 0) || (i >= m_iDim)) {
				printf("& CBQBDVectorN::operator [] (int): Boundary Error (%d/%d).\n",i,m_iDim);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double GetAt(int i) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::GetAt(int): %d...",i);
		#endif
		#ifdef DEBUG_ARRAYS
			if (i >= m_iDim) {
				printf("CBQBDVectorN::GetAt(int): Boundary Error (%d/%d).\n",i,m_iDim);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double operator [] (int i) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator [] (int): %d\n",i);
		#endif
		#ifdef DEBUG_ARRAYS
			if ((i < 0) || (i >= m_iDim)) {
				printf("CBQBDVectorN::operator [] (int): Boundary Error (%d/%d).\n",i,m_iDim);
				abort();
			}
		#endif
		return m_pData[i];
	}


	CBQBDVectorN operator + (const CBQBDVectorN &v) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator + (CBQBDVectorN&)\n");
		#endif
		if (m_iDim != v.m_iDim) {
			printf("CBQBDVectorN::operator + (CBQBDVectorN&): Dimension mismatch (%d vs %d).\n",m_iDim,v.m_iDim);
			abort();
		}
		CBQBDVectorN r(m_iDim);
		int z;
		for (z=0;z<m_iDim;z++)
			r.m_pData[z] = m_pData[z] + v.m_pData[z];
		return r;
	}


	CBQBDVectorN operator - (const CBQBDVectorN &v) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator - (CBQBDVectorN&)\n");
		#endif
		if (m_iDim != v.m_iDim) {
			printf("CBQBDVectorN::operator - (CBQBDVectorN&): Dimension mismatch (%d vs %d).\n",m_iDim,v.m_iDim);
			abort();
		}
		CBQBDVectorN r(m_iDim);
		int z;
		for (z=0;z<m_iDim;z++)
			r.m_pData[z] = m_pData[z] - v.m_pData[z];
		return r;
	}


	CBQBDVectorN operator * (double f) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator * (double)\n");
		#endif
		CBQBDVectorN r(m_iDim);
		int z;
		for (z=0;z<m_iDim;z++)
			r.m_pData[z] = m_pData[z] * f;
		return r;
	}


	CBQBDVectorN operator / (double f) const {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator / (double)\n");
		#endif
		CBQBDVectorN r(m_iDim);
		int z;
		for (z=0;z<m_iDim;z++)
			r.m_pData[z] = m_pData[z] / f;
		return r;
	}


	void operator += (const CBQBDVectorN &v) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator += (CBQBDVectorN&)\n");
		#endif
		if (m_iDim != v.m_iDim) {
			printf("CBQBDVectorN::operator += (CBQBDVectorN&): Dimension mismatch (%d vs %d).\n",m_iDim,v.m_iDim);
			abort();
		}
		int z;
		for (z=0;z<m_iDim;z++)
			m_pData[z] += v.m_pData[z];
	}


	void operator -= (const CBQBDVectorN &v) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator -= (CBQBDVectorN&)\n");
		#endif
		if (m_iDim != v.m_iDim) {
			printf("CBQBDVectorN::operator -= (CBQBDVectorN&): Dimension mismatch (%d vs %d).\n",m_iDim,v.m_iDim);
			abort();
		}
		int z;
		for (z=0;z<m_iDim;z++)
			m_pData[z] -= v.m_pData[z];
	}


	void operator *= (double f) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator *= (double)\n");
		#endif
		int z;
		for (z=0;z<m_iDim;z++)
			m_pData[z] *= f;
	}


	void operator /= (double f) {
		#ifdef DEBUG_CDVECTORN
			printf("@ CBQBDVectorN::operator /= (double)\n");
		#endif
		int z;
		for (z=0;z<m_iDim;z++)
			m_pData[z] /= f;
	}


	double GetLength() const {
		int z;
		double r=0;
		for (z=0;z<m_iDim;z++)
			r += m_pData[z]*m_pData[z];
		return sqrt(r);
	}


	double GetLengthSqr() const {
		int z;
		double r=0;
		for (z=0;z<m_iDim;z++)
			r += m_pData[z]*m_pData[z];
		return r;
	}


	void Normalize() {
		int z;
		double l;
		l = GetLength();
		for (z=0;z<m_iDim;z++)
			m_pData[z] /= l;
	}


private:
	double *m_pData;
	int m_iDim;
};


inline CBQBDVectorN operator * (double f, const CBQBDVectorN &v) {
	return v*f;
}


inline double VecDist(const CBQBDVectorN &vec1, const CBQBDVectorN &vec2) {
	return (vec1-vec2).GetLength();
}



class CBQBDMatrixMN {
public:

	CBQBDMatrixMN() {
		m_iRows = 0;
		m_iCols = 0;
		m_pData = NULL;
	}


	~CBQBDMatrixMN() {
		if (m_pData != NULL) {
			delete[] m_pData;
			m_pData = NULL;
		}
	}


	CBQBDMatrixMN(const CBQBDMatrixMN &m) {
		m_iCols = m.m_iCols;
		m_iRows = m.m_iRows;
		m_pData = new double[m_iRows*m_iCols];
		memcpy(m_pData,m.m_pData,sizeof(double)*m_iRows*m_iCols);
	}


	CBQBDMatrixMN & operator = (const CBQBDMatrixMN &m) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator = (const CBQBDMatrixMN &)\n");
		#endif
		if (m_pData != NULL)
			delete[] m_pData;
		m_iRows = m.m_iRows;
		m_iCols = m.m_iCols;
		m_pData = new double[m_iRows*m_iCols];
		memcpy(m_pData,m.m_pData,sizeof(double)*m_iRows*m_iCols);
		return *this;
	}


	CBQBDMatrixMN(int m, int n, double f) {
		int z;
		m_iRows = m;
		m_iCols = n;
		m_pData = new double[m_iRows*m_iCols];
		for (z=0;z<m_iRows*m_iCols;z++)
			m_pData[z] = f;
	}


	CBQBDMatrixMN(int m, int n) {
		m_iRows = m;
		m_iCols = n;
		m_pData = new double[m_iRows*m_iCols];
	}


	void ZeroMatrix() {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::ZeroMatrix().\n");
		#endif
		memset(m_pData,0,sizeof(double)*m_iCols*m_iRows);
	}


	int GetRows() const {
		return m_iRows;
	}


	int GetCols() const {
		return m_iCols;
	}


	double &GetAt(int i) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::GetAt(int): %d.\n",i);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows*m_iCols)) {
				printf("& CBQBDMatrixMN::GetAt(int): Boundary Error (%d/%d).\n",i,m_iRows*m_iCols);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double &GetAt(int i, int j) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::GetAt(int, int): %d, %d.\n",i,j);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows) || (j < 0) || (j >= m_iCols)) {
				printf("& CBQBDMatrixMN::GetAt(int,int): Boundary Error (%d|%d / %d|%d).\n",i,j,m_iRows,m_iCols);
				abort();
			}
		#endif
		return m_pData[i*m_iCols+j];
	}


	double &operator [] (int i) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator [] (int): %d.\n",i);
		#endif
		return GetAt(i);
	}


	double &operator () (int i, int j) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator () (int,int): %d, %d.\n",i,j);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows) || (j < 0) || (j >= m_iCols)) {
				printf("& CBQBDMatrixMN::operator () (int,int): Boundary Error (%d|%d / %d|%d).\n",i,j,m_iRows,m_iCols);
				abort();
			}
		#endif
		return m_pData[i*m_iCols+j];
	}


	double GetAt(int i) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::GetAt(int): %d.\n",i);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows*m_iCols)) {
				printf("CBQBDMatrixMN::GetAt(int): Boundary Error (%d/%d).\n",i,m_iRows*m_iCols);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double GetAt(int i, int j) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::GetAt(int,int): %d, %d.\n",i,j);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows) || (j < 0) || (j >= m_iCols)) {
				printf("CBQBDMatrixMN::GetAt(int,int): Boundary Error (%d|%d / %d|%d).\n",i,j,m_iRows,m_iCols);
				abort();
			}
		#endif
		return m_pData[i*m_iCols+j];
	}


	double operator [] (int i) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator [] (int): %d.\n",i);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows*m_iCols)) {
				printf("CBQBDMatrixMN::operator [] (int): Boundary Error (%d/%d).\n",i,m_iRows*m_iCols);
				abort();
			}
		#endif
		return m_pData[i];
	}


	double operator () (int i, int j) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator () (int,int): %d, %d.\n",i,j);
		#endif
		#ifdef BOUND_MATVEC
			if ((i < 0) || (i >= m_iRows) || (j < 0) || (j >= m_iCols)) {
				printf("CBQBDMatrixMN::operator () (int,int): Boundary Error (%d|%d / %d|%d).\n",i,j,m_iRows,m_iCols);
				abort();
			}
		#endif
		return m_pData[i*m_iCols+j];
	}


	void operator *= (double f) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator *= (double)\n");
		#endif
		int z;
		for (z=0;z<m_iRows*m_iCols;z++)
			m_pData[z] *= f;
	}


	void operator += (const CBQBDMatrixMN &m) {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator += (const CBQBDMatrixMN)\n");
		#endif
		if ((m_iCols != m.m_iCols) || (m_iRows != m.m_iRows)) {
			printf("@ CBQBDMatrixMN::operator += (CBQBDMatrixMN): Dimension mismatch (%d x %d vs %d x %d).\n",m_iCols,m_iRows,m.m_iCols,m.m_iRows);
			abort();
		}
		int z;
		for (z=0;z<m_iRows*m_iCols;z++)
			m_pData[z] += m.m_pData[z];
	}


	CBQBDMatrixMN operator * (const CBQBDMatrixMN &m) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator * (CBQBDMatrixMN)\n");
		#endif
		if (m_iCols != m.m_iRows) {
			printf("@ CBQBDMatrixMN::operator * (CBQBDMatrixMN): Dimension mismatch (%d vs %d).\n",m_iCols,m.m_iRows);
			abort();
		}
		int z1, z2, z3;
		CBQBDMatrixMN r = CBQBDMatrixMN(m_iRows,m.m_iCols);
		r.ZeroMatrix();
		for (z1=0;z1<m_iRows;z1++)
			for (z2=0;z2<m.m_iCols;z2++)
				for (z3=0;z3<m_iCols;z3++)
					r.GetAt(z1,z2) += GetAt(z1,z3) * m.GetAt(z3,z2);
		return r;
	}


	CBQBDVectorN operator * (const CBQBDVectorN &v) const {
		#ifdef DEBUG_CDMATRIXMN
			printf("@ CBQBDMatrixMN::operator * (CBQBDVector3)\n");
		#endif
		if (m_iCols != v.GetDim()) {
			printf("@ CBQBDMatrixMN::operator * (CBQBDVectorN): Dimension mismatch (%d vs %d).\n",m_iCols,v.GetDim());
			abort();
		}
		int z1, z3;
		CBQBDVectorN r = CBQBDVectorN(v.GetDim());
		r.ZeroVector();
		for (z1=0;z1<m_iRows;z1++)
			for (z3=0;z3<m_iCols;z3++)
				r.GetAt(z1) += GetAt(z1,z3) * v.GetAt(z3);
		return r;
	}


	void Unity() { 
		if (m_iCols != m_iRows) {
			printf("CBQBDMatrixMN::Unity(): Only defined for square matrices (have %dx%d).\n",m_iRows,m_iCols);
			abort();
		}
		int z;
		ZeroMatrix();
		for (z=0;z<m_iCols;z++)
			GetAt(z,z) = 1.0;
	}


	CBQBDMatrixMN Transpose() const {
		int z1, z2;
		CBQBDMatrixMN r=CBQBDMatrixMN(m_iCols,m_iRows);
		for (z1=0;z1<m_iRows;z1++)
			for (z2=0;z2<m_iCols;z2++)
				r.GetAt(z2,z1) = GetAt(z1,z2);
		return r;
	}


	void Dump(FILE *a) const;

	void DumpSmall(FILE *a) const;

private:
	double *m_pData;
	int m_iCols;
	int m_iRows;
};



#endif // Not BQB_INSIDE_TRAVIS


#endif