@nfdi4plants/arctrl 1.1.0 → 2.0.0-alpha.1

package/ISA/ISA/Helper.js

@@ -1,503 +0,0 @@
-import { isIterable, defaultOf, numberHash, identityHash, structuralHash, equals, disposeSafe, getEnumerator } from "../../fable_modules/fable-library.4.5.0/Util.js";
-import { some, value as value_1 } from "../../fable_modules/fable-library.4.5.0/Option.js";
-import { exactlyOne, partition, fold, contains } from "../../fable_modules/fable-library.4.5.0/Array.js";
-import { isEmpty as isEmpty_1, iterate, fold as fold_1 } from "../../fable_modules/fable-library.4.5.0/Seq.js";
-import { empty, singleton, append, head, tail, isEmpty } from "../../fable_modules/fable-library.4.5.0/List.js";
-import { Dictionary } from "../../fable_modules/fable-library.4.5.0/MutableMap.js";
-import { tryGetValue, addToDict } from "../../fable_modules/fable-library.4.5.0/MapUtil.js";
-import { Union, toString, FSharpRef } from "../../fable_modules/fable-library.4.5.0/Types.js";
-import { isNone_generic, append_generic, distinct_generic, isList_generic, isMap_generic } from "./Fable.js";
-import { union_type, makeUnion, option_type, makeGenericType, getUnionCases, name, obj_type } from "../../fable_modules/fable-library.4.5.0/Reflection.js";
-
-export function ResizeArray_map(f, a) {
-    const b = [];
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const i = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            void (b.push(f(i)));
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return b;
-}
-
-export function ResizeArray_choose(f, a) {
-    const b = [];
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const matchValue = f(enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]());
-            if (matchValue == null) {
-            }
-            else {
-                const x = value_1(matchValue);
-                void (b.push(x));
-            }
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return b;
-}
-
-export function ResizeArray_filter(f, a) {
-    const b = [];
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const i = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            if (f(i)) {
-                void (b.push(i));
-            }
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return b;
-}
-
-export function ResizeArray_fold(f, s, a) {
-    let state = s;
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const i = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            state = f(state, i);
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return state;
-}
-
-export function ResizeArray_foldBack(f, a, s) {
-    let state = s;
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const i = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            state = f(i, state);
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return state;
-}
-
-export function ResizeArray_iter(f, a) {
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            f(enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]());
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-}
-
-export function ResizeArray_reduce(f, a) {
-    switch (a.length) {
-        case 0:
-            throw new Error("ResizeArray.reduce: empty array");
-        case 1:
-            return a[0];
-        default: {
-            const a_5 = a;
-            let state = a_5[0];
-            for (let i = 1; i <= (a_5.length - 1); i++) {
-                state = f(state, a_5[i]);
-            }
-            return state;
-        }
-    }
-}
-
-export function ResizeArray_collect(f, a) {
-    const b = [];
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const enumerator_1 = getEnumerator(f(enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]()));
-            try {
-                while (enumerator_1["System.Collections.IEnumerator.MoveNext"]()) {
-                    const j = enumerator_1["System.Collections.Generic.IEnumerator`1.get_Current"]();
-                    void (b.push(j));
-                }
-            }
-            finally {
-                disposeSafe(enumerator_1);
-            }
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return b;
-}
-
-export function ResizeArray_distinct(a) {
-    const b = [];
-    let enumerator = getEnumerator(a);
-    try {
-        while (enumerator["System.Collections.IEnumerator.MoveNext"]()) {
-            const i = enumerator["System.Collections.Generic.IEnumerator`1.get_Current"]();
-            if (!contains(i, b, {
-                Equals: equals,
-                GetHashCode: structuralHash,
-            })) {
-                void (b.push(i));
-            }
-        }
-    }
-    finally {
-        disposeSafe(enumerator);
-    }
-    return b;
-}
-
-export function ResizeArray_isEmpty(a) {
-    return a.length === 0;
-}
-
-export function HashCodes_boxHashOption(a) {
-    let copyOfStruct, copyOfStruct_1;
-    return (a != null) ? ((copyOfStruct = value_1(a), identityHash(copyOfStruct))) : ((copyOfStruct_1 = 0, numberHash(copyOfStruct_1)));
-}
-
-export function HashCodes_boxHashArray(a) {
-    return fold((acc, o) => {
-        let copyOfStruct;
-        return ((-1640531527 + ((copyOfStruct = o, identityHash(copyOfStruct)))) + (acc << 6)) + (acc >> 2);
-    }, 0, a);
-}
-
-export function HashCodes_boxHashSeq(a) {
-    return fold_1((acc, o) => {
-        let copyOfStruct;
-        return ((-1640531527 + ((copyOfStruct = o, identityHash(copyOfStruct)))) + (acc << 6)) + (acc >> 2);
-    }, 0, a);
-}
-
-/**
- * If the value matches the default, a None is returned, else a Some is returned
- */
-export function Option_fromValueWithDefault(d, v) {
-    if (equals(d, v)) {
-        return void 0;
-    }
-    else {
-        return some(v);
-    }
-}
-
-/**
- * Applies the function f on the value of the option if it exists, else applies it on the default value. If the result value matches the default, a None is returned
- */
-export function Option_mapDefault(d, f, o) {
-    return Option_fromValueWithDefault(d, (o == null) ? f(d) : f(value_1(o)));
-}
-
-/**
- * Applies the function f on the value of the option if it exists, else returns the default value.
- */
-export function Option_mapOrDefault(d, f, o) {
-    if (o == null) {
-        return d;
-    }
-    else {
-        return some(f(value_1(o)));
-    }
-}
-
-export function List_tryPickAndRemove(f, lst) {
-    const loop = (newList_mut, remainingList_mut) => {
-        loop:
-        while (true) {
-            const newList = newList_mut, remainingList = remainingList_mut;
-            if (!isEmpty(remainingList)) {
-                const t = tail(remainingList);
-                const h = head(remainingList);
-                const matchValue = f(h);
-                if (matchValue == null) {
-                    newList_mut = append(newList, singleton(h));
-                    remainingList_mut = t;
-                    continue loop;
-                }
-                else {
-                    return [some(value_1(matchValue)), append(newList, t)];
-                }
-            }
-            else {
-                return [void 0, newList];
-            }
-            break;
-        }
-    };
-    return loop(empty(), lst);
-}
-
-export function Dict_ofSeq(s) {
-    const dict = new Dictionary([], {
-        Equals: equals,
-        GetHashCode: structuralHash,
-    });
-    iterate((tupledArg) => {
-        addToDict(dict, tupledArg[0], tupledArg[1]);
-    }, s);
-    return dict;
-}
-
-export function Dict_tryFind(key, dict) {
-    let patternInput;
-    let outArg = defaultOf();
-    patternInput = [tryGetValue(dict, key, new FSharpRef(() => outArg, (v) => {
-        outArg = v;
-    })), outArg];
-    if (patternInput[0]) {
-        return some(patternInput[1]);
-    }
-    else {
-        return void 0;
-    }
-}
-
-export function Dict_ofSeqWithMerge(merge, s) {
-    const dict = new Dictionary([], {
-        Equals: equals,
-        GetHashCode: structuralHash,
-    });
-    iterate((tupledArg) => {
-        const k = tupledArg[0];
-        const v = tupledArg[1];
-        const matchValue = Dict_tryFind(k, dict);
-        if (matchValue == null) {
-            addToDict(dict, k, v);
-        }
-        else {
-            const v$0027 = value_1(matchValue);
-            dict.delete(k);
-            addToDict(dict, k, merge(v$0027, v));
-        }
-    }, s);
-    return dict;
-}
-
-/**
- * Get the type of the IEnumerable elements. E.g. for Array<'T> it would be 'T
- */
-export function Update_isMapType(v) {
-    return isMap_generic(v);
-}
-
-export function Update_isListType(v) {
-    return isList_generic(v);
-}
-
-/**
- * Get the type of the IEnumerable elements. E.g. for Array<'T> it would be 'T
- */
-export function Update_enumGetInnerType(v) {
-    return obj_type;
-}
-
-/**
- * updates oldRT with newRT by replacing all values, but appending all lists.
- * 
- * newRTList@oldRTList
- */
-export function Update_updateAppend(oldVal, newVal) {
-    let matchResult, oldInternal, others;
-    if (typeof oldVal === "string") {
-        matchResult = 0;
-    }
-    else if (isIterable(oldVal)) {
-        let activePatternResult;
-        const a = oldVal;
-        activePatternResult = ((a == null) ? void 0 : (undefined));
-        if (activePatternResult != null) {
-            matchResult = 1;
-            oldInternal = value_1(activePatternResult);
-        }
-        else {
-            matchResult = 2;
-        }
-    }
-    else {
-        let activePatternResult_1;
-        const a_1 = oldVal;
-        activePatternResult_1 = ((a_1 == null) ? void 0 : (undefined));
-        if (activePatternResult_1 != null) {
-            matchResult = 1;
-            oldInternal = value_1(activePatternResult_1);
-        }
-        else {
-            matchResult = 3;
-            others = oldVal;
-        }
-    }
-    switch (matchResult) {
-        case 0:
-            return newVal;
-        case 1:
-            if (typeof oldInternal === "string") {
-                return newVal;
-            }
-            else if (isIterable(oldInternal)) {
-                let activePatternResult_2;
-                const a_2 = newVal;
-                activePatternResult_2 = ((a_2 == null) ? void 0 : (undefined));
-                if (activePatternResult_2 != null) {
-                    const newInternal = value_1(activePatternResult_2);
-                    const v = Update_updateAppend(oldInternal, newInternal);
-                    const cases_1 = partition((x) => (name(x) === "Some"), getUnionCases(makeGenericType(option_type(obj_type), [obj_type])));
-                    const patternInput = [exactlyOne(cases_1[0]), [v]];
-                    return makeUnion(patternInput[0], patternInput[1]);
-                }
-                else {
-                    return oldVal;
-                }
-            }
-            else {
-                return newVal;
-            }
-        case 2: {
-            const oldSeq = oldVal;
-            const newSeq = newVal;
-            const innerType = Update_enumGetInnerType(oldVal);
-            if (Update_isMapType(oldVal)) {
-                return newVal;
-            }
-            else {
-                return distinct_generic(append_generic(oldSeq, newSeq));
-            }
-        }
-        default:
-            return newVal;
-    }
-}
-
-/**
- * updates oldRT with newRT by replacing all values, but only if the new value is not empty.
- */
-export function Update_updateOnlyByExisting(oldVal, newVal) {
-    if (isNone_generic(newVal)) {
-        return oldVal;
-    }
-    else {
-        let activePatternResult;
-        const a = oldVal;
-        activePatternResult = ((a == null) ? void 0 : (undefined));
-        if (activePatternResult != null) {
-            const oldInternal = value_1(activePatternResult);
-            let activePatternResult_1;
-            const a_1 = newVal;
-            activePatternResult_1 = ((a_1 == null) ? void 0 : (undefined));
-            if (activePatternResult_1 != null) {
-                const newInternal = value_1(activePatternResult_1);
-                const v = Update_updateOnlyByExisting(oldInternal, newInternal);
-                const cases_1 = partition((x) => (name(x) === "Some"), getUnionCases(makeGenericType(option_type(obj_type), [obj_type])));
-                const patternInput = [exactlyOne(cases_1[0]), [v]];
-                return makeUnion(patternInput[0], patternInput[1]);
-            }
-            else {
-                return oldVal;
-            }
-        }
-        else if (typeof oldVal === "string") {
-            const newStr = newVal;
-            if (toString(newStr) === "") {
-                return oldVal;
-            }
-            else {
-                return newStr;
-            }
-        }
-        else if (isIterable(oldVal)) {
-            const newSeq = newVal;
-            if (isEmpty_1(newSeq)) {
-                return oldVal;
-            }
-            else {
-                return newSeq;
-            }
-        }
-        else {
-            return newVal;
-        }
-    }
-}
-
-/**
- * updates oldRT with newRT by replacing all values, but only if the new value is not empty.
- */
-export function Update_updateOnlyByExistingAppend(oldVal, newVal) {
-    if (isNone_generic(newVal)) {
-        return oldVal;
-    }
-    else {
-        let activePatternResult;
-        const a = oldVal;
-        activePatternResult = ((a == null) ? void 0 : (undefined));
-        if (activePatternResult != null) {
-            const oldInternal = value_1(activePatternResult);
-            let activePatternResult_1;
-            const a_1 = newVal;
-            activePatternResult_1 = ((a_1 == null) ? void 0 : (undefined));
-            if (activePatternResult_1 != null) {
-                const newInternal = value_1(activePatternResult_1);
-                const v = Update_updateOnlyByExistingAppend(oldInternal, newInternal);
-                const cases_1 = partition((x) => (name(x) === "Some"), getUnionCases(makeGenericType(option_type(obj_type), [obj_type])));
-                const patternInput = [exactlyOne(cases_1[0]), [v]];
-                return makeUnion(patternInput[0], patternInput[1]);
-            }
-            else {
-                return oldVal;
-            }
-        }
-        else if (typeof oldVal === "string") {
-            const newStr = newVal;
-            if (toString(newStr) === "") {
-                return oldVal;
-            }
-            else {
-                return newStr;
-            }
-        }
-        else if (isIterable(oldVal)) {
-            const innerType = Update_enumGetInnerType(oldVal);
-            if (Update_isMapType(oldVal)) {
-                return newVal;
-            }
-            else {
-                return distinct_generic(append_generic(oldVal, newVal));
-            }
-        }
-        else {
-            return newVal;
-        }
-    }
-}
-
-export class Update_UpdateOptions extends Union {
-    constructor(tag, fields) {
-        super();
-        this.tag = tag;
-        this.fields = fields;
-    }
-    cases() {
-        return ["UpdateAll", "UpdateByExisting", "UpdateAllAppendLists", "UpdateByExistingAppendLists"];
-    }
-}
-
-export function Update_UpdateOptions_$reflection() {
-    return union_type("ARCtrl.ISA.Aux.Update.UpdateOptions", [], Update_UpdateOptions, () => [[], [], [], []]);
-}
-