anchor.diff:  
   processTree(Tree, Opts) when is_map(Opts) ->
           OpList = buildOpList(undefined, [], Opts, processOps(), []),
  -        applyTransforms(Tree, OpList).
  +        inlineRewrite(applyTransforms(OpList), Tree).
   
   %% ------------------------------------------------------------------
   %% Internal Function Definitions
  
positive.code: 	end,
  	accumulate(Operator, NodeAcc, fastConcat(Rest, maps:get(children, Node, []))).
  
  filter(Operator, Node) when is_function(Operator), is_map(Node) ->
  	case maps:find(data, Node) of
  		{ok, Data} -> maps:put(data, [ Datum || Datum <- Data, Operator(Datum, Id, Name)], Node);
  		error -> Node
  	end.
  
  map(Operator, Node) when is_function(Operator), is_map(Node) ->
  	case maps:find(data, Node) of
  		{ok, Data} -> maps:put(data, [ Operator(Datum, Id, Name) || Datum <- Data], Node);
  		error -> Node
  	end.
  
  transform(Operator, Node) when is_function(Operator), is_map(Node) ->
  	case maps:find(data, Node) of
  		{ok, Data} ->
  			NewData = case Operator(Data, Id, Name) of
  
negative.code:         end;
  buildOpList(_Last, [], #{}, _Seq, List) -> List.
  
  applyTransforms(Ops) when is_list(Ops) ->
          fun(Node) when is_map(Node) ->
                  lists:foldl(fun(Op, NodeIn) when is_function(Op), is_map(NodeIn)-> Op(NodeIn) end, Node, Ops)
          end.
  
  buildFilterFun(Op, <<"name">>) -> 
          fun(Tree) ->
  