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