// This is part of Leandro Motta Barros' DUMP project
// http://stackedboxes.org/2020/01/05/dump-of-unsorted-morsels-for-programmers/
// Code is licensed under the MIT license
//
//
// Copyright 2017-2020 Leandro Motta Barros
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

/**/async/**/function subtractiveEuclideanAlgorithm(a: number, b: number): /**/Promise</**/number/**/>/**/ {
    let __f = dump.StepByStepFunction.instanceByID("demo-euclid-subtractive"); // __DUMP_HIDE__
    while (a != b) {
        __f.data.set("a", a); __f.data.set("b", b); await __f.wait(); // __DUMP_HIDE__
        if (a > b) {
            a -= b;
        }
        else {
            b -= a;
        }
    }

    __f.data.set("a", a); __f.data.set("b", b); // __DUMP_HIDE__
    return a;
}
/**/async/**/function euclideanAlgorithm(a: number, b: number): /**/Promise</**/number/**/>/**/ {
    let __f = dump.StepByStepFunction.instanceByID("demo-euclid-modern"); // __DUMP_HIDE__
    __f.data.set("a", a); __f.data.set("b", b); await __f.wait(); // __DUMP_HIDE__
    do {
        let c = a;
        a = b % a;
        b = c;
        __f.data.set("a", a); __f.data.set("b", b); if (a>0) {await __f.wait();} // __DUMP_HIDE__
    } while (a > 0);
    return b;
}
/**/async/**/function recursiveEuclideanAlgorithm(a: number, b: number): /**/Promise</**/number/**/>/**/ {
    if (b == 0)
        return a;
    else
        return recursiveEuclideanAlgorithm(b, a % b);
}