LinearSearchMode.java

	// This is equivalent to: linearSearch(list, t, build(modeMoveFirst))
	public static <T> boolean linearSearchMoveFirst(List<T> list, T t) {
		return linearSearch(list, t, 
			((List<T> l, int index) 
			-> { T elem = l.remove(index); l.add(0, elem); } ));
	}

	// This is equivalent to: linearSearch(list, t, build(modeMoveLast))
	public static <T> boolean linearSearchMoveLast(List<T> list, T t) {
		return linearSearch(list, t, 
			((List<T> l, int index) 
			-> { T elem = l.remove(index); l.add(elem); } ));
	}

	// This is equivalent to: linearSearch(list, t, build(modeMoveUp))
	public static <T> boolean linearSearchMoveUp(List<T> list, T t) {
		return linearSearch(list, t, 
			((List<T> l, int index) -> {
				if (index != 0) {
					Collections.swap(list, index-1, index);
				}
			}));
	}