33 for (i = 1; i < nA; i++) {
51 void merge(
int *A,
int nA,
int *B) {
54 for (i = 1; i < nA; i++) {
72 int card_or(
int *A1,
int n1,
int *A2,
int n2) {
73 int i = 0, j = 0, k = 0;
74 while ((i < n1) || (j < n2)) {
75 if ((i == n1) || (j == n2)) {
81 }
else if (A1[i] < A2[j]) {
87 }
else if (A1[i] > A2[j]) {
112 int i = 0, j = 0, k = 0;
113 while (i < n1 && j < n2) {
116 }
else if (A1[i] > A2[j]) {
138 int set_or(
int *A1,
int n1,
int *A2,
int n2,
int *A1orA2) {
139 int i = 0, j = 0, k = 0;
140 while ((i < n1) || (j < n2)) {
141 if ((i == n1) || (j == n2)) {
149 }
else if (A1[i] < A2[j]) {
157 }
else if (A1[i] > A2[j]) {
186 int set_and(
int *A1,
int n1,
int *A2,
int n2,
int *A1andA2) {
187 int i = 0, j = 0, k = 0;
188 while (i < n1 && j < n2) {
191 }
else if (A1[i] > A2[j]) {
210 int map_and(
int *A1,
int n1,
int *A2,
int n2,
int *mapA1andA2) {
211 int i = 0, j = 0, k = 0;
212 while (i < n1 && j < n2) {
215 }
else if (A1[i] > A2[j]) {
239 while (i < nA && j < nsubA) {
240 if (A[i] < subA[j]) {
int set_or(int *A1, int n1, int *A2, int n2, int *A1orA2)
int set_and(int *A1, int n1, int *A2, int n2, int *A1andA2)
int card_or(int *A1, int n1, int *A2, int n2)
int card_and(int *A1, int n1, int *A2, int n2)
int map_and(int *A1, int n1, int *A2, int n2, int *mapA1andA2)
Compute map A1 and A2 / A1.
void merge(int *A, int nA, int *B)
void subset2map(int *A, int nA, int *subA, int nsubA)