Examples of javax.swing.SizeSequence

javax.swing.SizeSequence
A SizeSequence object efficiently maintains an ordered list of sizes and corresponding positions. One situation for which SizeSequence might be appropriate is in a component that displays multiple rows of unequal size. In this case, a single SizeSequence object could be used to track the heights and Y positions of all rows.
Another example would be a multi-column component, such as a JTable, in which the column sizes are not all equal. The JTable might use a single SizeSequence object to store the widths and X positions of all the columns. The JTable could then use the SizeSequence object to find the column corresponding to a certain position. The JTable could update the SizeSequence object whenever one or more column sizes changed.
The following figure shows the relationship between size and position data for a multi-column component.

In the figure, the first index (0) corresponds to the first column, the second index (1) to the second column, and so on. The first column's position starts at 0, and the column occupies size₀ pixels, where size₀ is the value returned by getSize(0). Thus, the first column ends at size₀ - 1. The second column then begins at the position size₀ and occupies size₁ (getSize(1)) pixels.
Note that a SizeSequence object simply represents intervals along an axis. In our examples, the intervals represent height or width in pixels. However, any other unit of measure (for example, time in days) could be just as valid.
Implementation Notes
Normally when storing the size and position of entries, one would choose between storing the sizes or storing their positions instead. The two common operations that are needed during rendering are: getIndex(position) and setSize(index, size). Whichever choice of internal format is made one of these operations is costly when the number of entries becomes large. If sizes are stored, finding the index of the entry that encloses a particular position is linear in the number of entries. If positions are stored instead, setting the size of an entry at a particular index requires updating the positions of the affected entries, which is also a linear calculation.
Like the above techniques this class holds an array of N integers internally but uses a hybrid encoding, which is halfway between the size-based and positional-based approaches. The result is a data structure that takes the same space to store the information but can perform most operations in Log(N) time instead of O(N), where N is the number of entries in the list.
Two operations that remain O(N) in the number of entries are the insertEntries and removeEntries methods, both of which are implemented by converting the internal array to a set of integer sizes, copying it into the new array, and then reforming the hybrid representation in place. @author Philip Milne @since 1.3

  }
  
  private void testConstructor1(TestHarness harness)
  {
    harness.checkPoint("()");
    SizeSequence s = new SizeSequence();  
    harness.check(Arrays.equals(s.getSizes(), new int[0]));
  }

View Full Code Here

  
  private void testConstructor2(TestHarness harness)
  {
    harness.checkPoint("(int)");
    
    SizeSequence s = new SizeSequence(3);
    harness.check(Arrays.equals(s.getSizes(), new int[3]));
    
    // try negative
    boolean pass = false;
    try
      {
        s = new SizeSequence(-1);
      }
    catch (NegativeArraySizeException e)
      {
        pass = true;  
      }

View Full Code Here

  }
  
  private void testConstructor3(TestHarness harness)
  {
    harness.checkPoint("(int, int)");
    SizeSequence s = new SizeSequence(3, 5);
    harness.check(Arrays.equals(s.getSizes(), new int[] {5, 5, 5}));


    // try negative
    boolean pass = false;
    try
      {
        s = new SizeSequence(-1, 5);
      }
    catch (NegativeArraySizeException e)
      {
        pass = true;  
      }

View Full Code Here


  private void testConstructor4(TestHarness harness)
  {
    harness.checkPoint("(int[])");
    int[] sizes = new int[] {1, 2, 3};
    SizeSequence s = new SizeSequence(sizes);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
    sizes[0] = 99;
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
    
    // try null
    boolean pass = false;
    try
    {
      s = new SizeSequence(null);
    }
    catch (NullPointerException e)
    {
      pass = true;
    }

View Full Code Here


public class setSize implements Testlet {


  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence(new int[] {1, 2, 3});
    s.setSize(0, 3);
    harness.check(s.getSize(0), 3);
    
    // the spec says that the behaviour for indices outside the bounds is
    // unspecified.  The following throw no exceptions, but that can't be
    // relied upon...
    s.setSize(-1, 3);
    s.setSize(3, 3);
  }

View Full Code Here


public class getSize implements Testlet
{
  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence(new int[] {1, 2, 3});
    harness.check(s.getSize(0), 1);
    harness.check(s.getSize(1), 2);
    harness.check(s.getSize(2), 3);
    
    // the spec states that indices outside the valued range have no specified
    // behaviour, but they seem to return zero...
    
    // try negative index
    harness.check(s.getSize(-1), 0);
    
    // try index too large
    harness.check(s.getSize(3), 0);
  }

View Full Code Here


public class getIndex implements Testlet
{
  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence(new int[] {1, 2, 3});
    harness.check(s.getIndex(0), 0);
    harness.check(s.getIndex(1), 1);
    harness.check(s.getIndex(2), 1);
    harness.check(s.getIndex(3), 2);
    harness.check(s.getIndex(4), 2);
    harness.check(s.getIndex(5), 2);
    harness.check(s.getIndex(6), 3);
    harness.check(s.getIndex(7), 3);
    harness.check(s.getIndex(99), 3);
    harness.check(s.getIndex(-1), 0);
    
    s = new SizeSequence();
    harness.check(s.getIndex(-1), 0);
    harness.check(s.getIndex(0), 0);
    harness.check(s.getIndex(1), 0);
  }

View Full Code Here


public class removeEntries implements Testlet
{
  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence(new int[] {1, 2, 3});
    s.removeEntries(0, 0);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
    s.removeEntries(2, 0);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
    s.removeEntries(0, 2);
    harness.check(Arrays.equals(s.getSizes(), new int[] {3}));
    s.removeEntries(0, 1);
    harness.check(Arrays.equals(s.getSizes(), new int[0]));
  
    s = new SizeSequence(new int[] {1, 2, 3, 4, 5});
    s.removeEntries(3, 2);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
   
  }

View Full Code Here


public class insertEntries implements Testlet
{
  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence();
    s.insertEntries(0, 1, 1);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1}));
    s.insertEntries(1, 2, 2);
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 2}));
    s.insertEntries(0, 2, 3);
    harness.check(Arrays.equals(s.getSizes(), new int[] {3, 3, 1, 2, 2}));
    s.insertEntries(0, 0, 99);
    harness.check(Arrays.equals(s.getSizes(), new int[] {3, 3, 1, 2, 2}));
    s.insertEntries(4, 0, 99);
    harness.check(Arrays.equals(s.getSizes(), new int[] {3, 3, 1, 2, 2}));
  }

View Full Code Here


public class setSizes implements Testlet
{
  public void test(TestHarness harness)
  {
    SizeSequence s = new SizeSequence();
    int[] sizes = new int[] {1, 2, 3};
    s.setSizes(sizes);
    harness.check(Arrays.equals(s.getSizes(), sizes));
    sizes[0] = 99;
    harness.check(Arrays.equals(s.getSizes(), new int[] {1, 2, 3}));
    
    boolean pass = false;
    try
    {
      s.setSizes(null);
    }
    catch (NullPointerException e)
    {
      pass = true;
    }

View Full Code Here

TOP

Related Classes of javax.swing.SizeSequence

gnu.testlet.javax.swing.SizeSequence.constructors

gnu.testlet.javax.swing.SizeSequence.getIndex

gnu.testlet.javax.swing.SizeSequence.getSize

gnu.testlet.javax.swing.SizeSequence.getSizes

gnu.testlet.javax.swing.SizeSequence.insertEntries

gnu.testlet.javax.swing.SizeSequence.removeEntries

gnu.testlet.javax.swing.SizeSequence.setSize

gnu.testlet.javax.swing.SizeSequence.setSizes

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of javax.swing.SizeSequence

Implementation Notes

Related Classes of javax.swing.SizeSequence