// B is the type of object we handle.
sclass TransformersOnObjects<B> implements Steppable {
  replace Trail with O.
  
  // using the oldschool type F1 here because it's a bit easier to handle
  new AllOnAll<F1, B> allOnAll;
  new Set<B> bs;
  new MultiSetMap<B, Trail> trails;
  new Map<O, IF2> backTransformers; // reverse of each transformer
  
  srecord TransformationTrail(O transformer, O argument) {
    toString { ret squareBracket(str(transformer)) + " on " + squareBracket(str(argument)); }
  }
  
  // If this is true and a transformer returns an Iterable,
  // we unpack it and discard the Iterable.
  bool autoUnpackIterables = true;
  
  // make a trail for each transformer application
  bool autoTrails = true;
  
  // keep multiple trails per object
  bool allowMultipleTrails = true;

  AllOnAllOperation<F1, B> op = new(allOnAll,
    (a, b) -> {
      if (!callableOn_nonSynthetic(a, "get", b)) ret;
      O out = callFOpt(a, b);
      O trail = autoTrails ? makeTrailForTransformerApplication(a, b) : null;
      if (autoUnpackIterables && out instanceof Iterable)
        for (O x : (Iterable) out) addObject((B) x, trail);
      else
        addObject((B) out, trail);
    });

  bool add(B b) { ret addObject(b); }
  
  bool addObject(B b) {
    if (!addIfNotNull(bs, b)) false;
    allOnAll.addB(b);
    true;
  }
  
  void addObject(B b, O trail) {
    if (b == null) ret;
    add(b);
    if (trail != null && (allowMultipleTrails || !trails.containsKey(b)))
      trails.put(b, trail);
  }
  
  void addTransformer(F1 f) {
    allOnAll.addA(f);
  }
  
  // simple backtransformer only taking the transformed object
  void addTransformer(F1 f, F1 backTransformer) {
    addTransformer(f, backTransformer == null ? null
      : new IF2 {
        public O get(O in, O out) { ret callFIfActuallyCallable(backTransformer, out); }
        toString { ret str(backTransformer); }
      });
  }
  
  // complex backtransformer taking the original and the transformed object
  <A, C> void addTransformer(F1<A, C> f, IF2<A, C, O> backTransformer) {
    addTransformer(f);
    mapPut(backTransformers, f, backTransformer);
  }
  
  void addTransformer(F2 f) {
    addTransformer(func(O a) {
      addTransformer(func(O b) {
        callableOn_nonSynthetic(f, "get", a, b) ? f.get(a, b) : null
      });
      null;
    });
  }
  
  public bool step() { ret op.step(); }
  
  L<B> getObjects() { ret allOnAll.getBs(); }
  
  O makeTrailForTransformerApplication(O transformer, B argument) {
    ret new TransformationTrail(transformer, argument);
  }
  
  void printWithTrails() {
    pnlMap(getObjects(), b -> {
      Set _trails = trails.get(b);
      ret sfu(b) + (empty(_trails) ? ""
        : " [" + nTrails(_trails) + ": " + joinWithComma(_trails) + "]");
    });
  }
  
  // only returns the actual TransformationTrails
  Cl<TransformationTrail> getTrails(B b) {
    ret instancesOf TransformationTrail(trails.get(b));
  }
  
  Cl<TransformationTrail> getTrailsBy(B b, O transformer) {
    ret filter(getTrails(b), t -> eq(((TransformationTrail) t).transformer, transformer));
  }
  
  TransformationTrail getTrailBy(B b, O transformer) {
    ret firstThat(getTrails(b), t -> eq(((TransformationTrail) t).transformer, transformer));
  }
  
  IF2 getBackTransformer(O transformer) {
    ret backTransformers.get(transformer);
  }
}