Inheritance diagram for com.cliffc.aa.type.Bits.Tree:

Collaboration diagram for com.cliffc.aa.type.Bits.Tree:

Public Member Functions
int[]	get_kids (int par)

boolean	is_parent (int idx)

int	next_kid (int alias, int kid)

VBitSet	plus_kids (Bits< B > bits)

String	toString ()

Package Functions
void	_plus_kids (VBitSet bs, int i)

void	init0 ()

boolean	is_parent (int par, int kid)

int	parent (int kid)

int	peek ()

void	reset_to_init0 ()

int	split (int par)

Package Attributes
int	_cnt = 1

int[]	_init

int[][]	_kids = new int[2][]

int[]	_pars = new int[2]

Private Member Functions
SB	toString (SB sb, int i)

Detailed Description

Definition at line 402 of file Bits.java.

Member Function Documentation

◆ _plus_kids()

void com.cliffc.aa.type.Bits< B extends Bits< B >.Tree< B extends Bits< B >._plus_kids	(	VBitSet	bs,
		int	i
	)

package

Definition at line 490 of file Bits.java.

                                        {
       bs.set(i);
       int nkids = i >= _kids.length || _kids[i]==null ? 0 : _kids[i][0];
       for( int kid=1; kid<nkids; kid++ )
         _plus_kids(bs,_kids[i][kid]);
     }

References com.cliffc.aa.type.Bits.Tree._kids.

Referenced by com.cliffc.aa.type.Bits.Tree.plus_kids().

Here is the caller graph for this function:

◆ get_kids()

int [] com.cliffc.aa.type.Bits.Tree.get_kids ( int par )

Definition at line 412 of file Bits.java.

412 { assert _kids[par][0]==3; return _kids[par]; }

References com.cliffc.aa.type.Bits.Tree._kids.

◆ init0()

void com.cliffc.aa.type.Bits.Tree.init0 ( )

package

Definition at line 469 of file Bits.java.

                  {
       _init = new int[_kids.length];
       for( int i=0; i<_kids.length; i++ )
         _init[i] = _kids[i]==null ? 1 : _kids[i][0];
     }

References com.cliffc.aa.type.Bits.Tree._init, and com.cliffc.aa.type.Bits.Tree._kids.

◆ is_parent() [1/2]

boolean com.cliffc.aa.type.Bits.Tree.is_parent ( int idx )

Definition at line 410 of file Bits.java.

410 { return idx<_kids.length && _kids[idx]!=null &&_kids[idx][0]>1; }

References com.cliffc.aa.type.Bits.Tree._kids, and com.cliffc.aa.type.Bits.idx().

Referenced by com.cliffc.aa.type.Bits.Tree.next_kid(), and com.cliffc.aa.type.Bits.Tree.toString().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ is_parent() [2/2]

boolean com.cliffc.aa.type.Bits< B extends Bits< B >.Tree< B extends Bits< B >.is_parent	(	int	par,
		int	kid
	)

package

Definition at line 414 of file Bits.java.

                                           {
       for( ; par <= kid; kid = parent(kid) )
         if( par==kid ) return true;
       return false;             // Kid will be a larger number
     }

References com.cliffc.aa.type.Bits.Tree.parent().

Here is the call graph for this function:

◆ next_kid()

int com.cliffc.aa.type.Bits< B extends Bits< B >.Tree< B extends Bits< B >.next_kid	(	int	alias,
		int	kid
	)

Definition at line 500 of file Bits.java.

                                               {
       if( kid==0 ) return 0;
       boolean is_par = is_parent(kid);
       if( kid==alias && !is_par ) return 0; // Singleton bit
       // Find kid in the alias-tree
       if( is_par ) {            // Go deeper
         return _kids[kid][1];   // First child one layer deeper
       } else {                  // Leaf, unwind & find sibling
         while(kid!=alias) {
           int par = _pars[kid];    // Parent
           int[] kids = _kids[par]; // All the parents' children
           for( int i=1; i<kids[0]-1; i++ )
             if( kids[i]==kid )
               return kids[i+1]; // Return sibling
           kid=par;              // Up-parent & go again
         }
         return 0;               // Last child visited
       }
     }

References com.cliffc.aa.type.Bits.Tree._kids, com.cliffc.aa.type.Bits.Tree._pars, and com.cliffc.aa.type.Bits.Tree.is_parent().

Here is the call graph for this function:

◆ parent()

int com.cliffc.aa.type.Bits.Tree.parent ( int kid )

package

Definition at line 409 of file Bits.java.

409 { return _pars[kid]; }

References com.cliffc.aa.type.Bits.Tree._pars.

Referenced by com.cliffc.aa.type.Bits.Tree.is_parent().

Here is the caller graph for this function:

◆ peek()

int com.cliffc.aa.type.Bits.Tree.peek ( )

package

Definition at line 480 of file Bits.java.

480 { return _kids[1][_kids[1][0]]; } // for testing

References com.cliffc.aa.type.Bits.Tree._kids.

◆ plus_kids()

VBitSet com.cliffc.aa.type.Bits.Tree.plus_kids ( Bits bits )

Definition at line 483 of file Bits.java.

                                             {
       VBitSet bs = new VBitSet();
       for( int i : bits )
         if( i != 0 )
           _plus_kids(bs,i);
       return bs;
     }

References com.cliffc.aa.type.Bits.Tree._plus_kids(), and com.cliffc.aa.type.Bits.bits().

Here is the call graph for this function:

◆ reset_to_init0()

void com.cliffc.aa.type.Bits.Tree.reset_to_init0 ( )

package

Definition at line 475 of file Bits.java.

                           {
       for( int i=0; i<_kids.length; i++ )
         if( _kids[i] != null )
           _kids[i][0] = i<_init.length ? _init[i] : 1;
     }

References com.cliffc.aa.type.Bits.Tree._init, and com.cliffc.aa.type.Bits.Tree._kids.

◆ split()

int com.cliffc.aa.type.Bits.Tree.split ( int par )

package

Definition at line 433 of file Bits.java.

                        {
       // See if we have an existing bit
       if( par < _kids.length ) { // This parent has kids already
         int[] kids = _kids[par]; //
         if( kids != null ) {
           int klen = kids[0];        // Number of kids already, 1-based
           if( klen < kids.length ) { // Room for more in array?
             int bit = kids[klen];
             if( bit != 0 ) {            // Pre-allocated kid from prior test?
               assert _pars[bit] == par; // Then parent must already be preallocated
               kids[0] = klen+1;
               return bit;
             }
           }
         }
       }
       // Need a new bit
       int bit = _cnt++; // Next available bit number
  
       // Make space in the parents array to hold the parent of 'bit'
       while( bit >= _pars.length ) _pars = Arrays.copyOf(_pars,_pars.length<<1);
       assert _pars[bit]==0;
       _pars[bit] = par;
       // Make space in the kids array to hold the children of 'par'
       while( par >= _kids.length ) _kids = Arrays.copyOf(_kids,_kids.length<<1);
       int[] kids = _kids[par];  // All the children of 'par'
       if( kids==null ) _kids[par] = kids = new int[]{1};
       int klen = kids[0];       // 1-based number of children.  '1' means 'no children'
       if( klen == kids.length ) // Make space as needed
         _kids[par] = kids = Arrays.copyOf(kids,klen<<1);
       kids[klen] = bit;         // Insert new child of parent
       kids[0] = klen+1;         // Bump count of children
       return bit;
     }

References com.cliffc.aa.type.Bits.Tree._cnt, com.cliffc.aa.type.Bits.Tree._kids, and com.cliffc.aa.type.Bits.Tree._pars.

◆ toString() [1/2]

String com.cliffc.aa.type.Bits.Tree.toString ( )

Definition at line 420 of file Bits.java.

420 { return toString(new SB(),1).toString(); }

References com.cliffc.aa.type.Bits.Tree.toString().

Referenced by com.cliffc.aa.type.Bits.Tree.toString().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ toString() [2/2]

SB com.cliffc.aa.type.Bits< B extends Bits< B >.Tree< B extends Bits< B >.toString	(	SB	sb,
		int	i
	)

private

Definition at line 421 of file Bits.java.

                                      {
       sb.i().p(i).nl();
       if( is_parent(i) ) {
         sb.ii(1);
         for( int j=1; j<_kids[i][0]; j++ )
           toString(sb,_kids[i][j]);
         sb.di(1);
       }
       return sb;
     }

References com.cliffc.aa.type.Bits.Tree._kids, com.cliffc.aa.util.SB.di(), com.cliffc.aa.util.SB.i(), com.cliffc.aa.util.SB.ii(), com.cliffc.aa.type.Bits.Tree.is_parent(), com.cliffc.aa.util.SB.nl(), com.cliffc.aa.util.SB.p(), and com.cliffc.aa.type.Bits.Tree.toString().

Here is the call graph for this function:

Member Data Documentation

◆ _cnt

int com.cliffc.aa.type.Bits.Tree._cnt = 1

package

Definition at line 403 of file Bits.java.

Referenced by com.cliffc.aa.type.Bits.Tree.split().

◆ _init

int [] com.cliffc.aa.type.Bits.Tree._init

package

Definition at line 407 of file Bits.java.

Referenced by com.cliffc.aa.type.Bits.Tree.init0(), and com.cliffc.aa.type.Bits.Tree.reset_to_init0().

◆ _kids

int [][] com.cliffc.aa.type.Bits.Tree._kids = new int[2][]

package

Definition at line 406 of file Bits.java.

Referenced by com.cliffc.aa.type.Bits.Tree._plus_kids(), com.cliffc.aa.type.Bits.Tree.get_kids(), com.cliffc.aa.type.Bits.Tree.init0(), com.cliffc.aa.type.Bits.Tree.is_parent(), com.cliffc.aa.type.Bits.Tree.next_kid(), com.cliffc.aa.type.Bits.Tree.peek(), com.cliffc.aa.type.Bits.Tree.reset_to_init0(), com.cliffc.aa.type.Bits.Tree.split(), and com.cliffc.aa.type.Bits.Tree.toString().

◆ _pars

int [] com.cliffc.aa.type.Bits.Tree._pars = new int[2]

package

Definition at line 405 of file Bits.java.

Referenced by com.cliffc.aa.type.Bits.Tree.next_kid(), com.cliffc.aa.type.Bits.Tree.parent(), and com.cliffc.aa.type.Bits.Tree.split().

The documentation for this class was generated from the following file:

Bits.java

Public Member Functions

Package Functions

Package Attributes

Private Member Functions

Detailed Description

Member Function Documentation

◆ _plus_kids()

◆ get_kids()

◆ init0()

◆ is_parent() [1/2]

◆ is_parent() [2/2]

◆ next_kid()

◆ parent()

◆ peek()

◆ plus_kids()

◆ reset_to_init0()

◆ split()

◆ toString() [1/2]

◆ toString() [2/2]

Member Data Documentation

◆ _cnt

◆ _init

◆ _kids

◆ _pars