Added basic algorithms for List.

Author: Dawoodoz

Source/DFPSR/api/algorithmAPI_List.h

@@ -60,6 +60,125 @@ String& string_toStreamIndented(String& target, const List<T>& collection, const
 	return target;
 }
 
+// Returns an index to the first element in list matching find, or -1 if none could be found.
+template <typename T>
+int64_t list_findFirst(const dsr::List<T> &list, const T &find) {
+	for (int64_t e = 0; e < list.length(); e++) {
+		if (list[e] == find) {
+			return e;
+		}
+	}
+	return -1;
+}
+
+// Returns an index to the first element in list where condition returns true, or -1 if the condition returned false for all elements.
+template <typename T>
+int64_t list_findFirst(const dsr::List<T> &list, const TemporaryCallback<bool(const T &element)> &condition) {
+	for (int64_t e = 0; e < list.length(); e++) {
+		if (condition(list[e])) {
+			return e;
+		}
+	}
+	return -1;
+}
+
+// Returns an index to the last element in list matching find, or -1 if none could be found.
+template <typename T>
+int64_t list_findLast(const dsr::List<T> &list, const T &find) {
+	for (int64_t e = list.length() - 1; e >= 0; e--) {
+		if (list[e] == find) {
+			return e;
+		}
+	}
+	return -1;
+}
+
+// Returns an index to the last element in list where condition returns true, or -1 if the condition returned false for all elements.
+template <typename T>
+int64_t list_findLast(const dsr::List<T> &list, const TemporaryCallback<bool(const T &element)> &condition) {
+	for (int64_t e = list.length() - 1; e >= 0; e--) {
+		if (condition(list[e])) {
+			return e;
+		}
+	}
+	return -1;
+}
+
+// Returns true iff find matches any element in list.
+template <typename T>
+bool list_elementExists(const dsr::List<T> &list, const T &find) {
+	return list_findFirst(list, find) != -1;
+}
+
+// Returns true iff condition is satisfied for any element in list.
+template <typename T>
+bool list_elementExists(const dsr::List<T> &list, const TemporaryCallback<bool(const T &element)> &condition) {
+	return list_findFirst(list, condition) != -1;
+}
+
+// Returns true iff find does not exist in list.
+template <typename T>
+bool list_elementIsMissing(const dsr::List<T> &list, const T &find) {
+	return list_findFirst(list, find) == -1;
+}
+
+// Returns true iff condition is not satisfied for any element in list.
+template <typename T>
+bool list_elementIsMissing(const dsr::List<T> &list, const TemporaryCallback<bool(const T &element)> &condition) {
+	return list_findFirst(list, condition) == -1;
+}
+
+// Pushes element to targetList and return true iff list_elementIsMissing.
+template <typename T>
+bool list_insertUnique_last(dsr::List<T> &targetList, const T &element) {
+	if (list_elementIsMissing(targetList, element)) {
+		targetList.push(element);
+		return true;
+	} else {
+		return false;
+	}
+}
+
+// Pushes element to a sorted location in targetList and return true iff list_elementIsMissing.
+// Pre-condition; targetList is sorted according to the < operator when beginning the call.
+// Side-effect: targetList will remain sorted if it was sorted from the start.
+template <typename T>
+bool list_insertUnique_sorted(dsr::List<T> &targetList, const T &element) {
+	if (list_elementIsMissing(targetList, element)) {
+		targetList.push(element);
+		int64_t at = targetList.length() - 1;
+		while (at > 0 && targetList[at] < targetList[at - 1]) {
+			targetList.swap(at, at - 1);
+			at--;
+		}
+		return true;
+	} else {
+		return false;
+	}
+}
+
+// Pushes all elements in sourceList that does not already exist in targetList.
+// Returns true iff any element was pushed to targetList.
+template <typename T>
+bool list_insertUnion_last(dsr::List<T> &targetList, const dsr::List<T> &sourceList) {
+	bool result = false;
+	for (int64_t e = 0; e < sourceList.length(); e++) {
+		result = result || list_insertUnique_last(targetList, sourceList[e]);
+	}
+	return result;
+}
+
+// Pushes all elements in sourceList that does not already exist in targetList.
+// Returns true iff any element was pushed to targetList.
+template <typename T>
+bool list_insertUnion_sorted(dsr::List<T> &targetList, const dsr::List<T> &sourceList) {
+	bool result = false;
+	for (int64_t e = 0; e < sourceList.length(); e++) {
+		result = result || list_insertUnique_sorted(targetList, sourceList[e]);
+	}
+	return result;
+}
+
 }
 
 #endif