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
|
# -*- coding: utf-8 -*-
=begin
= NArrayMiss Class
NArrayMiss is a additional class processing of missing value with to
((<NArray|URL:http://www.ruby-lang.org/en/raa-list.rhtml?name=NArray>))
for Ruby.
To use NArrayMiss class, you need invoking "require 'narray_miss.rb'" in your script.
== Index
* ((<Class Constants>))
* ((<Class Methods>))
* ((<Class Instance Methods>))
* ((<NArrayMiss information>))
* ((<Slicing Array>))
* ((<Filling values>))
* ((<Arithmetic operator>))
* ((<Bitwise operator|Bitwise operator (only for byte, sint and int)>))
* ((<Comparison>))
* ((<Statistics>))
* ((<Sort>))
* ((<Transpose>))
* ((<Changing Shapes of indices>))
* ((<Type conversion>))
* ((<Iteration>))
* ((<Boolean and mask related|Boolean and mask related (only for byte, sint and int)>))
* ((<Complex compound number|Complex compound number (only for scomplex and complex)>))
* ((<Byte swap>))
* ((<Mask and missing value>))
* ((<Others>))
=end
case ENV["NARRAY_TYPE"]
when "narray"
require 'narray'
NARRAY = NArray
when "numru-narray"
require 'numru/narray'
NARRAY = NumRu::NArray
when nil
if defined?(NumRu::NArray)
NARRAY = NumRu::NArray
elsif defined?(NArray)
NARRAY = NArray
else
begin
require 'narray'
NARRAY = NArray
rescue LoadError
err = $!
begin
require 'numru/narray'
NARRAY = NumRu::NArray
rescue LoadError
STDERR.puts "You should install numru-narray or narray"
raise err
end
end
end
else
raise "NARRAY_TYPE (#{ENV["NARRAY_TYPE"]}) is invalid"
end
class NArrayMiss
=begin
== Class Constants
--- NArrayMiss::BYTE
type code for 1 byte unsigned integer.
--- NArrayMiss::SINT
type code for 2 byte signed integer.
--- NArrayMiss::LINT
type code for 4 byte signed integer.
--- NArrayMiss::SFLOAT
type code for single precision float.
--- NArrayMiss::FLOAT
type code for double precision float.
--- NArrayMiss::SCOMPLEX
type code for single precision complex.
--- NArrayMiss::COMPLEX
type code for double precision complex.
--- NArrayMiss::OBJECT
type code for Ruby object.
go back to ((<Index>))
=end
BYTE = NARRAY::BYTE
SINT = NARRAY::SINT
INT = NARRAY::INT
LINT = NARRAY::LINT
if NARRAY.const_defined?(:LLINT)
LLINT = NARRAY::LINT
MINT = LLINT # int for mask operations
@@llint = true
else
MINT = LINT # int for mask operations
@@llint = false
end
SFLOAT = NARRAY::SFLOAT
FLOAT = NARRAY::FLOAT
SCOMPLEX = NARRAY::SCOMPLEX
COMPLEX = NARRAY::COMPLEX
OBJECT = NARRAY::OBJECT
class << self
alias :__new__ :new
private :__new__
end
def initialize(array, mask)
if array.shape!=mask.shape
raise "array and mask must have the same shape"
end
@array = array
@mask = mask
end
private :initialize
=begin
== Class Methods
--- NArrayMiss.new(typecode, size, ...)
create (({NArrayMiss})) of ((|typecode|)).
All elements are initialized with 0.
--- NArrayMiss.byte(size, ...)
same as NArrayMiss.new(NArrayMiss::BYTE, ((|size|)), ...).
--- NArrayMiss.sint(size, ...)
same as NArrayMiss.new(NArrayMiss::SINT, ((|size|)), ...).
--- NArrayMiss.int(size, ...)
same as NArrayMiss.new(NArrayMiss::LINT, ((|size|)), ...).
--- NArrayMiss.sfloat(size, ...)
same as NArrayMiss.new(NArrayMiss::SFLOAT, ((|size|)), ...).
--- NArrayMiss.float(size, ...)
same as NArrayMiss.new(NArrayMiss::FLOAT, ((|size|)), ...).
--- NArrayMiss.scomplex(size, ...)
same as NArrayMiss.new(NArrayMiss::SCOMPLEX, ((|size|)), ...).
--- NArrayMiss.complex(size, ...)
same as NArrayMiss.new(NArrayMiss::COMPLEX, ((|size|)), ...).
--- NArrayMiss.object(size, ...)
same as NArrayMiss.new(NArrayMiss::OBJECT, ((|size|)), ...).
--- NArrayMiss[](value, ...)
create (({NArrayMiss})) form [((|value|)), ...].
--- NArrayMiss.to_nam(array [,mask])
create (({NArrayMiss})) from ((|array|)).
((|array|)) must be (({Numeric})) (({Array})) or (({NArray})).
--- NArrayMiss.to_nam_no_dup(array [,mask])
convert from ((|array|)) to (({NArrayMiss})).
go back to ((<Index>))
=end
def self.new(*arg)
array = NARRAY.new(*arg)
mask = NARRAY.byte(*arg[1..-1])
__new__(array, mask)
end
def self.byte(*arg)
NArrayMiss.new(BYTE,*arg)
end
def self.sint(*arg)
NArrayMiss.new(SINT,*arg)
end
def self.int(*arg)
NArrayMiss.new(INT,*arg)
end
def self.lint(*arg)
NArrayMiss.new(LINT,*arg)
end
if @@llint
def self.llint(*arg)
NArrayMiss.new(LLINT,*arg)
end
end
def self.sfloat(*arg)
NArrayMiss.new(SFLOAT,*arg)
end
def self.float(*arg)
NArrayMiss.new(FLOAT,*arg)
end
def self.scomplex(*arg)
NArrayMiss.new(SCOMPLEX,*arg)
end
def self.complex(*arg)
NArrayMiss.new(COMPLEX,*arg)
end
def self.object(*arg)
NArrayMiss.new(OBJECT,*arg)
end
def self.[](*arg)
NArrayMiss.to_nam(NARRAY[*arg])
end
def self.to_nam_no_dup(*arg)
if arg.length > 2 || arg.length==0 then
raise("NArrayMiss.to_nar( array [,mask]] )")
end
array = arg[0]
if Numeric===array then array = NARRAY[array] end
if Array===array then array = NARRAY.to_na(array) end
unless array.is_a?(NARRAY) || /NArray/=~ array.class.to_s then
raise("argument must be Numeric, NArray or Array")
end
if arg.length==2 then
mask = arg[1]
if Numeric===mask then mask = array.ne(mask) end
if Array===mask then
mask = array.class.to_na(mask).ne(0)
end
if mask.class == FalseClass then
mask = array.class.byte(*array.shape)
end
if mask.class == TrueClass then
mask = array.class.byte(*array.shape).fill(1)
end
if !(array.class===mask && mask.typecode==BYTE) then
raise("mask must be Numeric, Array, true, false or NArray(byte)")
end
if mask.length!=array.length
raise "mask.length must be same as array.length"
end
else
mask = array.class.byte(*array.shape).fill(1)
end
__new__(array,mask)
end
def self.to_nam(*arg)
arg[0] = arg[0].dup if !(Numeric===arg[0])
if arg.length==2 && !(Numeric===arg[1]) && arg[1].class!=TrueClass && arg[1].class!=FalseClass then
arg[1] = arg[1].dup
end
NArrayMiss.to_nam_no_dup(*arg)
end
=begin
== Class Instance Methods
=end
=begin
=== NArrayMiss information
--- NArrayMiss#dim
return the dimension which is the number of indices.
--- NArrayMiss#rank
same as (({NArrayMiss#dim})).
--- NArrayMiss#shape
return the (({Array})) of sizes of each index.
--- NArrayMiss#size
return the number of total elements.
--- NArrayMiss#total
alias to size
--- NArrayMiss#length
alias to size
--- NArrayMiss#rank_total
return the number of total of the shape.
--- NArrayMiss#typecode
return the typecode.
=end
def dim
@array.dim
end
def rank
@array.rank
end
def shape
@array.shape
end
def size
@array.size
end
alias :total :size
alias :length :size
def rank_total(*arg)
@array.rank_total(*arg)
end
def typecode
@array.typecode
end
=begin
=== Slicing Array
--- NArrayMiss#[](index)
return the value at [((|index|))].
((|index|)) must be (({Integer, Range, Array, true})).
Index order is FORTRAN type.
--- NArrayMiss#slice(index)
same as (({NArrayMiss#[]})) but keeps the rank of original array by not elimiting dimensions whose length became equal to 1 (which (({NArrayMiss#[]})) dose).
This is not the case with the 1-dimensional indexing and masking.
--- NArrayMiss#set_without_validation(index,value)
replace elements at ((|index|)) by ((|value|)).
--- NArrayMiss#[]=(index, value)
replace elements at ((|index|)) by ((|value|)) and
make replaced elements valid.
=end
def [](*arg)
if arg[0].class == NArrayMiss && arg[0].typecode == BYTE
obj = @array[arg[0].to_na(0)]
if Numeric===obj
return obj
else
return NArrayMiss.to_nam_no_dup(obj)
end
else
obj = @array[*arg]
if Numeric===obj
return obj
else
return NArrayMiss.to_nam_no_dup(obj,@mask[*arg])
end
end
end
def slice(*arg)
NArrayMiss.to_nam_no_dup(@array.slice(*arg),@mask.slice(*arg))
end
def set_without_validation(*arg)
if arg.length==1 then
if !arg[0] then
@mask[] = 0
elsif arg[0].class == NArrayMiss then
@array[] = arg[0].get_array!
@mask[] = arg[0].get_mask!
else
@array[] = arg[0]
end
else
if !arg[-1] then
@mask[*arg[0..-2]] = 0
elsif arg[-1].class == NArrayMiss then
@array[*arg[0..-2]] = arg[-1].get_array!
@mask[*arg[0..-2]] = arg[-1].get_mask!
else
@array[*arg[0..-2]] = arg[-1]
end
end
return self
end
def []=(*arg)
if arg.length == 2 && arg[0].class == NArrayMiss && arg[0].typecode == BYTE
idx = arg[0].to_na(0)
self.set_without_validation(idx,arg[-1])
if arg[-1].class != NArrayMiss && arg[-1] then
@mask[idx] = 1
end
else
self.set_without_validation(*arg)
if arg[-1].class != NArrayMiss && arg[-1] then
if arg.length==1 then
@mask=1
else
@mask[*arg[0..-2]] = 1
end
end
end
return self
end
=begin
=== Filling values
--- NArrayMiss#indgen!([start[,step]])
set values from ((|start|)) with ((|step|)) increment.
--- NArrayMiss#indgen([start[,step]])
same as (({NArrayMiss#indgen!})) but create new object.
--- NArrayMiss#fill!(value)
fill elements with ((|value|)).
--- NArrayMiss#fill(value)
same as (({NArrayMiss#fill!})) but create new object.
--- NArrayMiss#random!(max)
set random values between 0<=x<((|max|)).
--- NArrayMiss#random(max)
same as (({NArrayMiss#random!})) but create new object.
--- NArrayMiss#randomn(max)
set normally distributed random values with mean=0, dispersion=1 (Box-Muller)
=end
for operator in ["indgen","fill","random","randomn"]
eval(<<-EOL,nil,__FILE__,__LINE__+1)
def #{operator}(*arg)
obj = self.dup
obj.#{operator}!(*arg)
obj
end
def #{operator}!(*arg)
@array = @array.#{operator}!(*arg)
@mask[true] = 1
self
end
EOL
end
=begin
=== Arithmetic operator
--- NArrayMiss#-@
--- NArrayMiss#+(other)
--- NArrayMiss#-(other)
--- NArrayMiss#*(other)
--- NArrayMiss#/(other)
--- NArrayMiss#%(other)
--- NArrayMiss#**(other)
--- NArrayMiss#abs
--- NArrayMiss#add!(other)
--- NArrayMiss#sbt!(other)
--- NArrayMiss#mul!(other)
--- NArrayMiss#div!(other)
--- NArrayMiss#mod!(other)
--- NArrayMiss#mul_add(other, dim, ...)
=end
def -@
array = @array.dup
array[@mask] = -@array[@mask]
NArrayMiss.to_nam_no_dup(array, @mask.dup)
end
def +(arg)
binary_operation(arg, 0){|t1, t2| t1 + t2}
end
def -(arg)
binary_operation(arg, 0){|t1, t2| t1 - t2}
end
def *(arg)
binary_operation(arg, 1){|t1, t2| t1 * t2}
end
def /(arg)
binary_operation(arg, 1){|t1, t2| t1 / t2}
end
def %(arg)
binary_operation(arg, 1){|t1, t2| t1 % t2}
end
def **(arg)
binary_operation(arg, 1){|t1, t2| t1 ** t2}
end
def abs
array = @array.dup
array[@mask] = @array[@mask].abs
NArrayMiss.to_nam_no_dup(array, @mask.dup)
end
def add!(arg)
binary_operation(arg, 0){|t1, t2| t1.add!(t2)}
end
def sbt!(arg)
binary_operation(arg, 0){|t1, t2| t1.sbt!(t2)}
end
def mul!(arg)
binary_operation(arg, 1){|t1, t2| t1.mul!(t2)}
end
def div!(arg)
binary_operation(arg, 1){|t1, t2| t1.div!(t2)}
end
def mod!(arg)
binary_operation(arg, 1){|t1, t2| t1.mod!(t2)}
end
def mul_add(*arg)
if arg.length==1 then
return (self*arg[0]).sum
else
return (self*arg[0]).sum(*arg[1..-1])
end
end
=begin
=== Bitwise operator (only for byte, sint and int)
--- NArrayMiss#~@
--- NArrayMiss#&(other)
--- NArrayMiss#|(other)
--- NArrayMiss#^(other)
=end
def ~@
NArrayMiss.to_nam_to_dup(~@array, @mask.dup)
end
def &(arg)
binary_operation(arg, 1){|t1, t2| t1 & t2}
end
def |(arg)
binary_operation(arg, 0){|t1, t2| t1 | t2}
end
def ^(arg)
binary_operation(arg, 1){|t1, t2| t1 ^ t2}
end
=begin
=== Comparison
--- NArrayMiss#eq(other)
--- NArrayMiss#ne(other)
--- NArrayMiss#gt(other)
--- NArrayMiss#ge(other)
--- NArrayMiss#lt(other)
--- NArrayMiss#le(other)
--- NArrayMiss#>(other)
--- NArrayMiss#>=(other)
--- NArrayMiss#<(other)
--- NArrayMiss#<=(other)
--- NArrayMiss#and(other)
--- NArrayMiss#or(other)
--- NArrayMiss#xor(other)
--- NArrayMiss#not(other)
=end
def eq(arg)
binary_operation(arg, 0){|t1, t2| t1.eq t2}
end
def ne(arg)
binary_operation(arg, 0){|t1, t2| t1.ne t2}
end
def gt(arg)
binary_operation(arg, 0){|t1, t2| t1.gt t2}
end
def ge(arg)
binary_operation(arg, 0){|t1, t2| t1.ge t2}
end
def lt(arg)
binary_operation(arg, 0){|t1, t2| t1.lt t2}
end
def le(arg)
binary_operation(arg, 0){|t1, t2| t1.le t2}
end
def and(arg)
binary_operation(arg, 1){|t1, t2| t1.and t2}
end
def or(arg)
binary_operation(arg, 0){|t1, t2| t1.or t2}
end
def xor(arg)
binary_operation(arg, 1){|t1, t2| t1.xor t2}
end
def not
NArrayMiss.to_nam_no_dup(@array.not, @mask.dup)
end
def ==(arg)
if arg.kind_of?(NArrayMiss) then
@mask==arg.get_mask! && @array[@mask]==arg.get_array![@mask]
else
false
end
end
=begin
=== Statistics
--- NArrayMiss#sum(dim, ... ["min_count"=>i])
return summation of elements in specified dimensions.
Elements at which the number of elements for summation is less than ((|i|)) is invalid.
--- NArrayMiss#accum(dim, ...)
same as (({NArrayMiss#sum})) but not elimiting dimensions whose length became equal to 1.
--- NArrayMiss#min(dim, ...)
return minimum in specified dimensions.
Elements at which the number of valid elements in the dimension is less than ((|i|)) is invalid.
--- NArrayMiss#max(dim, ...)
return maximum in specified dimensions.
Elements at which the number of valid elements in the dimension is less than ((|i|)) is invalid.
--- NArrayMiss#median(dim, ...)
return median in specified dimensions.
Elements at which the number of valid elements in the dimension is less than ((|i|)) is invalid.
--- NArrayMiss#mean(dim, ...)
return mean of elements in specified dimensions.
Elements at which the number of elements for then mean is less than ((|i|)) is invalid.
--- NArrayMiss#stddev(dim, ...)
return standard deviation of elements in specified dimensions.
Elements at which the number of elements for calculation the standard deviation is less than ((|i|)) is invalid.
--- NArrayMiss#rms(dim, ...)
return root mean square of elements in specified dimensions.
Elements at which the number of elements for calculation the RMS is less than ((|i|)) is invalid.
--- NArrayMiss#rmsdev(dim, ...)
return root mean square deviation of elements in specified dimensions.
Elements at which the number of elements for calculation the RMS deviation is less than ((|i|)) is invalid.
=end
def accum(*arg)
if @mask.count_true == 0 then
return nil
else
array = @array.dup
array[@mask.not] = 0
return NArrayMiss.to_nam_no_dup(array.accum(*arg),
@mask.to_type(MINT).accum(*arg).ne(0))
end
end
def sum(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 欠損値に 0 を入れて普通に sum する
ary0 = @array.dup
ary0[@mask.not] = 0
NArrayMiss.reduction(@mask, rank, min_count, dims, false, typecode) do
ary0.sum(*dims)
end
end
def min(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 欠損値に最大値を入れて普通に min する
# byte,sint,int,sfloat,float の MAX の値を入れるように変更すべき
ary0 = @array.dup
ary0[@mask.not] = @array.max
NArrayMiss.reduction(@mask, rank, min_count, dims, false, typecode) do
ary0.min(*dims)
end
end
def max(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 欠損値に最小値を入れて普通に max する
# byte,sint,int,sfloat,float の MIN の値を入れるように変更すべき
ary0 = @array.dup
ary0[@mask.not] = @array.min
NArrayMiss.reduction(@mask, rank, min_count, dims, false, typecode) do
ary0.max(*dims)
end
end
def mean(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 整数型の場合は浮動小数型へ変換
ary0 = self.integer? ? self.to_type(@array.class.const_get(:DFLOAT)) : self
NArrayMiss.reduction(@mask, rank, min_count, dims, true, typecode) do |count_sum, count_accum|
ary0.sum(*dims)/count_sum
end
end
def stddev(*dims)
min_count = NArrayMiss.check_options(dims, 2)
# 整数型の場合は浮動小数型へ変換
ary0 = self.integer? ? self.to_type(@array.class.const_get(:DFLOAT)) : self
NArrayMiss.reduction(@mask, rank, min_count, dims, true, typecode) do |count_sum, count_accum|
ary0 = ary0 - ary0.accum(*dims)/count_accum
ary0 = ary0.abs if ary0.complex?
ary0 = (ary0**2).sum(*dims) / (count_sum-1)
NMMath.sqrt(ary0)
end
end
def rms(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 整数型の場合は浮動小数型へ変換
ary0 = self.integer? ? self.to_type(@array.class.const_get(:DFLOAT)) : self
NArrayMiss.reduction(@mask, rank, min_count, dims, true, typecode) do |count_sum, count_accum|
ary0 = ary0.abs if ary0.complex?
ary0 = (ary0**2).sum(*dims) / count_sum
NMMath.sqrt(ary0)
end
end
def rmsdev(*dims)
min_count = NArrayMiss.check_options(dims, 1)
# 整数型の場合は浮動小数型へ変換
ary0 = self.integer? ? self.to_type(@array.class.const_get(:DFLOAT)) : self
NArrayMiss.reduction(@mask, rank, min_count, dims, true, typecode) do |count_sum, count_accum|
ary0 = ary0 - ary0.accum(*dims)/count_accum
ary0 = ary0.abs if ary0.complex?
ary0 = (ary0**2).sum(*dims) / count_sum
NMMath.sqrt(ary0)
end
end
def median(*arg)
if arg.length==0 then
return @array[@mask].median
else
nshape = @array.class.to_na(@array.shape)
nshape[arg]=1
nslice = nshape[nshape.ne(1).where]
index = @array.class.object(@mask.rank)
index[nshape.eq(1).where] = true
obj = NArrayMiss.new(@array.typecode,*nslice.to_a)
total = 1
nslice.each{|n| total *= n}
for i in 0...total
index[nshape.ne(1).where] = pos(i,nslice)
mask = @array.class.byte(*@array.shape).fill(0)
mask[*index] = 1
mask = @mask&mask
if mask.count_true != 0 then
obj[*pos(i,nslice)] = @array[mask].median
end
end
return obj
end
end
=begin
=== Sort
--- NArrayMiss#sort(dim)
sort in the 0..((|dim|)) (All dimensions if omitted)
--- NArrayMiss#sort_index(dim)
return index of sort result.
=end
for operator in ["sort","sort_index"]
eval(<<-EOL,nil,__FILE__,__LINE__+1)
def #{operator}(*arg)
obj=NArrayMiss.new(@array.typecode,*@array.shape)
if arg.length==0 then
obj[@mask] = @array[@mask].#{operator}
return obj
else
nshape = @array.class.to_na(@array.shape)
nshape[arg]=1
nslice = nshape[nshape.ne(1).where]
index = @array.class.object(@mask.rank)
index[nshape.eq(1).where] = true
obj = NArrayMiss.new(@array.typecode,*@array.shape)
total = 1
nslice.each{|n| total *= n}
for i in 0...total
index[nshape.ne(1).where] = pos(i,nslice)
mask = @array.class.byte(*@array.shape).fill(0)
mask[*index] = 1
mask = @mask&mask
if mask.count_true != 0 then
obj[mask] = @array[mask].#{operator}
end
end
return obj
end
end
EOL
end
=begin
=== Transpose
--- NArrayMiss#transpose(dim0, dim1, ...)
transpose array. The 0-th dimension goes to the ((|dim0|))-th dimension of new array.
=end
def transpose(*arg)
obj = self.dup
shape = arg.collect{|i| obj.shape[i]}
obj.reshape!(*shape)
obj.set_without_validation( @array.transpose(*arg) )
obj.set_mask(@mask.transpose(*arg))
obj
end
=begin
=== Changing Shapes of indices
--- NArrayMiss#reshape!(size, ...)
change shape of array.
--- NArrayMiss#reshape(size, ...)
same as (({NArrayMiss#reshape!})) but create new object.
--- NArrayMiss#shape=(size, ...)
same as (({NArrayMiss#reshape!})).
--- NArrayMiss#newdim!(dim)
insert new dimension with size=1
--- NArrayMiss#newdim(dim)
same as (({NArrayMiss#newdim!})) but create new object.
--- NArrayMiss#rewrank!(dim)
same as (({NArrayMiss#newdim!})).
--- NArrayMiss#rewrank=(dim)
same as (({NArrayMiss#newdim!})).
=end
def reshape!(*arg)
@array = @array.reshape!(*arg)
@mask = @mask.reshape!(*arg)
self
end
def reshape(*arg)
obj = self.dup
obj.reshape!(*arg)
end
alias :shape= :reshape!
def newdim!(*arg)
@array = @array.newdim!(*arg)
@mask = @mask.newdim!(*arg)
self
end
alias :rewrank! :newdim!
alias :rewrank= :newdim!
def newdim(*arg)
obj = self.dup
obj.newdim!(*arg)
end
alias :rewrank :newdim
=begin
=== Type conversion
--- NArrayMiss#floor
return (({NArrayMiss})) of integer whose elements processed (({floor})).
--- NArrayMiss#ceil
return (({NArrayMiss})) of integer whose elements processed (({ceil})).
--- NArrayMiss#round
return (({NArrayMiss})) of integer whose elements processed (({round})).
--- NArrayMiss#to_i
return (({NArrayMiss})) of integer whose elements processed (({to_i})).
--- NArrayMiss#to_f
return (({NArrayMiss})) of float whose elements processed (({to_f})).
--- NArrayMiss#to_type(typecode)
return (({NArrayMiss})) of ((|typecode|)).
--- NArrayMiss#to_a
convert (({NArrayMiss})) to (({Array})).
--- NArrayMiss#to_na!([missing_value])
convert (({NArrayMiss})) to (({NArray})).
if there is argument, set missing_value for invalid elements.
--- NArrayMiss#to_na([missing_value])
convert (({NArrayMiss})) to (({NArray})).
if there is argument, set missing_value for invalid elements.
--- NArrayMiss#to_s
convert (({NArrayMiss})) to (({String})) as a binary data.
--- NArrayMiss#to_string
create (({NArrayMiss})) of object whose elements are processed (({to_s}))
=end
def floor
NArrayMiss.to_nam_no_dup(@array.floor, @mask.dup)
end
def ceil
NArrayMiss.to_nam_no_dup(@array.ceil, @mask.dup)
end
def round
NArrayMiss.to_nam_no_dup(@array.round, @mask.dup)
end
def to_i
NArrayMiss.to_nam_no_dup(@array.to_i, @mask.dup)
end
def to_f
NArrayMiss.to_nam_no_dup(@array.to_f, @mask.dup)
end
def to_type(typecode)
NArrayMiss.to_nam_no_dup(@array.to_type(typecode), @mask.dup)
end
def to_a
@array.to_a
end
def to_na!(*arg)
if arg.length==0
return @array
elsif arg.length==1 then
self.set_missing_value!(arg[0])
return @array
else
raise(ArgumentError, "Usage: NArrayMiss#to_na([missing_value])")
end
end
def to_na(*arg)
return self.dup.to_na!(*arg)
end
def to_s
@array.to_s
end
def to_string
obj = NArrayMiss.obj(*@array.shape)
obj.set_without_validation( @array.to_string )
obh.set_mask(@mask)
obj
end
=begin
=== Iteration
--- NArrayMiss#each{|x| ...}
--- NArrayMiss#each_valid{|x| ...}
--- NArrayMiss#each_valid_with_index{|x,i| ...}
--- NArrayMiss#collect{|x| ...}
--- NArrayMiss#collect!{|x| ...}
=end
def each
for i in 0..self.total-1
yield(@array[i])
end
end
def each_valid
for i in 0..self.total-1
yield(@array[i]) if @mask[i]
end
end
def each_valid_with_index
for i in 0..self.total-1
yield(@array[i],i) if @mask[i]
end
end
def collect!
for i in 0..self.total-1
self[i] = yield(self[i])
end
self
end
def collect(&blk)
self.dup.collect!(&blk)
end
=begin
=== Boolean and mask related (only for byte, sint and int)
--- NArrayMiss#count_false
return the number of elements whose value==0 and valid.
--- NArrayMiss#count_true
return the number of elements whose value!=0 and valid.
--- NArrayMiss#mask(mask)
return (({NArrayMiss#get_mask!&((|mask|))})).
--- NArrayMiss#all?
return true if all the valid elements are not 0, else false.
--- NArrayMiss#any?
return true if any valid element is not 0, else false.
--- NArrayMiss#none?
return true if none of the valid elements is not 0, else false.
--- NArrayMiss#where
return (({NArray})) of indices where valid elements are not 0.
--- NArrayMiss#where2
return (({Array})) including two (({NArray}))s of indices,
where valid elements are not 0, and 0, respectively.
=end
def count_false
if @array.typecode==BYTE then
return @array.count_false-@mask.count_false
else
raise("cannot count_true NArrayMiss except BYTE type")
end
end
def count_true
if @array.typecode==BYTE then
return (@array&@mask).count_true
else
raise("cannot count_true NArrayMiss except BYTE type")
end
end
def mask(arg)
obj = self.dup
if arg.class==NArrayMiss then
arg = arg.get_array!&arg.get_mask!
end
obj.set_mask(@mask&arg)
end
def all?
@array[@mask].all?
end
def any?
@array[@mask].any?
end
def none?
@array[@mask].none?
end
def where
(@array&@mask).where
end
def where2
self.where-@mask.where
end
=begin
=== Complex compound number (only for scomplex and complex)
--- NArrayMiss#real
--- NArrayMiss#imag
--- NArrayMiss#conj
--- NArrayMiss#angle
--- NArrayMiss#imag=(other)
--- NArrayMiss#im
=end
def real
NArrayMiss.to_nam_no_dup(@array.real,@mask)
end
def imag
NArrayMiss.to_nam_no_dup(@array.imag,@mask)
end
def conj
NArrayMiss.to_nam_no_dup(@array.conj,@mask)
end
def angle
NArrayMiss.to_nam_no_dup(@array.angle,@mask)
end
def imag=(arg)
@array.image=(arg)
self
end
def im
NArrayMiss.to_nam_no_dup(@array.im,@mask)
end
=begin
=== Byte swap
--- NArrayMiss#swap_byte
swap byte order.
--- NArrayMiss#hton
convert to network byte order.
--- NArrayMiss#ntoh
convert from network byte order.
--- NArrayMiss#htov
convert to VAX byte order.
--- NArrayMiss#vtoh
convert from VAX byte order.
=end
def swap_byte
obj = self.dup
obj.set_without_validation(@array.swap_byte)
obj
end
def hton
NArrayMiss.to_nam(@array.hton,@mask.hton)
end
alias :ntoh :hton
def htov
NArrayMiss.to_nam(@array.htov,@mask.htov)
end
alias :vtoh :htov
=begin
=== Mask and missing value
--- NArrayMiss#set_valid(index)
validate element at ((|index|)).
((|index|)) must be (({Integer, Range, Array, or true})).
--- NArrayMiss#validation(index)
alias to set_valid
--- NArrayMiss#set_invalid(index)
invaliadate element at ((|index|)).
((|index|)) must be (({Integer, Range, Array, or true})).
--- NArrayMiss#invalidation(index)
alias to set_invalid
--- NArrayMiss#all_valid
set all elements valid
--- NArrayMiss#all_invalid
set all elements invalid
--- NArrayMiss#set_mask(mask)
masking by ((|mask|))
--- NArrayMiss#set_missing_value(value)
replace invalid elements by ((|value|)).
--- NArrayMiss#get_mask!
return (({NArray})) of byte as mask.
--- NArrayMiss#get_mask
return (({NArray})) of byte as mask.
--- NArrayMiss#get_array!
return (({NArray})) as data.
--- NArrayMiss#get_array
return (({NArray})) as data.
--- NArrayMiss#valid?(index)
return (({Array})) whose elements are true or false,
or (({True}))/(({False})) corresponding to validity of the specified element(s) by the ((|index|))
--- NArrayMiss#all_valid?
return true if all elements are valid, else false.
--- NArrayMiss#none_valid?
return true if all elements are invalid, else false.
--- NArrayMiss#all_invalid?
alias to none_valid?
--- NArrayMiss#any_valid?
return true if any elements are valid, else false.
--- NArrayMiss#count_valid
return the number of valid elements.
--- NArrayMiss#count_invalid
return the number of invalid elements.
=end
def set_valid(*pos)
@mask[*pos] = 1
self
end
alias validation set_valid
def set_invalid(*pos)
@mask[*pos] = 0
self
end
alias invalidation set_invalid
def all_valid
@mask[true]=1
self
end
def all_invalid
@mask[true]=0
self
end
def set_mask(mask)
if mask.class == Array then
tmp = @array.class.byte(*@mask.shape)
tmp[true] = mask
mask = tmp
end
if mask.class == NArrayMiss then
mask = mask.to_na(0)
end
if mask.class == @array.class then
if mask.typecode != BYTE then
raise("mask must be NArrayMiss.byte, NArray.byte or Array")
end
if @array.shape != mask.shape then
raise("mask.shape must be same as array")
end
@mask = mask.dup
return self
else
raise("mask must be NArray.byte or Array")
end
end
def set_missing_value!(val)
@array[@mask.not] = val
self
end
def set_missing_value(val)
obj = self.dup
obj.set_missing_value!(val)
end
def get_mask!
@mask
end
def get_mask
@mask.dup
end
def get_array!
@array
end
def get_array
@array.dup
end
def valid?(*arg)
if arg.any?
# For the subset specified by the argument(s) (in the same way as for []).
# Returns true or false if a single value is specified.
# Otherwise, returns an Array of true of false
mask = @mask[*arg]
if mask.is_a?(Numeric)
return mask == 1 # true if mask (==1); false if not
end
else
# no argument
mask = @mask
end
ary = mask.to_a
ary.flatten!
ary.map!{|i| i==1} # true if element == 1; false if not
return ary
end
def all_valid?
@mask.all?
end
def none_valid?
@mask.none?
end
alias :all_invalid? :none_valid?
def any_valid?
@mask.any?
end
def count_valid(*arg)
if arg.length==0 then
return @mask.count_true
else
return @mask.to_type(MINT).sum(*arg)
end
end
def count_invalid(*arg)
if arg.length==0 then
return @mask.count_false
else
return @array.class.int(*@mask.shape).fill(1).sum(*arg)-
@mask.to_type(MINT).sum(*arg)
end
end
=begin
=== Others
--- NArrayMiss#integer?
return true if (({NArrayMiss})) is byte, sint or int, else false.
--- NArrayMiss#complex?
return true if (({NArrayMiss})) is scomplex or complex, else false.
--- NArrayMiss#dup
--- NArrayMiss#coerce(object)
--- NArrayMiss#inspect
go back to ((<Index>))
=end
def integer?
@array.integer?
end
def complex?
@array.complex?
end
def dup
NArrayMiss.to_nam(@array,@mask)
end
alias __clone__ clone
def clone
obj = __clone__
obj.set_array(@array.clone)
obj.set_mask(@mask.clone)
return obj
end
def coerce(x)
if Numeric===x then
return [NArrayMiss.new(@array.class[x].typecode,*self.shape).fill(x),self]
elsif x.class==Array || x.class==@array.class then
return [NArrayMiss.to_nam(x), self]
else
raise("donnot know how to cange #{x.class} to NArrayMiss")
end
end
def inspect
# "array -> " + @array.inspect + "\nmask -> " + @mask.inspect
count_line = 0
max_line = 10
max_col = 80
sep = ", "
const = Hash.new
@array.class.constants.each{|c| const[@array.class.const_get(c)] = c}
str_ret = "NArrayMiss."+const[typecode].to_s.downcase+"("+shape.join(",")+"):"
if rank == 0 then
str_ret << " []"
return str_ret
else
str_ret << "\n"
end
str = ""
index = Array.new(rank,0)
index[0] = true
i = 1
(rank-1).times{ str_ret << "[ " }
while(true)
i.times{ str_ret << "[ " }
str = @array[*index].inspect
ary = str[str.index("[")+1..str.index("]")-1].strip.split(/\s*,\s*/)
miss = @mask[*index].where2[1]
miss = miss[miss<ary.length].to_a
if ary[-1]=="..." && miss[-1]==ary.length-1 then miss.pop end
for j in miss
ary[j] = "-"
end
while ( rank*4+ary.join(", ").length > max_col )
ary.pop
ary[-1] = "..."
end
str_ret << ary.join(", ")
i = 1
while (i<rank)
if index[i]<shape[i]-1 then
str_ret << " ]" << sep << "\n"
count_line += 1
index[i] += 1
break
else
str_ret << " ]"
index[i] = 0
i += 1
end
end
if i>=rank then
str_ret << " ]"
return str_ret
elsif count_line>=max_line then
str_ret << " ..."
return str_ret
end
(rank-i).times{ str_ret << " " }
end
return str_ret
end
def _dump(limit)
Marshal::dump([@array._dump(nil),@mask._dump(nil)])
end
def self._load(o)
ary, mask = Marshal::load(o)
ary = NARRAY._load(ary)
mask = NARRAY._load(mask)
NArrayMiss.to_nam_no_dup(ary,mask)
end
# private
private
def pos(n,shape)
rank = shape.length
result = @array.class.int(rank)
m=n
for i in 0..rank-2
j = rank-1-i
result[j] = m/shape[j-1]
m = m%shape[j-1]
end
result[0] = m
result
end
def binary_operation(arg, dummy)
# arg: 第2項目のオブジェクト
# dummy: 演算を行っても結果に影響を与えない特別な値。(欠損部分に代入する)
flag=true
case arg
when Numeric
term1 = @array
term2 = arg
mask = @mask
when Array, @array.class
term1 = @array.dup
term1[@mask.not] = dummy # 欠損部分に dummy を代入
term2 = arg.kind_of?(@array.class) ? arg : @array.class.to_na(arg) # Array -> NArray
mask = @array.class.byte(*term2.shape).fill(1) # 2項目は欠損無し
mask = @mask & mask
when NArrayMiss
term1 = @array.dup
term1[@mask.not] = dummy
mask = arg.get_mask!
term2 = arg.get_array
term2[mask.not] = dummy
mask = @mask & mask
else
term1, term2 = arg.coerce(self)
# 演算を arg のクラスに任せるため、yield の結果をそのまま返す
flag = false
end
result = yield(term1, term2)
result = NArrayMiss.to_nam_no_dup(result, mask) if flag
result
end
def self.reduction(mask, rank, min_count, dims, flag, typecode)
# flag: リダクションを行う次元方向の有効な値の個数で、割り算を行うかどうかのフラグ
count_sum = mask.to_type(MINT).sum(*dims)
klass = mask.class
# 返り値が配列か、スカラーかによって分岐
if count_sum.kind_of?(klass)
mask = count_sum.ge(min_count)
# すべての要素が欠損値にならないかチェック
if mask.any?
count_accum = klass.ref(count_sum)
dims.collect{|d|d<0 ? d+rank : d}.sort.each do |d|
count_accum.newdim!(d)
end
# 割り算を行う場合は、先に count_sum を NArrayMiss 化
# yield の戻り値は NArrayMiss
# 割り算を行わない場合は、後で NArrayMiss 化
# yield の戻り値は NArray
count_sum = NArrayMiss.to_nam_no_dup(count_sum,mask) if flag
ary = yield(count_sum, count_accum)
ary = NArrayMiss.to_nam_no_dup(ary, mask) unless flag
else
# すべての要素が欠損値の NArrayMiss を返す
na = klass.new(typecode, *mask.shape)
ary = NArrayMiss.to_nam_no_dup(na, false)
end
else
# 有効な要素数があるかチェック
if count_sum >= min_count
count_accum = klass.int(*([1]*mask.rank)).fill!(count_sum)
ary = yield(count_sum, count_accum)
else
# 有効な要素数が足りない場合は nil を返す
return nil
end
end
return ary
end
# 引数にオプション (Hash) が指定されているかチェックし、
# されている場合は、オプションを取得し戻り値として返す。
# 現時点では、オプションは "min_count" のみ
def self.check_options(arg, default_mincount)
min_count = default_mincount
options = %w(min_count)
if arg.length!=0 && arg[-1].kind_of?(Hash)
option = arg.pop
option.each_key{|key|
if !options.index(key) then
raise(ArgumentError,key+" option is not exist")
end
}
min_count = option["min_count"] || default_mincount
min_count = min_count.to_i
if min_count < default_mincount
raise(ArgumentError, "min_count must be >= #{default_mincount}")
end
end
return min_count
end
end
module NMMath
func1 = ["sqrt","exp","log","log10","log2",
"sin","cos","tan","sinh","cosh","tanh",
"asin","acos","atan","asinh","acosh","atanh",
"csc", "sec", "cot", "csch", "sech", "coth",
"acsc", "asec", "acot", "acsch", "asech", "acoth",
]
func2 = ["atan2"]
for operator in func1
eval <<-EOL,nil,__FILE__,__LINE__+1
def #{operator}(x)
case x
when Numeric, Array, NARRAY
NMath::#{operator}(x)
when NArrayMiss
obj = NArrayMiss.new(x.typecode,*x.shape)
mask = x.get_mask!
obj[mask] = NMath::#{operator}(x.get_array![mask])
obj[mask.not] = x[mask.not]
obj.set_mask(mask)
obj
else
raise ArgumentError, "argument is invalid class: \#{x.class}"
end
end
module_function :#{operator}
EOL
end
for operator in func2
eval <<-EOL,nil,__FILE__,__LINE__+1
def #{operator}(x,y)
obj = nil
case x
when Numeric, Array, NARRAY
mask1 = nil
when NArrayMiss
obj = NArrayMiss.new(x.typecode,*x.shape)
mask1 = x.get_mask!
else
raise ArgumentError, "argument is invalid class"
end
case y
when Numeric, Array, NARRAY
mask2 = nil
when NArrayMiss
obj ||= NArrayMiss.new(y.typecode,*y.shape)
mask2 = y.get_mask!
else
raise ArgumentError, "argument is invalid class"
end
if mask2.nil? then
if mask1.nil? then
return NMath::#{operator}(x,y)
else
obj[mask1] = NMath::#{operator}(x.get_array![mask1],y)
obj[mask1.not] = x[mask1.not]
obj.set_mask(mask1)
return obj
end
else
if mask1.nil? then
obj[mask2] = NMath::#{operator}(x,y.get_array![mask2])
obj[mask2.not] = y[mask2.not]
obj.set_mask(mask2)
return obj
else
obj[mask1&mask2] = NMath::#{operator}(x.get_array![mask1],y.get_array![mask2])
obj[(mask1&mask2).not] = x[(mask1&mask2).not]
return obj
end
end
end
module_function :#{operator}
EOL
end
methods = Hash.new
methods["covariance"] = {:min_count => 2, :post => <<-EOL}
mean0 = ary0.accum(*dims) / count_accum
mean1 = ary1.accum(*dims) / count_accum
ary = ((ary0-mean0)*(ary1-mean1)).sum(*dims)
ary / (count_sum-1)
EOL
methods.each do |name, hash|
eval <<-EOL,nil,__FILE__,__LINE__+1
def #{name}(ary0,ary1,*dims)
min_count = NArrayMiss.check_options(dims, 2)
case ary0
when Numeric, Array, NARRAY
mask0 = nil
when NArrayMiss
mask0 = ary0.get_mask!
else
raise ArgumentError, "argument is invalid class"
end
case ary1
when Numeric, Array, NARRAY
mask1 = nil
when NArrayMiss
mask1 = ary1.get_mask!
else
raise ArgumentError, "argument is invalid class"
end
if mask1.nil? then
if mask0.nil? then
return NMath.#{name}(ary0, ary1, *dims)
else
ary1 = NArrayMiss.to_nam_no_dup(ary1, true)
end
else
if mask0.nil?
ary0 = NArrayMiss.to_nam_no_dup(ary0, true)
end
end
if ary1.shape != ary1.shape
raise "shape is different"
end
ary0 = ary0.to_type(NARRAY::DFLOAT)
ary1 = ary1.to_type(NARRAY::DFLOAT)
mask = mask0.nil? ? mask1 : mask1.nil? ? mask0 : mask0&mask1
ary0.set_mask(mask)
ary1.set_mask(mask)
NArrayMiss.reduction(mask, ary0.rank, min_count, dims, true, NARRAY::DFLOAT) do |count_sum, count_accum|
#{hash[:post]}
end
end
module_function :#{name}
EOL
end
for operator in func1+func2+["covariance"]
eval <<-EOL,nil,__FILE__,__LINE__+1
def #{operator}(*x)
x = [self]+x if NArrayMiss===self
NMMath.#{operator}(*x)
end
EOL
end
end
class NArrayMiss
include NMMath
end
|