Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class nArray {
- int[] dims;
- int[] mults;
- int[] vals;
- nArray(int ... d) {
- int sum = 1;
- int len = d.length;
- dims = new int[len];
- mults = new int[len];
- for (int i=len-1; i>=0; i--) {
- dims[i]=d[i];
- mults[i] = sum;
- sum*=d[i];
- }
- vals = new int[sum];
- }
- void set(int v, int ... d) {
- int index = 0;
- for (int i=0; i<d.length; i++) {
- //if(d[i]>=dim[i]){throw new IndexOutOfBoundsException(); / NullPointerException } ???
- index+=d[i]*mults[i];
- }
- vals[index] = v;
- }
- int get(int ... d) {
- int index = 0;
- for (int i=0; i<d.length; i++) {
- // throw exception ?
- index+=d[i]*mults[i];
- }
- return vals[index];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement