/
friends_and_relations.clj
207 lines (147 loc) · 2.65 KB
/
friends_and_relations.clj
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
(ns the-little-clojurer.friends-and-relations
(:refer-clojure :exclude [set?]) ; Excludes functions to import to prevent collisions
(:use
[the-little-clojurer
[preface]
[do-it-do-it-again-and-again-and-again]
[cons-the-magnificent]]))
(defn set?
[lat]
(cond
(empty? lat)
true
(member? (first lat) (rest lat))
false
:else
(recur (rest lat))))
(defn makeset
[lat]
(cond
(empty? lat)
()
(member? (first lat) (rest lat))
(recur (rest lat))
:else
(conj (makeset (rest lat))
(first lat))))
(defn makeset
[lat]
(cond
(empty? lat)
()
:else
(conj
(makeset (multirember (first lat) (rest lat)))
(first lat))))
(defn subset?
[set1 set2]
(cond
(empty? set1)
true
:else
(and (member? (first set1) set2)
(recur (rest set1) set2))))
(defn eqset?
[set1 set2]
(and (subset? set1 set2)
(subset? set2 set1)))
(defn intersect?
[set1 set2]
(cond
(empty? set1)
false
:else
(or
(member? (first set1) set2)
(intersect? (rest set1) set2))))
(defn intersect
[set1 set2]
(cond
(empty? set1)
()
(member? (first set1) set2)
(conj (intersect (rest set1) set2)
(first set1))
:else
(recur (rest set1) set2)))
(defn union
[set1 set2]
(cond
(empty? set1)
set2
(member? (first set1) set2)
(recur (rest set1) set2)
:else
(conj (union (rest set1) set2)
(first set1))))
(defn intersectall
[l-set]
(cond
(empty? (rest l-set))
(first l-set)
:else
(intersect (first l-set)
(intersectall (rest l-set)))))
(defn a-pair?
[x]
(cond
(atom? x)
false
(empty? x)
false
(empty? (rest x))
false
(empty? (rest (rest x)))
true
:else
false))
(defn get-first ; car => first
[p]
(first p))
(defn get-second ; (car (cdr x)) => second
[p]
(second p))
(defn build
[s1 s2]
(conj [] s1 s2))
(defn get-third
[l]
(first (rest (rest l))))
(defn fun?
[rel]
(set? (firsts rel)))
(defn revrel
[rel]
(cond
(empty? rel)
()
:else
(conj (revrel (rest rel))
(build
(get-second (first rel))
(get-first (first rel))))))
(defn revpair
[p]
(build
(get-second p)
(get-first p)))
(defn revrel
[rel]
(cond
(empty? rel)
()
:else
(conj (revrel (rest rel))
(revpair (first rel)))))
(defn seconds
[l]
(cond
(empty? l) ()
:else (conj (seconds (rest l))
(second (first l)))))
(defn fullfun?
[fun]
(set? (seconds fun)))
(defn one-to-one?
[fun]
(fun? (revrel fun)))