[53b1fd]: src / fixedCRowVector.cc  Maximize  Restore  History

Download this file

847 lines (696 with data), 22.7 kB

  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
// Fixed Point RowVector manipulations.
/*
Copyright (C) 2003 Motorola Inc
Copyright (C) 2003 David Bateman
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; see the file COPYING. If not, see
<http://www.gnu.org/licenses/>.
In addition to the terms of the GPL, you are permitted to link
this program with any Open Source program, as defined by the
Open Source Initiative (www.opensource.org)
*/
#include <iostream>
#include <octave/config.h>
#include <octave/lo-utils.h>
#include <octave/lo-error.h>
#include <octave/error.h>
#include <octave/gripes.h>
#include <octave/ops.h>
#include "fixedCMatrix.h"
#include "fixedCColVector.h"
#include "fixedCRowVector.h"
// Fixed Point Complex Row Vector class
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if (length() != ds.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if (length() != ds.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if (length() != ds.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i));
}
FixedComplexRowVector::FixedComplexRowVector (unsigned int is,
unsigned int ds, const FixedComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (Complex is,
Complex ds, const FixedComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds, const FixedComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds, const FixedComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds, const FixedComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i), a(i));
}
FixedComplexRowVector::FixedComplexRowVector (unsigned int is,
unsigned int ds, const FixedRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (Complex is,
Complex ds, const FixedRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, FixedPointComplex(a(i)));
}
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds, const FixedRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds, const FixedRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds, const FixedRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i), FixedPointComplex(a(i)));
}
FixedComplexRowVector::FixedComplexRowVector (unsigned int is,
unsigned int ds, const ComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (Complex is,
Complex ds, const ComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds, const ComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds, const ComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds, const ComplexRowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i), a(i));
}
FixedComplexRowVector::FixedComplexRowVector (unsigned int is,
unsigned int ds, const RowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (Complex is,
Complex ds, const RowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds, const RowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds, const RowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds, const RowVector& a) :
MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i), a(i));
}
FixedComplexRowVector::FixedComplexRowVector (unsigned int is,
unsigned int ds, const ComplexRowVector& a,
const ComplexRowVector& b) : MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
if (length() != b.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i), b(i));
}
FixedComplexRowVector::FixedComplexRowVector (Complex is,
Complex ds, const ComplexRowVector& a, const ComplexRowVector& b) :
MArray<FixedPointComplex> (dim_vector (1, a.length()))
{
if (length() != b.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is, ds, a(i), b(i));
}
FixedComplexRowVector::FixedComplexRowVector (const MArray<int> &is,
const MArray<int> &ds, const ComplexRowVector& a,
const ComplexRowVector& b) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length()) ||
(length() != b.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i), b(i));
}
FixedComplexRowVector::FixedComplexRowVector (const RowVector &is,
const RowVector &ds, const ComplexRowVector& a,
const ComplexRowVector& b) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length()) ||
(length() != b.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex((unsigned int)is(i), (unsigned int)ds(i),
a(i), b(i));
}
FixedComplexRowVector::FixedComplexRowVector (const ComplexRowVector &is,
const ComplexRowVector &ds, const ComplexRowVector& a,
const ComplexRowVector& b) : MArray<FixedPointComplex> (dim_vector (1, is.length()))
{
if ((length() != ds.length()) || (length() != a.length()) ||
(length() != b.length())) {
(*current_liboctave_error_handler) ("vector size mismatch");
return;
}
for (int i = 0; i < length (); i++)
elem (i) = FixedPointComplex(is(i), ds(i), a(i), b(i));
}
#define GET_FIXED_PROP(METHOD) \
ComplexRowVector \
FixedComplexRowVector:: METHOD (void) const \
{ \
int len = length(); \
ComplexRowVector retval(len); \
for (int i = 0; i < len; i++) \
retval(i) = elem(i) . METHOD (); \
return retval; \
} \
GET_FIXED_PROP(sign);
GET_FIXED_PROP(getdecsize);
GET_FIXED_PROP(getintsize);
GET_FIXED_PROP(getnumber);
GET_FIXED_PROP(fixedpoint);
#undef GET_FIXED_PROP
FixedComplexRowVector
FixedComplexRowVector::chdecsize (const Complex n)
{
int len = length();
FixedComplexRowVector retval(len);
for (int i = 0; i < len; i++)
retval(i) = FixedPointComplex(elem(i).getintsize(), n, elem(i));
return retval;
}
FixedComplexRowVector
FixedComplexRowVector::chdecsize (const ComplexRowVector &n)
{
int len = length();
if (len != n.length()) {
(*current_liboctave_error_handler) ("vector size mismatch in chdecsize");
return FixedComplexRowVector();
}
FixedComplexRowVector retval(len);
for (int i = 0; i < len; i++)
retval(i) = FixedPointComplex(elem(i).getintsize(), n(i), elem(i));
return retval;
}
FixedComplexRowVector
FixedComplexRowVector::chintsize (const Complex n)
{
int len = length();
FixedComplexRowVector retval(len);
for (int i = 0; i < len; i++)
retval(i) = FixedPointComplex(n, elem(i).getdecsize(), elem(i));
return retval;
}
FixedComplexRowVector
FixedComplexRowVector::chintsize (const ComplexRowVector &n)
{
int len = length();
if (len != n.length()) {
(*current_liboctave_error_handler) ("vector size mismatch in chdecsize");
return FixedComplexRowVector();
}
FixedComplexRowVector retval(len);
for (int i = 0; i < len; i++)
retval(i) = FixedPointComplex(n(i), elem(i).getdecsize(), elem(i));
return retval;
}
FixedComplexRowVector
FixedComplexRowVector::incdecsize (const Complex n) {
return chdecsize(n + getdecsize());
}
FixedComplexRowVector
FixedComplexRowVector::incdecsize (const ComplexRowVector &n) {
if (n.length() != length()) {
(*current_liboctave_error_handler) ("vector size mismatch in incdecsize");
return FixedComplexRowVector();
}
return chdecsize(n + getdecsize());
}
FixedComplexRowVector
FixedComplexRowVector::incdecsize () {
return chdecsize(Complex (1) + getdecsize());
}
FixedComplexRowVector
FixedComplexRowVector::incintsize (const Complex n) {
return chintsize(n + getintsize());
}
FixedComplexRowVector
FixedComplexRowVector::incintsize (const ComplexRowVector &n) {
if (n.length() != length()) {
(*current_liboctave_error_handler) ("vector size mismatch in incintsize");
return FixedComplexRowVector();
}
return chintsize(n + getintsize());
}
FixedComplexRowVector
FixedComplexRowVector::incintsize () {
return chintsize(Complex (1) + getintsize());
}
// Fixed Point Complex Row Vector class.
bool
FixedComplexRowVector::operator == (const FixedComplexRowVector& a) const
{
int len = length ();
if (len != a.length ())
return 0;
for (int i = 0; i < len; i++)
if (elem(i) != a.elem(i))
return false;
return true;
}
bool
FixedComplexRowVector::operator != (const FixedComplexRowVector& a) const
{
return !(*this == a);
}
FixedComplexRowVector&
FixedComplexRowVector::insert (const FixedComplexRowVector& a, int c)
{
int a_len = a.length ();
if (c < 0 || c + a_len > length ())
{
(*current_liboctave_error_handler) ("range error for insert");
return *this;
}
if (a_len > 0)
{
make_unique ();
for (int i = 0; i < a_len; i++)
xelem (c+i) = a.elem (i);
}
return *this;
}
FixedComplexRowVector&
FixedComplexRowVector::fill (FixedPointComplex val)
{
int len = length ();
if (len > 0)
{
make_unique ();
for (int i = 0; i < len; i++)
xelem (i) = val;
}
return *this;
}
FixedComplexRowVector&
FixedComplexRowVector::fill (FixedPointComplex val, int c1, int c2)
{
int len = length ();
if (c1 < 0 || c2 < 0 || c1 >= len || c2 >= len)
{
(*current_liboctave_error_handler) ("range error for fill");
return *this;
}
if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; }
if (c2 >= c1)
{
make_unique ();
for (int i = c1; i <= c2; i++)
xelem (i) = val;
}
return *this;
}
FixedComplexRowVector
FixedComplexRowVector::append (const FixedComplexRowVector& a) const
{
int len = length ();
int nc_insert = len;
FixedComplexRowVector retval (len + a.length ());
retval.insert (*this, 0);
retval.insert (a, nc_insert);
return retval;
}
FixedComplexColumnVector
FixedComplexRowVector::transpose (void) const
{
return FixedComplexColumnVector (*this);
}
FixedComplexRowVector
FixedComplexRowVector::extract (int c1, int c2) const
{
if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; }
int new_c = c2 - c1 + 1;
FixedComplexRowVector result (new_c);
for (int i = 0; i < new_c; i++)
result.xelem (i) = elem (c1+i);
return result;
}
FixedComplexRowVector
FixedComplexRowVector::extract_n (int r1, int n) const
{
FixedComplexRowVector result (n);
for (int i = 0; i < n; i++)
result.xelem (i) = elem (r1+i);
return result;
}
// row vector by matrix -> row vector
FixedComplexRowVector
operator * (const FixedComplexRowVector& v, const FixedComplexMatrix& a)
{
FixedComplexRowVector retval;
int len = v.length ();
int a_nr = a.rows ();
int a_nc = a.cols ();
if (a_nr != len)
gripe_nonconformant ("operator *", 1, len, a_nr, a_nc);
else
{
int a_nr = a.rows ();
int a_nc = a.cols ();
retval.resize (a_nc, FixedPointComplex());
if (len != 0)
for (int i = 0; i < a_nc; i++)
for (int j = 0; j < a_nr; j++)
retval.elem (i) += v.elem(j) * a.elem(j,i);
}
return retval;
}
// other operations
FixedComplexRowVector
FixedComplexRowVector::map (fpc_fpc_Mapper f) const
{
FixedComplexRowVector b (*this);
return b.apply (f);
}
FixedComplexRowVector&
FixedComplexRowVector::apply (fpc_fpc_Mapper f)
{
FixedPointComplex *d = fortran_vec (); // Ensures only one reference to my privates!
for (int i = 0; i < length (); i++)
d[i] = f (d[i]);
return *this;
}
FixedPointComplex
FixedComplexRowVector::min (void) const
{
int len = length ();
if (len == 0)
return FixedPointComplex();
FixedPointComplex res = elem (0);
double res_val = std::abs(res.fixedpoint ());
for (int i = 1; i < len; i++)
if (std::abs(elem (i) .fixedpoint ()) < res_val) {
res = elem (i);
res_val = std::abs(res.fixedpoint ());
}
return res;
}
FixedPointComplex
FixedComplexRowVector::max (void) const
{
int len = length ();
if (len == 0)
return FixedPointComplex();
FixedPointComplex res = elem (0);
double res_val = std::abs(res.fixedpoint ());
for (int i = 1; i < len; i++)
if (std::abs(elem (i) .fixedpoint ()) > res_val) {
res = elem (i);
res_val = std::abs(res.fixedpoint ());
}
return res;
}
#define DO_FIXED_VEC_FUNC(FUNC, MT) \
MT FUNC (const FixedComplexRowVector& x) \
{ \
MT retval (x.length()); \
for (int i = 0; i < x.length(); i++) \
retval(i) = FUNC ( x (i) ); \
return retval; \
}
DO_FIXED_VEC_FUNC(real, FixedRowVector);
DO_FIXED_VEC_FUNC(imag, FixedRowVector);
DO_FIXED_VEC_FUNC(conj, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(abs, FixedRowVector);
DO_FIXED_VEC_FUNC(norm, FixedRowVector);
DO_FIXED_VEC_FUNC(arg, FixedRowVector);
DO_FIXED_VEC_FUNC(cos, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(cosh, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(sin, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(sinh, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(tan, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(tanh, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(sqrt, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(exp, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(log, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(log10, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(round, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(rint, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(floor, FixedComplexRowVector);
DO_FIXED_VEC_FUNC(ceil, FixedComplexRowVector);
FixedComplexRowVector polar (const FixedRowVector &r,
const FixedRowVector &p)
{
if (r.length() != p.length()) {
(*current_liboctave_error_handler) ("vector size mismatch");
return FixedComplexRowVector();
}
FixedComplexRowVector retval ( r.length());
for (int i = 0; i < r.length(); i++)
retval(i) = polar ( r (i), p (i) );
return retval;
}
FixedComplexRowVector elem_pow (const FixedComplexRowVector &a,
const FixedComplexRowVector &b)
{
FixedComplexRowVector retval;
int a_len = a.length ();
int b_len = b.length ();
if (a_len == 1)
{
retval.resize(b_len);
FixedPointComplex ad = a(0);
for (int i = 0; i < b_len; i++)
retval(i) = pow(ad, b(i));
}
else if (b_len == 1)
{
retval.resize(a_len);
FixedPointComplex bd = b(0);
for (int i = 0; i < a_len; i++)
retval(i) = pow(a(i), bd);
}
else if (a_len == b_len)
{
retval.resize(a_len);
for (int i = 0; i < a_len; i++)
retval(i) = pow(a(i), b(i));
}
else
gripe_nonconformant ("operator .^", a_len, b_len);
return retval;
}
FixedComplexRowVector elem_pow (const FixedComplexRowVector &a, const FixedPointComplex &b)
{
return elem_pow (a, FixedComplexRowVector(1, b));
}
FixedComplexRowVector elem_pow (const FixedPointComplex &a, const FixedComplexRowVector &b)
{
return elem_pow (FixedComplexRowVector(1, a), b);
}
std::ostream&
operator << (std::ostream& os, const FixedComplexRowVector& a)
{
for (int i = 0; i < a.length (); i++)
os << " " << a.elem (i);
return os;
}
std::istream&
operator >> (std::istream& is, FixedComplexRowVector& a)
{
int len = a.length();
if (len < 1)
is.clear (std::ios::badbit);
else
{
FixedPointComplex tmp;
for (int i = 0; i < len; i++)
{
is >> tmp;
if (is)
a.elem (i) = tmp;
else
break;
}
}
return is;
}
// row vector by column vector -> scalar
FixedPointComplex
operator * (const FixedComplexRowVector& v, const FixedComplexColumnVector& a)
{
FixedPointComplex retval;
int len = v.length ();
int a_len = a.length ();
if (len != a_len)
gripe_nonconformant ("operator *", len, a_len);
else if (len != 0)
for (int i = 0; i < len; i++)
retval += v.elem(i) * a.elem(i);
return retval;
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:





No, thanks