(*
 * Copyright (c) Meta Platforms, Inc. and affiliates.
 *
 * This source code is licensed under the MIT license found in the
 * LICENSE file in the root directory of this source tree.
 *)

(**
 * This module tracks the exports from a given file, or declared module.
 *
 * Initially, we assume we're dealing with a CommonJS module. If we see an
 * ES-style import/export, we switch over. If we see a combination of CommonJS
 * and ES-style, we complain that the module type is indeterminate.
 *
 * Note that both CommonJS and ES modules can import and export types.
 *)

type t = {
  mutable kind: kind;
  mutable type_named: Type.Exports.t;
  mutable type_star: (ALoc.t * Type.t) list;
}

and kind =
  | CJS of ALoc.t option
  | ES of {
      named: Type.Exports.t;
      star: (ALoc.t * Type.t) list;
    }

let empty_cjs_module () = { kind = CJS None; type_named = NameUtils.Map.empty; type_star = [] }

let export info name loc t =
  match info.kind with
  | CJS None -> info.kind <- ES { named = NameUtils.Map.singleton name (Some loc, t); star = [] }
  | ES { named; star } ->
    info.kind <- ES { named = NameUtils.Map.add name (Some loc, t) named; star }
  | CJS (Some _) ->
    (* Indeterminate module. We already errored during parsing. *)
    ()

let export_star info loc module_t =
  match info.kind with
  | CJS None -> info.kind <- ES { named = NameUtils.Map.empty; star = [(loc, module_t)] }
  | ES { named; star } -> info.kind <- ES { named; star = (loc, module_t) :: star }
  | CJS (Some _) ->
    (* Indeterminate module. We already errored during parsing. *)
    ()

let export_type info name loc t = info.type_named <- NameUtils.Map.add name (loc, t) info.type_named

let export_type_star info loc module_t = info.type_star <- (loc, module_t) :: info.type_star

let cjs_clobber info loc =
  match info.kind with
  | CJS _ ->
    info.kind <- CJS (Some loc);
    true
  | ES _ -> false

(* Re-exporting names from another file can lead to conflicts. We resolve
 * conflicts on a last-export-wins basis. Star exports are accumulated in
 * source order, so the head of each list is the last export. This helper
 * function interleaves the two reverse-sorted lists. *)
let rec fold_star2 f g acc = function
  | ([], []) -> acc
  | (xs, []) -> List.fold_left f acc xs
  | ([], ys) -> List.fold_left g acc ys
  | ((x :: xs' as xs), (y :: ys' as ys)) ->
    if ALoc.compare (fst x) (fst y) > 0 then
      fold_star2 f g (f acc x) (xs', ys)
    else
      fold_star2 f g (g acc y) (xs, ys')
