import type { Universe } from '@ephox/boss';
import { Contracts, Fun, Optional } from '@ephox/katamari';
import { Gather, Spot, type SpotPoint } from '@ephox/phoenix';

import * as TextSearchBase from '../../textdata/TextSearch';
import { TextSeeker, type TextSeekerOutcome, type TextSeekerPhase, type TextSeekerPhaseConstructor, type TextSeekerPhaseProcessor } from '../../textdata/TextSeeker';

type CharPos = TextSearchBase.CharPos;

export interface TextSearchSeeker {
  readonly regex: () => RegExp;
  readonly attempt: <E>(phase: TextSeekerPhaseConstructor, item: E, text: string, index: number) => TextSeekerPhase<E>;
}

const seekerSig = Contracts.exactly([ 'regex', 'attempt' ]);

type PreviousCharFn = (text: string, offset: Optional<number>) => Optional<CharPos>;
const previousChar: PreviousCharFn = TextSearchBase.previous;

type NextCharFn = (text: string, offset: Optional<number>) => Optional<CharPos>;
const nextChar: NextCharFn = TextSearchBase.next;

// Returns: a TextSeeker outcome ADT of 'aborted', 'success', or 'edge'.
// 'success' returns a point {element, offset} to the left of (item, offset)
// successfully found using a process function.
// 'edge' returns the text element where the process stopped due to being adjacent to a
// block boundary.
type RepeatLeftFn = <E, D>(universe: Universe<E, D>, item: E, offset: number, process: TextSeekerPhaseProcessor<E, D>) => TextSeekerOutcome<E>;
const repeatLeft: RepeatLeftFn = TextSeeker.repeatLeft;

// Returns: a TextSeeker outcome ADT of 'aborted', 'success', or 'edge'.
// 'success' returns a point {element, offset} to the right of (item, offset)
// successfully found using a process function.
// 'edge' returns the text element where the process stopped due to being adjacent to a
// block boundary.
type RepeatRightFn = <E, D>(universe: Universe<E, D>, item: E, offset: number, process: TextSeekerPhaseProcessor<E, D>) => TextSeekerOutcome<E>;
const repeatRight: RepeatRightFn = TextSeeker.repeatRight;

// Returns: a TextSeeker outcome ADT of 'aborted', 'success', or 'edge'.
// 'success' returns a point {element, offset} to the left of (item, offset)
// successfully found using a regular expression (rawSeeker object) on the text content.
// 'edge' returns the text element where the search stopped due to being adjacent to a
// block boundary.
const expandLeft = <E, D>(universe: Universe<E, D>, item: E, offset: number, rawSeeker: TextSearchSeeker): TextSeekerOutcome<E> => {
  const seeker = seekerSig(rawSeeker);

  const process: TextSeekerPhaseProcessor<E, D> = (uni, phase, pItem, pText, pOffset) => {
    const lastOffset = pOffset.getOr(pText.length);
    return TextSearchBase.rfind(pText.substring(0, lastOffset), seeker.regex()).fold(() => {
      // Did not find a word break, so continue;
      return phase.kontinue<E>();
    }, (index) => {
      return seeker.attempt(phase, pItem, pText, index);
    });
  };
  return repeatLeft(universe, item, offset, process);
};

// Returns: a TextSeeker outcome ADT of 'aborted', 'success', or 'edge'.
// 'success' returns a point {element, offset} to the right of (item, offset)
// successfully found using a regular expression (rawSeeker object) on the text content.
// 'edge' returns the text element where the search stopped due to being adjacent to a
// block boundary.
const expandRight = <E, D>(universe: Universe<E, D>, item: E, offset: number, rawSeeker: TextSearchSeeker): TextSeekerOutcome<E> => {
  const seeker = seekerSig(rawSeeker);

  const process: TextSeekerPhaseProcessor<E, D> = (uni, phase, pItem, pText, pOffset) => {
    const firstOffset = pOffset.getOr(0);
    const optPos = TextSearchBase.lfind(pText.substring(firstOffset), seeker.regex());
    return optPos.fold(() => {
      // Did not find a word break, so continue;
      return phase.kontinue();
    }, (index) => {
      return seeker.attempt(phase, pItem, pText, firstOffset + index);
    });
  };

  return repeatRight(universe, item, offset, process);
};

// Identify the (element, offset) pair ignoring potential fragmentation. Follow the offset
// through until the offset left is 0. This is designed to find text node positions that
// have been fragmented.
const scanRight = <E, D>(universe: Universe<E, D>, item: E, originalOffset: number): Optional<SpotPoint<E>> => {
  const isRoot = Fun.never;
  if (!universe.property().isText(item)) {
    return Optional.none();
  }
  const text = universe.property().getText(item);
  if (originalOffset <= text.length) {
    return Optional.some(Spot.point(item, originalOffset));
  } else {
    return Gather.seekRight(universe, item, universe.property().isText, isRoot).bind((next) => {
      return scanRight(universe, next, originalOffset - text.length);
    });
  }
};

export const TextSearch = {
  previousChar,
  nextChar,
  repeatLeft,
  repeatRight,
  expandLeft,
  expandRight,
  scanRight
};