Sorting-Algorithms/set.c at master · zacktraczyk/Sorting-Algorithms · GitHub

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
#include "set.h"

//
// Creates an empty set
//
// Function taken from Professor Darrell Long
//
Set set_empty(void) {
    return 0x00000000; // Empty set is 0s for each bit.
}

//
// Returns value of set element x
//
// s: set to check
// x: index of element to check
// Function taken from Professor Darrel Long
//
bool set_member(Set s, int x) {
    return s & (1 << (x % SET_CAPACITY));
}

//
// Sets value of set element x to true
//
// s: set to update
// x: index of element to update
// Function taken from Professor Darrel Long
//
Set set_insert(Set s, int x) {
    return s | (1 << (x % SET_CAPACITY));
}

//
// Sets value of set element x to false
// s: set to update
// x: index of element to update
// Function taken from Professor Darrel Long
//
Set set_remove(Set s, int x) {
    return s & ~(1 << (x % SET_CAPACITY));
}

//
// Returns union of two sets
//
// s: set to union
// t: set to union
// Function taken from Professor Darrel Long
//
Set set_union(Set s, Set t) {
    return s | t;
}

//
// Returns intersection of two sets
//
// s: set to intersect
// t: set to intersect
// Function taken from Professor Darrel Long
//
Set set_intersect(Set s, Set t) {
    return s & t;
}

//
// Returns difference of two sets
//
// s: set to difference
// t: set to difference
// Function taken from Professor Darrel Long
//
Set set_difference(Set s, Set t) {
    return s & ~t;
}

//
// Return complement of a set
//
// s: set to complement
// Function taken from Professor Darrel Long
Set set_complement(Set s) {
    return ~s;
}