anchor.diff:      %% propogate to this node. Nodes that are never the
       %% root of a message will never have a key added to
       %% `eager_sets'
  -    eager_sets    :: #{node() := ordsets:ordset(node())} | undefined,
  +    eager_sets    :: #{node() := nodeset()} | undefined,
   
       %% A Mapping of sender node (root of each spanning tree)
       %% to this node's set of lazy peers. Elements are added
       %% to this structure as messages rooted at a node
       %% propogate to this node. Nodes that are never the root
       %% of a message will never have a key added to `lazy_sets'
  -    lazy_sets     :: #{node() := ordsets:ordset(node())} | undefined,
  +    lazy_sets     :: #{node() := nodeset()} | undefined,
   
       %% Set of registered modules that may handle messages that
       %% have been broadcast
  
positive.code: %% @doc return peers for all `Nodes' for tree rooted at `Root'
  %% Wait indefinitely for a response is returned from the process
  -spec debug_get_tree(node(), [node()]) ->
      [{node(), {ordsets:ordset(node()), ordsets:ordset(node())}}].
  
  debug_get_tree(Root, Nodes) ->
      [begin
  
negative.code:         common_lazys = CommonLazys,
          lazy_sets = LazySets
      } = State,
  
      NewAllMembers = ordsets:subtract(AllMembers, Removed),
      NewCommonEagers = ordsets:subtract(CommonEagers, Removed),
      NewCommonLazys  = ordsets:subtract(CommonLazys, Removed),
  