# Class PivotByAlgorithm.SplitSize

java.lang.Object
com.treemap.PivotByAlgorithm.SplitSize

All Implemented Interfaces:
  `PivotByAlgorithm.Type`

Enclosing class:
  `PivotByAlgorithm`

public static class PivotByAlgorithm.SplitSize extends Object implements PivotByAlgorithm.Type
Selects the pivot that will split L1 and L3 into approximately equal total areas.

Complexity: O(n log n) average, O(n^2) worst case, where n is the number of nodes in the tree.

- ## Constructor Summary

  Constructors
  Constructor
  Description
  `SplitSize()`

- ## Method Summary

  Modifier and Type
  Method
  Description
  `int`
  `computePivotIndex(TreeMapNode[] children)`
  Compute the pivot index
  `String`
  `toString()`

  ### Methods inherited from class Object

  `clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

- ## Constructor Details

  - ### SplitSize

    public SplitSize()

- ## Method Details

  - ### computePivotIndex

    public int computePivotIndex(TreeMapNode[] children)
    Description copied from interface: `PivotByAlgorithm.Type`
    Compute the pivot index
    Specified by:
      `computePivotIndex` in interface `PivotByAlgorithm.Type`
    Parameters:
      `children` - the nodes
    Returns:
      the index of the node to use as a pivot

  - ### toString

    public String toString()
    Overrides:
      `toString` in class `Object`