org.snapscript.common.SparseArray Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of snap Show documentation

Dynamic scripting for the JVM

There is a newer version: 1.4.6

package org.snapscript.common;

public class SparseArray {

   private volatile Object[][] segments;
   private volatile int capacity;
   private volatile int block;

   public SparseArray(int length) {
      this(length, 32); // compute better default distribution
   }
   
   public SparseArray(int length, int block) {
      this.segments = new Object[length / block + 1][];
      this.capacity = length;
      this.block = block;
   }
   
   public T set(int index, T value) {
      int offset = index % block;
      Object[] segment = segment(index);
      Object result = segment[offset];
      
      segment[offset] = value;
      return (T)result;
   }
   
   public T get(int index) {
      int section = index /block;
      
      if(section < segments.length) {
         Object[] segment = segments[section];
         
         if(segment != null) {
            return (T)segment[index % block];
         }
      }
      return null;
   }
   
   public T remove(int index) {
      int section = index /block;
      
      if(section < segments.length) {
         Object[] segment = segments[section];
         
         if(segment != null) {
            int offset = index % block;
            Object result = segment[offset];
           
            segment[offset] = null;
            return (T)result;
         }
      }
      return null;
   }
   
   protected Object[] segment(int index) {
      int section = index /block;
      
      if(index >= capacity) {
         expand(capacity * 2 < index ? index : capacity *2);
      }
      Object[] segment = segments[section];
      
      if(segment == null) {
         segments[section] = new Object[block];
      }
      return segments[section];
   }
   
   protected void expand(int length) {
      Object[][] copy = new Object[length / block + 1][];

      for(int i = 0; i < segments.length; i++) {
         copy[i] = segments[i];
      }
      capacity = length;
      segments = copy;
   }
   
   public int length() {
      return capacity;
   }
}