Message/Util/ManakaiNode.dis

Module:
  @QName:
    Util:ManakaiNode
  @FullName:
    @@lang: en
    @@@:
      Manakai Generic Node Implementation
  @Namespace:
    http://suika.fam.cx/~wakaba/archive/2005/manakai/Util/ManakaiNode#
  
  @Description:
    @@lang:en
    @@@:
      The <Module::Util:ManakaiNode> module provides a basic 
      implementation for glaph (perhaps tree) structures. 

  @DISCore:author: DISCore|Wakaba
  @License:
     license:Perl+MPL
  @Date:
    @@@:
      $Date: 2005/09/28 04:02:00 $
    @@ContentType:
      dis:Date.RCS
  
  @Require:
    @@Module:
      @@@QName: 
        DISlib:DISPerl
      @@@WithFor:
        ManakaiDOM:all
    @@Module:
      @@@QName: Util|ManakaiNode
      @@@WithFor:
        ManakaiDOM:Perl

  @DefaultFor:
    ManakaiDOM:Perl

Namespace:
  @DIS:
    http://suika.fam.cx/~wakaba/archive/2005/manakai/Util/DIS#
  @dis:
    http://suika.fam.cx/~wakaba/archive/2004/8/18/lang#dis--
  @dis2pm:
    http://suika.fam.cx/~wakaba/archive/2004/11/8/dis2pm#
  @DISlib:
    http://suika.fam.cx/~wakaba/archive/2004/dis/
  @doc:
    http://suika.fam.cx/~wakaba/archive/2005/7/tutorial#
  @lang:
    http://suika.fam.cx/~wakaba/archive/2004/8/18/lang#
  @license:
    http://suika.fam.cx/~wakaba/archive/2004/8/18/license#
  @ManakaiDOM:
    http://suika.fam.cx/~wakaba/archive/2004/8/18/manakai-dom#
  @mn:
    http://suika.fam.cx/~wakaba/archive/2005/manakai/Util/ManakaiNode#
  @Perl:
    http://suika.fam.cx/~wakaba/archive/2004/8/18/lang#Perl--
  @rdf:
    http://www.w3.org/1999/02/22-rdf-syntax-ns#
  @rdfs:
    http://www.w3.org/2000/01/rdf-schema#
  @TreeCore:\
  @Util:
    http://suika.fam.cx/~wakaba/archive/2005/manakai/Util/

ResourceDef:
  @QName:
    Util:
  @rdf:type:
    dis:ModuleGroup
  @FullName:
    @@lang:en
    @@@:
      The manakai support modules
  @DISPerl:packageName:
    Message::Util::
  @DISPerl:interfacePackageName:
    Message::Util::IF::

## -- Internal node object

ClassDef:
  @resourceFor: ForFull
  @resourceFor: ForCompact
  @resourceFor:
    ManakaiDOM:ForIF
  
  @QName:
    @@@: NodeStem
    @@ForCheck: 
      ManakaiDOM:ForIF

  @QName: 
    @@@:
      ManakaiDOM:ManakaiDOMNodeObject
    @@ForCheck: ForFull

  @QName:
    @@@: ManakaiNodeStem
    @@ForCheck: ForCompact

  @Implement:
    @@@: NodeStem
    @@ForCheck: ForFull

  @Implement:
    @@@: NodeStem
    @@ForCheck: ForCompact

  @Description:
    @@lang:en
    @@@:
      Internal (actual) node objects that is accessed via 
      <Class::ManakaiDOM:ManakaiDOMNodeReference> objects referring it. 
  @ImplNote:
    @@lang:en
    @@@:
      No public interface should be defined for any class inheriting 
      this class - applications should access to nodes only via 
      <Class::ManakaiDOM:ManakaiDOMNodeReference> objects. 
  @ImplNote:
    @@ForCheck: ManakaiDOM|ForClass
    @@lang:en
    @@@:
      A <Class::> object is a blessed hash 
      reference.  Each hash key and value pair is called as a 
      <DFN::property>.  Currently, several core properties  
      are defined as listed below.  Applications of this class, 
      such as <Class::DOMCore:ManakaiDOMNode::ManakaiDOM:all>,
      defines additional properties for their own purpose and scope. 
      \
      {doc:fig:: <doc:caption::Core node properties>

         {doc:figBody::
         \
         - <CODE::TreeCore:origin>::: An array reference, containing 
                                  hash key names of <DFN::origin> 
                                  properties for this node. 
         \
         - <CODE::TreeCore:subnode0>::: An array reference, containing 
                                  hash key names of <DFN::subnode> 
                                  properties for this node. 
         \
         - <CODE::TreeCore:subnode>::: An array reference, containing 
                                hash key names of <DFN::subnode> list 
                                properties for this node. 
         \
         - <CODE::TreeCore:subnode2>::: An array reference, containing 
                    hash key names of <DFN::subnode> (two steps) list
                    properties for this node. 
         \
         - <CODE::TreeCore:irefnode>::: An array reference, containing 
                    hash key names of <DFN::irefnode> 
                    properties for this node. 
         \
         - <CODE::TreeCore:anydata>::: An array reference, containing 
                    hash key names of <DFN::anydata> list 
                    properties for this node. 
         \
         - <CODE::TreeCore:anydata2>::: An array reference, containing 
                    hash key names of <DFN::anydata> (two steps) list properties 
                    for this node. 
         }
       }

  @IntMethod:
    @@Name: new
    @@Description:
      @@@lang:en
      @@@@: 
        Constructs a new instance of 
        <Class::ManakaiDOM:ManakaiDOMNodeObject> and returns it.
    @@Param:
      @@@ForCheck: ForCompact
      @@@Name: className
      @@@Type: DISLang|String||ManakaiDOM|all
      @@@enDesc:
        The name of a class which is typically used as reference
        to the node.  The class <kwd:SHOULD> implement the 
        <IF::NodeRef> interface.  The <QUOTE::dis> definition
        for the class <kwd:SHOULD> play the role of <Q::mn|NodeRefRole
        ||ManakaiDOM|all>.
    @@Return:
      @@@Type: NodeStem
      @@@Description:
        @@@@lang:en
        @@@@@: 
          The newly created <Class::ManakaiDOM:ManakaiDOMNodeObject> instance.
      @@@PerlDef: 
        @@@@ForCheck: ForFull
        @@@@@:
          $r = bless {
            <Q::TreeCore:origin> => [],
            <Q::TreeCore:subnode0> => [],
            <Q::TreeCore:subnode> => [],
            <Q::TreeCore:subnode2> => [],
            <Q::TreeCore:irefnode> => [],
            <Q::TreeCore:anydata> => [],
            <Q::TreeCore:anydata2> => [],
            <H::mn:rc> => 0,
            <H::mn:treeID> => <Code::ManakaiDOM:generateUniqueID>,
            <H::mn:nodeID> => <Code::ManakaiDOM:generateUniqueID>,
          }, ref $self || $self;
      @@@PerlDef: 
        @@@@ForCheck: ForCompact
        @@@@@:
          my $grc = 0;
          $r = bless {
            <H::mn:type>   => $className,
            <H::mn:groveReferenceCounter> => \$grc,
            <H::mn:rc>     => 0,
            <H::mn:treeID> => \ (<Code::ManakaiDOM:generateUniqueID>),
            <H::mn:nodeID> => <Code::ManakaiDOM:generateUniqueID>,
          }, ref $self || $self;

  @IntMethod:
    @@Name: newReference
    @@Description:
      @@@lang:en
      @@@@:
        Creates a new reference to this node and returns it.
    @@ForCheck: ForFull
    @@Param:
      @@@Name: class
      @@@Type:
        Perl:package-name::ManakaiDOM:all
      @@@Description:
        @@@@lang:en
        @@@@@:
          A Perl class package name with which the newly created 
          reference is blessed.  The <P::class> class must be a 
          subclass of <Class::ManakaiDOM:ManakaiDOM:ManakaiDOMNodeReference>.
    @@Return:
      @@@Type: 
        ManakaiDOM:ManakaiDOMNodeReference
      @@@Description:
        @@@@lang:en
        @@@@@:
          The newly created node reference.
      @@@PerlDef:
          $r = bless {
            <H::mn:node> => $self,
          }, ref $class ? ref $class : defined $class ? $class :
             <ClassName::ManakaiDOM:ManakaiDOMNodeReference>;
          $self->{<H::mn:rc>}++;

  @ResourceDef:
    @@QName: getNewReference
    @@rdf:type:
      dis2pm:BlockCode
    @@ForCheck: ForCompact
    @@Description:
      @@@lang:en
      @@@@:
        Creates a new node reference object. 
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $object
      @@@Type: NodeStem
      @@@In:1
      @@@enDesc:
        A node object for which a reference is created.
      @@@DISPerl:paramStyle: var
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $ref
      @@@Type: NodeRef
      @@@Out:1
      @@@enDesc:
        A node reference for <P::$object>.  It may or may not 
        be same as <P::$object>.
      @@@DISPerl:paramStyle: var
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $class
      @@@Type:
        Perl:package-name::ManakaiDOM:all
      @@@enDesc:
        A package name with which <P::$ref> is blessed. 
      @@@In:1
      @@@DISPerl:paramStyle: any
    @@PerlDef:
      $object->{<H::mn:rc>}++;
      ${$object->{<H::mn:groveReferenceCounter>}}++;
      $ref = bless {
        <H::mn:node> => $object,
      }, $class;

  @ResourceDef:
    @@QName: getWeakReference
    @@rdf:type:
      dis2pm:BlockCode
    @@ForCheck: ForCompact
    @@Description:
      @@@lang:en
      @@@@:
        Creates a new weak node reference object. 
        \
        The weak node reference is actually a node reference
        except that this code fragment does not increment
        the reference count of the object.  When all non-weak 
        references to the object are destructed, then
        the object is destructed and any operation via 
        weak references will lead unexpected result.
        \
        {NOTE:: It is intended that internal code creates a weak reference
                so that it gets access to public interface. 
        \
        }
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $object
      @@@Type: NodeStem
      @@@In:1
      @@@enDesc:
        A node object for which a reference is created.
      @@@DISPerl:paramStyle: var
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $ref
      @@@Type: NodeRef
      @@@Out:1
      @@@enDesc:
        A node reference for <P::$object>.  It may or may not 
        be same as <P::$object>.
      @@@DISPerl:paramStyle: var
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $class
      @@@Type:
        Perl:package-name::ManakaiDOM:all
      @@@enDesc:
        A package name with which <P::$ref> is blessed. 
      @@@In:1
      @@@DISPerl:paramStyle: any
    @@PerlDef:
      $ref = bless {
        <H::mn:node> => $object,
        <H::mn:isWeak> => true,
      }, $class;

  @ResourceDef:
    @@QName: getWeakRef
    @@rdf:type:
      dis2pm:InlineCode
    @@ForCheck: ForFull
    @@Description:
      @@@lang:en
      @@@@:
        Creates a new weak node reference object. 
        \
        The weak node reference is actually a node reference
        except that this code fragment does not increment
        the reference count of the object.  When all non-weak 
        references to the object are destructed, then
        the object is destructed and any operation via 
        weak references will lead unexpected result.
        \
        {NOTE:: It is intended that internal code creates a weak reference
                so that it gets access to public interface. 
        \
        }
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $object
      @@@Type: NodeStem
      @@@In:1
      @@@enDesc:
        A node object for which a reference is created.
      @@@DISPerl:paramStyle: var
    @@ResourceDef:
      @@@rdf:type:
        DISPerl:CodeParameter
      @@@Name: $class
      @@@Type:
        Perl:package-name::ManakaiDOM:all
      @@@enDesc:
        A package name with which <P::$ref> is blessed. 
      @@@In:1
      @@@DISPerl:paramStyle: any
    @@PerlDef:
      (bless {
        <H::mn:node> => $object,
        <H::mn:isWeak> => true,
      }, $class)

  @IntMethod:
    @@Name: isExternallyReferred
    @@Description:
      @@@lang:en
      @@@@:
        Checks whether the tree containing this node has been referred 
        from the outside of the tree or not. 
    @@Return:
      @@@Type: 
        DISPerl:Boolean::ManakaiDOM:all
      @@@InCase:
        @@@@Value:
          @@@@@@:1
          @@@@@ContentType: DISCore|Boolean
        @@@@Description:
          @@@@@lang:en
          @@@@@@: 
            There is one or more nodes in the tree that has been 
            referred via <Class::ManakaiDOM:ManakaiDOMNodeReference> objects.
      @@@InCase:
        @@@@Value:
          @@@@@@:0
          @@@@@ContentType: DISCore|Boolean
        @@@@Description:
          @@@@@lang:en
          @@@@@@: No external reference found.
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
          if ($self->{<H::mn:rc>}) {
            $r = true;
          } else {
            my @node = ($self);
            my %checked;
            NODES: while (@node) {
              my $node = shift @node;
              next NODES unless UNIVERSAL::isa ($node,
                           <ClassName::ManakaiDOM:ManakaiDOMNodeObject>);
              if ($node->{<H::mn:rc>}) {
                $r = true;
                last NODES;
              } elsif ($checked{$node->{<H::mn:nodeID>}}) {
                next NODES;
              }
              my @n;
              for my $p (@{$node->{<Q::TreeCore:subnode2>}}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$node->{<Q::TreeCore:subnode>}}) {
                if (ref $p eq 'ARRAY') {
                  push @node, @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, values %$p;
                }
              }
              for my $p (@{$node->{<Q::TreeCore:origin>}}) {
                unshift @node, $node->{$p} if $node->{$p};
                ## NOTE: Puts the top of the list,
                ##       since upper-level nodes are expected to be referred
                ##       more than lower-levels.
              }
              for my $p (@{$node->{<Q::TreeCore:subnode0>}}) {
                push @node, $node->{$p} if $node->{$p};
              }
              $checked{$node->{<H::mn:nodeID>}} = true;
            }
          }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          if ($self->{<H::mn:rc>}) {
            $r = true;
          } else {
            my @node = ($self);
            my %checked;
            NODES: while (@node) {
              my $node = shift @node;
              next NODES unless ref $node;
              if ($node->{<H::mn:rc>}) {
                $r = true;
                last NODES;
              } elsif ($checked{$node->{<H::mn:nodeID>}}) {
                next NODES;
              }
              my @n;
              my $nt = $Message::Util::ManakaiNode::ManakaiNodeRef::Prop{
                $node->{<H::mn:type>}
              }; 
              for my $p (@{$nt->{<H::mn:subnode2>}}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$nt->{<H::mn:subnode1>}}) {
                if (ref $p eq 'ARRAY') {
                  push @node, @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, values %$p;
                }
              }
              for my $p (@{$nt->{<H::mn:origin0>}}) {
                unshift @node, $node->{$p} if $node->{$p};
                ## NOTE: Puts the top of the list,
                ##       since upper-level nodes are expected to be referred
                ##       more than lower-levels.
              }
              for my $p (@{$nt->{<H::mn:subnode0>}}) {
                push @node, $node->{$p} if $node->{$p};
              }
              $checked{$node->{<H::mn:nodeID>}} = true;
            }
          }

  @ResourceDef:
    @@QName: mn|isGroveReferenced
    @@rdf:type: DISPerl|InlineCode
    @@PerlDef:
      (${$node->{<H::mn:groveReferenceCounter>}} > 0)
    @@ForCheck: ForCompact

  @IntMethod:
    @@Name: destroy
    @@Description:
      @@@lang:en
      @@@@:
        Destructs the tree containing this node. 
    @@Return:
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
        my @node = ($self);
        NODES: while (@node) {
              my $node = shift @node;
              my @n;
              for my $p (@{$node->{<Q::TreeCore:subnode2>}}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$node->{<Q::TreeCore:subnode>}}) {
                if (ref $p eq 'ARRAY') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and defined $_->{<H::mn:nodeID>}} @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and defined $_->{<H::mn:nodeID>}}
                               values %$p;
                }
              }
              for my $p (@{$node->{<Q::TreeCore:origin>}},
           \             @{$node->{<Q::TreeCore:subnode0>}}) {
                push @node, $node->{$p}
                  if defined $node->{$p} and
                     defined $node->{$p}->{<H::mn:nodeID>};
              }
          %$node = ();
        }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
        my @node = ($self);
        NODES: while (@node) {
          my $node = shift @node;
          next NODES unless ref $node and defined $node->{<H::mn:nodeID>};
          my @n;
              my $nt = $Message::Util::ManakaiNode::ManakaiNodeRef::Prop{
                $node->{<H::mn:type>}
              }; 
              for my $p (@{$nt->{<H::mn:subnode2>}||[]}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$nt->{<H::mn:subnode1>}||[]}) {
                if (ref $p eq 'ARRAY') {
                  push @node, @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, values %$p;
                }
              }
              for my $p (@{$nt->{<H::mn:origin0>}||[]},
           \             @{$nt->{<H::mn:subnode0>}||[]}) {
                push @node, $node->{$p};
              }
          %$node = ();
        }
    @@ImplNote:
      @@@lang:en
      @@@@:
        This method is different from Perl <Perl::DESTROY> special 
        purpose method.
        \
        An <QUOTE::uninitialized> warning in this method might mean 
        some method puts an <Perl::undef> into a list of nodes. 

  @IntMethod:
    @@Name: importTree
    @@Description:
      @@@lang:en
      @@@@:
        Changes the tree identifier of the nodes belong to another tree 
        to be same as this node's tree identifier. 
    @@Param:
      @@@Name: node
      @@@Type: 
        ManakaiDOM:ManakaiDOMNodeObject
      @@@Description:
        @@@@lang:en
        @@@@@:
          Any node from the tree to change its identifier. 
    @@Return:
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
        unless ($node->{<H::mn:treeID>} eq
                $self->{<H::mn:treeID>}) {
          my @node = ($node);
          NODES: while (@node) {
            my $node = shift @node;
            next NODES unless UNIVERSAL::isa ($node,
                         <ClassName::ManakaiDOM:ManakaiDOMNodeObject>);
              my @n;
              for my $p (@{$node->{<Q::TreeCore:subnode2>}}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$node->{<Q::TreeCore:subnode>}}) {
                if (ref $p eq 'ARRAY') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and $_->{<H::mn:treeID>} ne
                                    $self->{<H::mn:treeID>}} @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and $_->{<H::mn:treeID>} ne
                                    $self->{<H::mn:treeID>}}
                              values %$p;
                }
              }
            for my $p (@{$node->{<Q::TreeCore:origin>}},
           \           @{$node->{<Q::TreeCore:subnode0>}}) {
              push @node, $node->{$p}
                if defined $node->{$p} and
                   $node->{$p}->{<H::mn:treeID>} ne
                   $self->{<H::mn:treeID>};
            }
            $node->{<H::mn:treeID>} = $self->{<H::mn:treeID>};
          }
        }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          my @node = ($node);
          my $newgrc = $self->{<H::mn:groveReferenceCounter>};
          my $newtid = $self->{<H::mn:treeID>};
          NODES: while (@node) {
            my $node = shift @node;
            next NODES unless ref $node;
            next NODES if ${$node->{<H::mn:treeID>}} eq $$newtid;
            my @n;
              my $nt = $Message::Util::ManakaiNode::ManakaiNodeRef::Prop{
                $node->{<H::mn:type>}
              }; 
              for my $p (@{$nt->{<H::mn:subnode2>}||[]}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$nt->{<H::mn:subnode1>}||[]}) {
                if (ref $p eq 'ARRAY') {
                  push @node, @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, values %$p;
                }
              }
            for my $p (@{$nt->{<H::mn:origin0>}||[]},
           \           @{$nt->{<H::mn:subnode0>}||[]}) {
              push @node, $node->{$p};
            }

            ${$node->{<H::mn:groveReferenceCounter>}} -= $node->{<H::mn:rc>};
            $node->{<H::mn:treeID>} = $newtid;
            $node->{<H::mn:groveReferenceCounter>} = $newgrc;
            ${$node->{<H::mn:groveReferenceCounter>}} += $node->{<H::mn:rc>};
          }

  @IntMethod:
    @@Name: changeTreeID
    @@Description:
      @@@lang:en
      @@@@:
        Changes tree identifier of all nodes traversable from this node. 
    @@Param:
      @@@Name: treeID
      @@@Type: 
        DISPerl:String::ManakaiDOM:all
      @@@Description:
        @@@@lang:en
        @@@@@:
          The new tree identifier. 
       @@@InCase:
        @@@@Type: DISPerl|SCALAR||ManakaiDOM|all
        @@@@enDesc:
          A reference to the new tree identifier.
          The tree will reference the identifier as it.
    @@Param:
      @@@ForCheck: ForCompact
      @@@Name: groveRC
      @@@Type: DISPerl|SCALAR||ManakaiDOM|all
      @@@enDesc:
        The new reference counter.
    @@Return:
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
        unless ($self->{<H::mn:treeID>} eq $treeID) {
          my @node = ($self);
          NODES: while (@node) {
            my $node = shift @node;
            next NODES unless UNIVERSAL::isa ($node,
                        <ClassName::ManakaiDOM:ManakaiDOMNodeObject>);
              my @n;
              for my $p (@{$node->{<Q::TreeCore:subnode2>}}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$node->{<Q::TreeCore:subnode>}}) {
                if (ref $p eq 'ARRAY') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and
                                    $_->{<H::mn:treeID>} ne $treeID} @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, grep {UNIVERSAL::isa ($_,
                                    <ClassName::ManakaiDOM:ManakaiDOMNodeObject>)
                                    and $_->{<H::mn:treeID>} ne $treeID}
                              values %$p;
                }
              }
            for my $p (@{$node->{<Q::TreeCore:origin>}},
       \               @{$node->{<Q::TreeCore:subnode0>}}) {
              push @node, $node->{$p}
                if defined $node->{$p} and
                   $node->{$p}->{<H::mn:treeID>} ne $treeID;
            }
            $node->{<H::mn:treeID>} = $treeID;
          }
        }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          my $tid = ref $treeID ? $treeID : \$treeID;
          my @node = ($self);
          NODES: while (@node) {
            my $node = shift @node;
            next NODES unless ref $node;
            next NODES if ${$node->{<H::mn:treeID>}} eq $$tid;
              my @n;
              my $nt = $Message::Util::ManakaiNode::ManakaiNodeRef::Prop{
                $node->{<H::mn:type>}
              }; 
              for my $p (@{$nt->{<H::mn:subnode2>}||[]}) {
                if (ref $node->{$p} eq 'ARRAY') {
                  push @n, @{$node->{$p}};
                } elsif (ref $node->{$p} eq 'HASH') {
                  push @n, values %{$node->{$p}};
                }
              }
              for my $p (@n,
                         map {$node->{$_}} @{$nt->{<H::mn:subnode1>}||[]}) {
                if (ref $p eq 'ARRAY') {
                  push @node, @$p;
                } elsif (ref $p eq 'HASH') {
                  push @node, values %$p;
                }
              }
            for my $p (@{$nt->{<H::mn:origin0>}||[]},
       \               @{$nt->{<H::mn:subnode0>}||[]}) {
              push @node, $node->{$p};
            }

            ${$node->{<H::mn:groveReferenceCounter>}} -= $node->{<H::mn:rc>};
            $node->{<H::mn:treeID>} = $tid;
            $node->{<H::mn:groveReferenceCounter>} = $groveRC;
            ${$node->{<H::mn:groveReferenceCounter>}} += $node->{<H::mn:rc>};
          }

  @IntMethod:
    @@Name: isSameNode
    @@Description:
      @@@lang:en
      @@@@:
        Returns whether a node is the same as this node or not. 
        \
        {NOTE:: The sameness is different from the equality; 
                two nodes are same iff they are same hash reference. 
        \
        }
    @@Operator:
      @@@ContentType:
        lang:Perl
      @@@@: eq
    @@Param:
      @@@Name: node
      @@@Type: NodeStem
      @@@Description:
        @@@@lang:en
        @@@@@:
          A node to compare with. 
    @@Return:
      @@@Type: 
        DISPerl:Boolean::ManakaiDOM:all
      @@@Description:
        @@@@lang:en
        @@@@@: Whether the two nodes are same or not.
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
          if (ref $node and
              UNIVERSAL::isa ($node,
                              <ClassName::ManakaiDOM:ManakaiDOMNodeObject>) and
              $node->{<H::mn:nodeID>} eq $self->{<H::mn:nodeID>}) {
            $r = true;
          }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          if (ref $node and
              UNIVERSAL::isa ($node, <ClassName::ManakaiNodeStem>) and
              $node->{<H::mn:nodeID>} eq $self->{<H::mn:nodeID>}) {
            $r = true;
          }
  @IntMethod:
    @@Name: orphanate
    @@Description:
      @@@lang:en
      @@@@:
        Notifies that this node (and its neibors if any) is no longer 
        part of the main tree.  If the new tree containing this node 
        has been referred yet, then the tree is preserved except its 
        tree identifier has changed.  Otherwise, i.e. the tree is 
        useless any more, then it is destructed. 
        \
        {NOTE:: Interaction on deleting a relationship from multiply 
                organized <QUOTE::trees> (such as DOM tree and 
                styled displaying tree) is less studied.  This 
                method might be modified or addition of another method(s) 
                might be required when style sheet, XBL, or other 
                technologies has been implemented.
        \
        }
    @@Return:
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
          if ($self-><M::NodeStem.isExternallyReferred>) {
            $self-><M::NodeStem.changeTreeID>
                         (<Code::ManakaiDOM:generateUniqueID>);
          } else {
            $self-><M::NodeStem.destroy>;
          }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          if ($self-><M::NodeStem.isExternallyReferred>) {
            my $grc = 0;
            $self-><M::NodeStem.changeTreeID>
                         (\(<Code::ManakaiDOM:generateUniqueID>), \$grc);
          } else {
            $self-><M::NodeStem.destroy>;
          }
##NodeStem

## -- Public node object

ClassDef:
  @resourceFor: ForFull
  @resourceFor: ForCompact
  @resourceFor: 
    ManakaiDOM:ForIF

  @QName:
    @@@: NodeRef
    @@ForCheck:
      ManakaiDOM:ForIF

  @QName: 
    @@@:
      ManakaiDOM:ManakaiDOMNodeReference
    @@ForCheck: ForFull

  @Implement:
    @@@: NodeRef
    @@ForCheck: ForFull

  @QName:
    @@@: ManakaiNodeRef
    @@ForCheck: ForCompact

  @Implement:
    @@@: NodeRef
    @@ForCheck: ForCompact

  @DISLang:role:
    @@@: mn|NodeRefRole
    @@ForCheck: ForCompact

  @Description:
    @@lang:en
    @@@:
      References to the node object corresponding to it.  From 
      applications' view, any node object is hidden and 
      <Class::ManakaiDOM:ManakaiDOMNodeReference> seems as if 
      the node itself. 
  @ImplNote:
    @@lang:en
    @@@:
      {P:: A <Class::ManakaiDOM:ManakaiDOMNodeReference> is a blessed hash 
      reference; currently there is a hash key defined:
        \
        - <CODE::TreeCore:node>::: A node object 
             (<Class::ManakaiDOM:ManakaiDOMNodeObject>) to which 
             this is referring. 
        
        - <CODE::TreeCore:isWeak>::: Whether the reference is <QUOTE::weak>
             or not.
      }

  @ResourceDef: 
    @@Name: free
    @@rdf:type: DISLang|Method
    @@enDesc:
      Frees the grove referenced by this object.  Once
      this operation is done, results of operations to objects belonging
      to the grove are unknown.
    @@ForCheck: ForCompact
    @@Return:
      @@@PerlDef:
        $self->{<H::mn:node>}-><M::NodeStem.destroy>;

  @IntMethod:
    @@Name: destroy
    @@Description:
      @@@lang:en
      @@@@: Destroy this reference object.
    @@Operator:
      @@@ContentType:
        lang:Perl
      @@@@: DESTROY
    @@Return:
      @@@PerlDef:
        @@@@ForCheck: ForFull
        @@@@@:
          my $node = $self->{<H::mn:node>};
          if ($node) {
            CORE::delete $self->{<H::mn:node>};
            unless ($self->{<H::mn:isWeak>}) {
              $node->{<H::mn:rc>}--;
              unless ($node-><M::NodeStem.isExternallyReferred>) {
                $node-><M::NodeStem.destroy>;
              }
            }
          } else {
            warn ref ($self) . q{->DESTROY: there is no associated }.
                 q{node object - you have a global variable or }.
                 qq{potential memory-leak detected\n};
          }
      @@@PerlDef:
        @@@@ForCheck: ForCompact
        @@@@@:
          my $node = $self->{<H::mn:node>};
          if ($node) {
            CORE::delete $self->{<H::mn:node>};
            unless ($self->{<H::mn:isWeak>}) {
              $node->{<H::mn:rc>}--;
              ${$node->{<H::mn:groveReferenceCounter>}}--;
              unless (<Code::isGroveReferenced:: $node = $node>) {
                $node-><M::NodeStem.destroy>;
              }
            }
          } else {
            warn ref ($self) . q{->DESTROY: there is no associated }.
                 q{node object - you have a global variable or }.
                 qq{potential memory-leak detected\n};
          }
       @@@@ImplNote:
         @@@@@lang:en
         @@@@@@:
           {P::Warning during the global destruction might mean:
              \
              - there be a loop in the manakai internal implementation - 
                it should be a bug.
              \
              - there be a loop created by application, e.g. 
                event handler containing a reference to any node 
                belonging to the same tree.
              \
              - there be a global variable that contains a node reference 
                and it is not altered or <Perl::undef>ed until the global 
                destruction. 
              \
              - or other unknown bad situation.
              \
            }
    @@ImplNote:
      @@@lang:en
      @@@@:
        Don't override this method unintentionally - for example, 
        inheritting <PerlModule::Tie::Array> would hide this method 
        from that class, since that module defines its own 
        destructor. 
##NodeRef

ResourceDef:
  @QName: mn|NodeRefRole
  @rdf:type: DISLang|Role
  @For: =ManakaiDOM|all
  @enDesc: 
    The <QUOTE::dis> definition for a class which plays the role
    of <Q::mn|NodeRefRole> provides a set of <QUOTE::dis> properties such
    as <Q::mn|subnode0> which identify the set of object internal
    property names (or hash key names) used to construct groves.

PropDef:
  @QName: mn|type
  @mn:stemName: t

PropDef:
  @QName: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList

PropDef:
  @QName: mn|subnode0
  @enDesc:
    A property of type <Q::mn|subnode0> takes a value of 
    reference to another node (<Q::mn|NodeStem||ManakaiDOM|Perl>)
    in the same grove.  The referenced node is considered
    to make a part of the node and just one <Q::mn|origin0>
    property of the referenced node <kwd:MUST> have a reference
    to the node.  That is, these properties shows
    a origin-subnode-relationship.
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: s0

PropDef:
  @QName: mn|subnode1
  @enDesc:
    A property of type <Q::mn|subnode1> is similar to <Q::mn|subnode0>
    properties, but its value is an array or hash reference whose
    values are references to subnodes.
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: s

PropDef:
  @QName: mn|subnode2
  @enDesc:
    A property of type <Q::mn|subnode2> is similar to <Q::mn|subnode1>
    properties, but its value is an array or hash reference whose
    values are array or hash references whose values are
    references to subnodes.
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: s2

PropDef:
  @QName: mn|origin0
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: o

PropDef:
  @QName: mn|irefnode0
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: i

PropDef:
  @QName: mn|anydata1
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: a1

PropDef:
  @QName: mn|anydata2
  @rdfs:subPropertyOf: mn|noderef
  @dataType: DISCore|QName
  @multipleProperties: DISCore|UnorderedList
  @mn:stemName: a2

PropDef:
  @QName: mn|nodeID
  @enDesc:
    The globally unique identifier of the node.
  @mn:stemName: nid

PropDef:
  @QName: mn|treeID
  @enDesc:
    The globally unique identifier of the grove to which the
    node belongs.
  @mn:stemName: tid

PropDef:
  @QName: mn|rc
  @enDesc:
    The number of the reference that points the node.
  @mn:stemName: rc

PropDef:
  @QName: mn|groveReferenceCounter
  @enDesc:
    A reference to the number of references that reference
    a node in the grove.
  @mn:stemName: grc

PropDef:
  @QName: mn|node
  @mn:refName: node
  @rdfs:domain: mn|NodeRef||ManakaiDOM|Perl
  @rdfs:range: mn|NodeStem||ManakaiDOM|Perl

PropDef:
  @QName: mn|isWeak
  @enDesc:
    Whether a reference is weak or not. 
  @rdfs:domain: mn|NodeRef||ManakaiDOM|Perl
  @Type: DISPerl|Boolean
  @mn:refName: w

PropDef:
  @QName: mn|stemName
  @enDesc:
    The key name of the property when it is used in <Class::ManakaiNodeStem
    ::ManakaiDOM:Perl>.
  @dataType: DISCore|String
  @multipleProperties: DISCore|Single
  @rdfs:domain: rdfs|Property
  @rdfs:subPropertyOf: DISPerl|propHashKey

PropDef:
  @QName: mn|refName
  @enDesc:
    The key name of the property when it is used in <Class::ManakaiNodeRef
    ::ManakaiDOM:Perl>.
  @dataType: DISCore|String
  @multipleProperties: DISCore|Single
  @rdfs:domain: rdfs|Property
  @rdfs:subPropertyOf: DISPerl|propHashKey

ElementTypeBinding:
  @Name:PropDef
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      rdf:Property
    @@For: =ManakaiDOM|all

ElementTypeBinding:
  @Name:enDesc
  @ElementType:
    dis:Description
  @ShadowContent:
    @@lang:en

## -- Frequently used code fragments

ResourceDef:
  @QName:
    ManakaiDOM:generateUniqueID
  @rdf:type:
    dis2pm:InlineCode
  @Description:
    @@lang:en
    @@@:
      Generates a global-unique opaque string. 
      \
      {NOTE:: A URI reference is generated by this code. 
      \
      }

  @For: =ManakaiDOM|Perl

  @PerlDef:
      (
        sprintf 'tag:suika.fam.cx,2005-09:%x:%x%s',
                time, $$,
                ['A'..'Z', 'a'..'z', '0'..'9']->[rand 62] .
                ['A'..'Z', 'a'..'z', '0'..'9']->[rand 62] .
                ['A'..'Z', 'a'..'z', '0'..'9']->[rand 62] .
                ['A'..'Z', 'a'..'z', '0'..'9']->[rand 62] .
                ['A'..'Z', 'a'..'z', '0'..'9']->[rand 62]
      )
##ManakaiDOM:generateUniqueID

## -- lang:dis vocabulary

TreeElementType:
  @QName:
    dis:GetProp
  @dataType:
    dis:TypeQName
  @rdfs:range:
    rdf:Property
  @Description:
    @@lang:en
    @@@:
      Gets the non-nodal value of a <Class::ManakaiDOM:ManakaiDOMNodeReference> 
      property (actualy <Class::ManakaiDOM:ManakaiDOMNodeObject> property). 

TreeElementType:
  @QName:
    dis:SetProp
  @dataType:
    dis:TypeQName
  @rdfs:range:
    rdf:Property
  @Description:
    @@lang:en
    @@@:
      Sets the non-nodal value of a <Class::ManakaiDOM:ManakaiDOMNodeReference> 
      property (actualy <Class::ManakaiDOM:ManakaiDOMNodeObject> property). 

## -- Syntax sugar

ElementTypeBinding:
  @Name: TreeElementType
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      DISLang:TreeElementType
    @@For: =ManakaiDOM|all

ElementTypeBinding:
  @Name: ClassDef
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      @@@@:
        dis:MultipleResource
      @@@ForCheck:
        !ForFull !ForCompact !ManakaiDOM:ForIF
    @@rdf:type:
      @@@@: DISLang|Interface
      @@@ForCheck: ManakaiDOM|ForIF
    @@rdf:type:
      @@@@: DISLang|Class
      @@@ForCheck: ForFull
    @@rdf:type:
      @@@@: DISLang|Class
      @@@ForCheck: ForCompact
    @@ForCheck: ManakaiDOM|Perl

ForDef:
  @QName:
    mn:ForFull
  @ISA: ManakaiDOM|ForClass

ForDef:
  @QName:
    mn:ForCompact
  @ISA: ManakaiDOM|ForClass

ElementTypeBinding:
  @Name: IntMethod
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      DISLang:Method
    @@ManakaiDOM:isForInternal:1

ElementTypeBinding:
  @Name: Return
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      DISLang:MethodReturn

ElementTypeBinding:
  @Name: Param
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      DISLang:MethodParameter

ElementTypeBinding:
  @Name: PerlDef
  @ElementType:
    dis:Def
  @ShadowContent:
    @@ContentType:
      lang:Perl

ElementTypeBinding:
  @Name: InCase
  @ElementType:
    dis:ResourceDef
  @ShadowContent:
    @@rdf:type:
      ManakaiDOM:InCase