Java Vector shiftIndicies(List list, int[] indicies, int shiftVector)

Description

shift List elements left or right.

License

Open Source License

Declaration

public static void shiftIndicies(List list, int[] indicies, int shiftVector) 

Method Source Code

//package com.java2s;
/* (The MIT License)/*ww w  .  j a v a  2  s.  co m*/
Copyright (c) 2006 Adam Bennett (cruxic@gmail.com)
     
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
     
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
     
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
 */

import java.util.*;

public class Main {
    /**
     shift List elements left or right.
     As a result of this call indicies will be sorted in ascending order.
     */
    public static void shiftIndicies(List list, int[] indicies, int shiftVector) {
        //any elements to shift at all?
        if (indicies.length > 0) {
            Arrays.sort(indicies);

            int listSize = list.size();

            //shift forward
            if (shiftVector > 0) {
                while (shiftVector > 0) {
                    shiftVector--;

                    //if we hit the end of the list then stop shifting
                    if (indicies[indicies.length - 1] == (listSize - 1))
                        break;

                    //for each index in reverse
                    for (int i = indicies.length - 1; i >= 0; i--) {
                        swapListElements(list, indicies[i], indicies[i] + 1);
                        indicies[i]++;
                    }
                }
            } else if (shiftVector < 0) {
                while (shiftVector < 0) {
                    shiftVector++;

                    //if we hit beginning of the list then stop shifting
                    if (indicies[0] == 0)
                        break;

                    //for each index in reverse
                    for (int i = 0; i < indicies.length; i++) {
                        swapListElements(list, indicies[i], indicies[i] - 1);
                        indicies[i]--;
                    }
                }
            }
        }
    }

    public static void swapListElements(List list, int idx1, int idx2) {
        Object tmp = list.get(idx1);
        list.set(idx1, list.get(idx2));
        list.set(idx2, tmp);
    }
}

Related

1. isContained(Object obj, Vector vect)
2. median(double[] vector)
3. normVector(List v1)
4. removeDuplicateDomains(Vector s)
5. removeDuplicates(Vector s)
6. vector(final float[] p2, final float[] p1)
7. Vector2fMult(float[] a, float[] b, float[] dest)
8. Vector2fNegate(float[] a, float[] dest)
9. Vector2fNew()