Distorted Android

///////////////////////////////////////////////////////////////////////////////////////////////////

// Can make this logarithmic but the typical number of children is very small anyway.

//

// We want to keep same buckets next to each other, while avoiding changes in order of the children

// (if possible!) We want to keep bucket=0 (i.e. the non-postprocessed children) at the beginning.

  static void addSortingByBuckets(ArrayList<DistortedNode> mChildren, DistortedNode newChild)

    {

    int i,num = mChildren.size();

    long bucket = newChild.getPostprocessQueue().getID();

    boolean sameBucket = false;

    for(i=0; i<num; i++)

      {

      if( mChildren.get(i).getPostprocessQueue().getID() == bucket )

        {

        sameBucket=true;

        }

      else if( sameBucket || bucket==0 )

        {

        break;

        }

      }

    mChildren.add(i,newChild);

    //android.util.Log.e("newChild", "newBucket="+bucket+" new child at "+i+" total num ="+num);

    }