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
|
#include "scicos_block.h"
#include <math.h>
void logicalop(scicos_block *block,int flag)
{
int i,j,k,l;
i=block->ipar[0];
switch (i)
{
case 0:
if (block->nin==1)
{
block->outptr[0][0]=1.0;
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]<=0)
{
block->outptr[0][0]=0.0;
break;
}
}
}
else {
for (j=0;j<block->insz[0];j++) {
block->outptr[0][j]=1.0;
for (k=0;k<block->nin;k++) {
if(block->inptr[k][j]<=0) {
block->outptr[0][j]=0.0;
break;
}
}
}
}
break;
case 1:
if (block->nin==1)
{
block->outptr[0][0]=0.0;
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]>0) {
block->outptr[0][0]=1.0;
break;
}
}
}
else {
for (j=0;j<block->insz[0];j++) {
block->outptr[0][j]=0.0;
for (k=0;k<block->nin;k++) {
if(block->inptr[k][j]>0) {
block->outptr[0][j]=1.0;
break;
}
}
}
}
break;
case 2:
if (block->nin==1)
{
block->outptr[0][0]=0.0;
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]<=0)
{
block->outptr[0][0]=1.0;
break;
}
}
}
else {
for (j=0;j<block->insz[0];j++) {
block->outptr[0][j]=0.0;
for (k=0;k<block->nin;k++) {
if(block->inptr[k][j]<=0) {
block->outptr[0][j]=1.0;
break;
}
}
}
}
break;
case 3:
if (block->nin==1)
{
block->outptr[0][0]=1.0;
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]>0) {
block->outptr[0][0]=0.0;
break;
}
}
}
else {
for (j=0;j<block->insz[0];j++) {
block->outptr[0][j]=1.0;
for (k=0;k<block->nin;k++) {
if(block->inptr[k][j]>0) {
block->outptr[0][j]=0.0;
break;
}
}
}
}
break;
case 4:
if (block->nin==1)
{
l=0;
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]>0) {
l=(l+1)%2;
}
}
block->outptr[0][0]=(double) l;
}
else {
for (j=0;j<block->insz[0];j++) {
l=0;
for (k=0;k<block->nin;k++) {
if(block->inptr[k][j]>0) {
l=(l+1)%2;
}
}
block->outptr[0][j]=(double) l;
}
}
break;
case 5:
for (j=0;j<block->insz[0];j++) {
if(block->inptr[0][j]>0) {
block->outptr[0][j]=0.0;
}
else{
block->outptr[0][j]=1.0;
}
}
}
}
|
