summaryrefslogtreecommitdiff
path: root/src/main/java/bjc/funcdata/CList.java
blob: 2b7f736230ba8f419d4e79f57931d55fcc1dd0d2 (plain)
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
/* 
 * esodata - data structures and other things, of varying utility
 * Copyright 2022, Ben Culkin
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *   
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
package bjc.funcdata;

import java.util.function.UnaryOperator;

import bjc.data.Either;
import bjc.data.Pair;
import bjc.functypes.Unit;

public class CList<T> implements CListLike<T> {
	private Either<Unit, Pair<T, CList<T>>> data;
	
	private CList() {
		data = Either.left(Unit.UNIT);
	}
	
	private CList(T data, CList<T> rest) {
		this.data = Either.right(Pair.pair(data, rest));
	}
	
	@Override
	public boolean isEmpty() {
		return data.isLeft();
	}
	
	@Override
	public T head() {
		return data.forceRight().getLeft();
	}
	
	@Override
	public CList<T> tail() {
		return data.forceRight().getRight();
	}
	
	@Override
	public CList<T> prefix(T val) {
		return new CList<>(val, this);
	}
	
	public static <T> UnaryOperator<CList<T>> prefixing(T val) {
		return (lst) -> lst.prefix(val);
	}
	
	public static <T> CList<T> empty() {
		return new CList<>();
	}
	
	@SafeVarargs
	public static <T> CList<T> of(T... vals) {
		CList<T> ret = empty();
		for (int i = vals.length - 1; i >= 0; i-- ) {
			ret = ret.prefix(vals[i]);
		}
		return ret;
	}
}