"use strict";

Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.Right = exports.Left = void 0;
exports.alt = alt;
exports.alt_ = alt_;
exports.ap = ap;
exports.ap_ = ap_;
exports.bimap = bimap;
exports.bimap_ = bimap_;
exports.chain = chain;
exports.chain_ = chain_;
exports.compact = compact;
exports.duplicate = duplicate;
exports.exists = exists;
exports.exists_ = exists_;
exports.extend = extend;
exports.extend_ = extend_;
exports.filterOrElse = filterOrElse;
exports.filterOrElse_ = filterOrElse_;
exports.flatten = flatten;
exports.fold = fold;
exports.fold_ = fold_;
exports.fromNullable = fromNullable;
exports.fromNullable_ = fromNullable_;
exports.fromOption = fromOption;
exports.fromOption_ = fromOption_;
exports.fromPredicate = fromPredicate;
exports.fromPredicate_ = fromPredicate_;
exports.getOrElse = getOrElse;
exports.getOrElse_ = getOrElse_;
exports.isLeft = isLeft;
exports.isRight = isRight;
exports.left = left;
exports.leftW = leftW;
exports.map = map;
exports.mapLeft = mapLeft;
exports.mapLeft_ = mapLeft_;
exports.map_ = map_;
exports.merge = merge;
exports.orElse = orElse;
exports.orElseEither = orElseEither;
exports.orElseEither_ = orElseEither_;
exports.orElse_ = orElse_;
exports.parseJSON = parseJSON;
exports.parseJSON_ = parseJSON_;
exports.reduce = reduce;
exports.reduceRight = reduceRight;
exports.reduceRight_ = reduceRight_;
exports.reduce_ = reduce_;
exports.right = right;
exports.rightW = rightW;
exports.stringifyJSON = stringifyJSON;
exports.stringifyJSON_ = stringifyJSON_;
exports.swap = swap;
exports.tap = tap;
exports.tap_ = tap_;
exports.toError = toError;
exports.tryCatch = tryCatch;
exports.widenA = widenA;
exports.widenE = widenE;
exports.zip = zip;
exports.zipFirst = zipFirst;
exports.zipFirst_ = zipFirst_;
exports.zipSecond = zipSecond;
exports.zipSecond_ = zipSecond_;
exports.zip_ = zip_;

var Tp = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../Collections/Immutable/Tuple/index.cjs"));

var _core = /*#__PURE__*/require("../Option/core.cjs");

var St = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../Structural/index.cjs"));

function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }

function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }

// ets_tracing: off

/**
 * adapted from https://github.com/gcanti/fp-ts
 */
const _leftHash = /*#__PURE__*/St.hashString("@effect-ts/system/Either/Left");

const _rightHash = /*#__PURE__*/St.hashString("@effect-ts/system/Either/Right");
/**
 * Definitions
 */


class Left {
  constructor(left) {
    this.left = left;
    this._tag = "Left";
  }

  [St.equalsSym](that) {
    return that instanceof Left && St.equals(this.left, that.left);
  }

  get [St.hashSym]() {
    return St.combineHash(_leftHash, St.hash(this.left));
  }

}

exports.Left = Left;

class Right {
  constructor(right) {
    this.right = right;
    this._tag = "Right";
  }

  [St.equalsSym](that) {
    return that instanceof Right && St.equals(this.right, that.right);
  }

  get [St.hashSym]() {
    return St.combineHash(_rightHash, St.hash(this.right));
  }

}
/**
 * Constructs a new `Either` holding a `Right` value. This usually represents a successful value due to the right bias
 * of this structure
 */


exports.Right = Right;

function right(a) {
  return new Right(a);
}
/**
 * Constructs a new `Either` holding a `Right` value. This usually represents a successful value due to the right bias
 * of this structure
 */


function rightW(a) {
  return new Right(a);
}
/**
 * Constructs a new `Either` holding a `Left` value. This usually represents a failure, due to the right-bias of this
 * structure
 */


function left(e) {
  return new Left(e);
}
/**
 * Constructs a new `Either` holding a `Left` value. This usually represents a failure, due to the right-bias of this
 * structure
 */


function leftW(e) {
  return new Left(e);
}
/**
 * Widen left side `Either[E, A] => Either[E | E1, A]`
 */


function widenE() {
  return (
    /**
     * @ets_optimize identity
     */
    self => self
  );
}
/**
 * Widen right side `Either[E, A] => Either[E, A | A1]`
 */


function widenA() {
  return (
    /**
     * @ets_optimize identity
     */
    self => self
  );
}
/**
 * Alternatively construct that if self is left
 */


function alt_(self, that) {
  return isLeft(self) ? that() : self;
}
/**
 * Alternatively construct that if self is left
 *
 * @ets_data_first alt_
 */


function alt(that) {
  return self => alt_(self, that);
}
/**
 * Classic Applicative
 */


function ap_(fab, fa) {
  return isLeft(fab) ? fab : isLeft(fa) ? fa : right(fab.right(fa.right));
}
/**
 * Classic Applicative
 *
 * @ets_data_first ap_
 */


function ap(fa) {
  return fab => ap_(fab, fa);
}
/**
 * Apply both and return both
 */


function zip_(fa, fb) {
  return chain_(fa, a => map_(fb, b => Tp.tuple(a, b)));
}
/**
 * Apply both and return both
 *
 * @ets_data_first zip_
 */


function zip(fb) {
  return fa => zip_(fa, fb);
}
/**
 * Apply both and return first
 *
 * @ets_data_first zipFirst_
 */


function zipFirst(fb) {
  return fa => zipFirst_(fa, fb);
}
/**
 * Apply both and return first
 */


function zipFirst_(fa, fb) {
  return ap_(map_(fa, a => () => a), fb);
}
/**
 * Apply both and return second
 *
 * @ets_data_first zipSecond_
 */


function zipSecond(fb) {
  return fa => zipSecond_(fa, fb);
}
/**
 * Apply both and return second
 */


function zipSecond_(fa, fb) {
  return ap_(map_(fa, () => b => b), fb);
}
/**
 * Maps both left and right
 */


function bimap_(fea, f, g) {
  return isLeft(fea) ? left(f(fea.left)) : right(g(fea.right));
}
/**
 * Maps both left and right
 *
 * @ets_data_first bimap_
 */


function bimap(f, g) {
  return fa => bimap_(fa, f, g);
}
/**
 * Extends this computation with another computation that depends on the
 * result of this computation by running the first computation, using its
 * result to generate a second computation, and running that computation.
 */


function chain_(fa, f) {
  return isLeft(fa) ? fa : f(fa.right);
}
/**
 * Extends this computation with another computation that depends on the
 * result of this computation by running the first computation, using its
 * result to generate a second computation, and running that computation.
 *
 * @ets_data_first chain_
 */


function chain(f) {
  return ma => chain_(ma, f);
}
/**
 * Like chain but ignores the constructed outout
 *
 * @ets_data_first tap_
 */


function tap(f) {
  return ma => chain_(ma, a => map_(f(a), () => a));
}
/**
 * Like chain but ignores the constructed outout
 */


function tap_(ma, f) {
  return chain_(ma, a => map_(f(a), () => a));
}
/**
 * Self embed `Either[E, A]` into `Either[E, Either[E, A]]`
 */


function duplicate(ma) {
  return extend_(ma, x => x);
}
/**
 * Returns `false` if `Left` or returns the result of the application of the given predicate to the `Right` value.
 *
 * @ets_data_first exists_
 */


function exists(predicate) {
  return ma => isLeft(ma) ? false : predicate(ma.right);
}
/**
 * Returns `false` if `Left` or returns the result of the application of the given predicate to the `Right` value.
 */


function exists_(ma, predicate) {
  return isLeft(ma) ? false : predicate(ma.right);
}
/**
 * Apply `Either[E, A] => B` in case self is right returning `Either[E, B]`
 */


function extend_(wa, f) {
  return isLeft(wa) ? wa : right(f(wa));
}
/**
 * Apply `Either[E, A] => B` in case self is right returning `Either[E, B]`
 *
 * @ets_data_first extend_
 */


function extend(f) {
  return ma => extend_(ma, f);
}

function filterOrElse(predicate, onFalse) {
  return ma => chain_(ma, a => predicate(a) ? right(a) : left(onFalse(a)));
}

function filterOrElse_(ma, predicate, onFalse) {
  return chain_(ma, a => predicate(a) ? right(a) : left(onFalse(a)));
}
/**
 * Flatten nested `Either[E, Either[E1, A]]` into `Either[E | E1, A]`
 */


function flatten(mma) {
  return chain_(mma, x => x);
}
/**
 * Takes two functions and an `Either` value, if the value is a `Left` the inner value is applied to the first function,
 * if the value is a `Right` the inner value is applied to the second function.
 *
 * @ets_data_first fold_
 */


function fold(onLeft, onRight) {
  return ma => isLeft(ma) ? onLeft(ma.left) : onRight(ma.right);
}
/**
 * Takes two functions and an `Either` value, if the value is a `Left` the inner value is applied to the first function,
 * if the value is a `Right` the inner value is applied to the second function.
 */


function fold_(ma, onLeft, onRight) {
  return isLeft(ma) ? onLeft(ma.left) : onRight(ma.right);
}
/**
 * Takes a default and a nullable value, if the value is not nully, turn it into a `Right`, if the value is nully use
 * the provided default as a `Left`
 *
 * @ets_data_first fromNullable_
 */


function fromNullable(e) {
  return a => a == null ? left(e()) : right(a);
}
/**
 * Takes a default and a nullable value, if the value is not nully, turn it into a `Right`, if the value is nully use
 * the provided default as a `Left`
 */


function fromNullable_(a, e) {
  return a == null ? left(e()) : right(a);
}
/**
 * Construct `Either[E, A]` from `Option[A]` constructing `E` with `onNone`
 *
 * @ets_data_first fromOption_
 */


function fromOption(onNone) {
  return ma => (0, _core.isNone)(ma) ? left(onNone()) : right(ma.value);
}
/**
 * Construct `Either[E, A]` from `Option[A]` constructing `E` with `onNone`
 */


function fromOption_(ma, onNone) {
  return (0, _core.isNone)(ma) ? left(onNone()) : right(ma.value);
}

function fromPredicate(predicate, onFalse) {
  return a => predicate(a) ? right(a) : left(onFalse(a));
}

function fromPredicate_(a, predicate, onFalse) {
  return predicate(a) ? right(a) : left(onFalse(a));
}
/**
 * Get `A` or in case self is left return `onLeft` result
 *
 * @ets_data_first getOrElse_
 */


function getOrElse(onLeft) {
  return ma => getOrElse_(ma, onLeft);
}
/**
 * Get `A` or in case self is left return `onLeft` result
 */


function getOrElse_(self, onLeft) {
  return isLeft(self) ? onLeft(self.left) : self.right;
}
/**
 * Returns `true` if the either is an instance of `Left`, `false` otherwise
 */


function isLeft(ma) {
  switch (ma._tag) {
    case "Left":
      return true;

    case "Right":
      return false;
  }
}
/**
 * Returns `true` if the either is an instance of `Right`, `false` otherwise
 */


function isRight(ma) {
  return ma._tag === "Right" ? true : false;
}
/**
 * Use `A => B` to transform `Either[E, A]` to `Either[E, B]`
 */


function map_(fa, f) {
  return isLeft(fa) ? fa : right(f(fa.right));
}
/**
 * Use `A => B` to transform `Either[E, A]` to `Either[E, B]`
 *
 * @ets_data_first map_
 */


function map(f) {
  return fa => map_(fa, f);
}
/**
 * Use `E => E1` to transform `Either[E, A]` to `Either[E1, A]`
 */


function mapLeft_(fea, f) {
  return isLeft(fea) ? left(f(fea.left)) : fea;
}
/**
 * Use `E => E1` to transform `Either[E, A]` to `Either[E1, A]`
 *
 * @ets_data_first mapLeft_
 */


function mapLeft(f) {
  return fa => mapLeft_(fa, f);
}
/**
 * Merges Left<E> | Right<B> into A | B
 */


function merge(self) {
  return fold_(self, x => x, x => x);
}
/**
 * Alternatively run onLeft
 *
 * @ets_data_first orElse_
 */


function orElse(onLeft) {
  return ma => orElse_(ma, onLeft);
}
/**
 * Alternatively run onLeft
 */


function orElse_(ma, onLeft) {
  return isLeft(ma) ? onLeft(ma.left) : ma;
}
/**
 * Alternatively run onLeft returning
 *
 * @ets_data_first orElseEither_
 */


function orElseEither(onLeft) {
  return ma => orElseEither_(ma, onLeft);
}
/**
 * Alternatively run onLeft returning
 */


function orElseEither_(ma, onLeft) {
  return orElse_(map_(ma, left), e => map_(onLeft(e), right));
}
/**
 * Converts a JavaScript Object Notation (JSON) string into an object.
 */


function parseJSON_(s, onError) {
  return tryCatch(() => JSON.parse(s), onError);
}
/**
 * Converts a JavaScript Object Notation (JSON) string into an object.
 *
 * @ets_data_first parseJSON_
 */


function parseJSON(onError) {
  return s => tryCatch(() => JSON.parse(s), onError);
}
/**
 * Converts a JavaScript value to a JavaScript Object Notation (JSON) string.
 */


function stringifyJSON_(u, onError) {
  return tryCatch(() => JSON.stringify(u), onError);
}
/**
 * Converts a JavaScript value to a JavaScript Object Notation (JSON) string.
 *
 * @ets_data_first stringifyJSON_
 */


function stringifyJSON(onError) {
  return u => tryCatch(() => JSON.stringify(u), onError);
}
/**
 * Inverts `Either[E, A]` into `Either[A, E]`
 */


function swap(ma) {
  return isLeft(ma) ? right(ma.left) : left(ma.right);
}
/**
 * Default value for the `onError` argument of `tryCatch`
 */


function toError(e) {
  return e instanceof Error ? e : new Error(String(e));
}
/**
 * Constructs a new `Either` from a function that might throw
 */


function tryCatch(f, onError) {
  try {
    return right(f());
  } catch (e) {
    return left(onError(e));
  }
}
/**
 * Compact types Either<E, A> | Either<E2, B> = Either<E | E2, A | B>
 *
 * @ets_optimize identity
 */


function compact(_) {
  return _;
}
/**
 * Reduce a value `b` through an `Either`
 */


function reduce_(fa, b, f) {
  return isLeft(fa) ? b : f(b, fa.right);
}
/**
 * Reduce a value `b` through an `Either`
 *
 * @ets_data_first reduce_
 */


function reduce(b, f) {
  return fa => reduce_(fa, b, f);
}
/**
 * Reduce a value `b` through an `Either` in inverted order
 *
 * @ets_data_first reduceRight_
 */


function reduceRight(b, f) {
  return fa => reduceRight_(fa, b, f);
}
/**
 * Reduce a value `b` through an `Either` in inverted order
 */


function reduceRight_(fa, b, f) {
  return isLeft(fa) ? b : f(fa.right, b);
}
//# sourceMappingURL=core.cjs.map