Module org.praxislive.libp5x.core
Package processing.data

Class IntList

  • All Implemented Interfaces:
    Iterable<Integer>
    public class IntList
extends Object
implements Iterable<Integer>
    Helper class for a list of ints. Lists are designed to have some of the features of ArrayLists, but to maintain the simplicity and efficiency of working with arrays. Functions like sort() and shuffle() always act on the list itself. To get a sorted copy, use list.copy().sort().
    See Also:
    FloatList, StringList

    • Field Detail

      • count

        protected int count

      • data

        protected int[] data

    • Constructor Detail

      • IntList

        public IntList()

      • IntList

        public IntList​(int length)

      • IntList

        public IntList​(int[] source)

      • IntList

        public IntList​(Iterable<Object> iter)
        Construct an IntList from an iterable pile of objects. For instance, a float array, an array of strings, who knows). Un-parseable or null values will be set to 0.

      • IntList

        public IntList​(Object... items)
        Construct an IntList from a random pile of objects. Un-parseable or null values will be set to zero.

    • Method Detail

      • fromRange

        public static IntList fromRange​(int stop)

      • fromRange

        public static IntList fromRange​(int start,
                                int stop)

      • size

        public int size()
        Get the length of the list.

      • resize

        public void resize​(int length)

      • clear

        public void clear()
        Remove all entries from the list.

      • get

        public int get​(int index)
        Get an entry at a particular index.

      • set

        public void set​(int index,
                int what)
        Set the entry at a particular index. If the index is past the length of the list, it'll expand the list to accommodate, and fill the intermediate entries with 0s.

      • push

        public void push​(int value)
        Just an alias for append(), but matches pop()

      • pop

        public int pop()

      • remove

        public int remove​(int index)
        Remove an element from the specified index

      • removeValue

        public int removeValue​(int value)

      • removeValues

        public int removeValues​(int value)

      • append

        public void append​(int value)
        Add a new entry to the list.

      • append

        public void append​(int[] values)

      • append

        public void append​(IntList list)

      • appendUnique

        public void appendUnique​(int value)
        Add this value, but only if it's not already in the list.

      • insert

        public void insert​(int index,
                   int value)

      • insert

        public void insert​(int index,
                   int[] values)

      • insert

        public void insert​(int index,
                   IntList list)

      • index

        public int index​(int what)
        Return the first index of a particular value.

      • hasValue

        public boolean hasValue​(int value)

      • increment

        public void increment​(int index)

      • add

        public void add​(int index,
                int amount)

      • sub

        public void sub​(int index,
                int amount)

      • mult

        public void mult​(int index,
                 int amount)

      • div

        public void div​(int index,
                int amount)

      • min

        public int min()

      • minIndex

        public int minIndex()

      • max

        public int max()

      • maxIndex

        public int maxIndex()

      • sum

        public int sum()

      • sumLong

        public long sumLong()

      • sort

        public void sort()
        Sorts the array in place.

      • sortReverse

        public void sortReverse()
        Reverse sort, orders values from highest to lowest.

      • reverse

        public void reverse()

      • shuffle

        public void shuffle()
        Randomize the order of the list elements. Note that this does not obey the randomSeed() function in PApplet.

      • shuffle

        public void shuffle​(PApplet sketch)
        Randomize the list order using the random() function from the specified sketch, allowing shuffle() to use its current randomSeed() setting.

      • values

        public int[] values()
        Returns the actual array being used to store the data. For advanced users, this is the fastest way to access a large list. Suitable for iterating with a for() loop, but modifying the list will have terrible consequences.

      • array

        public int[] array()
        Create a new array with a copy of all the values.
        Returns:
        an array sized by the length of the list with each of the values.

      • array

        public int[] array​(int[] array)
        Copy values into the specified array. If the specified array is null or not the same size, a new array will be allocated.
        Parameters:
        array -

      • getPercent

        public FloatList getPercent()
        Returns a normalized version of this array. Called getPercent() for consistency with the Dict classes. It's a getter method because it needs to returns a new list (because IntList/Dict can't do percentages or normalization in place on int values).

      • getSubset

        public IntList getSubset​(int start)

      • getSubset

        public IntList getSubset​(int start,
                         int num)

      • print

        public void print()

      • save

        public void save​(File file)
        Save tab-delimited entries to a file (TSV format, UTF-8 encoding)

      • write

        public void write​(PrintWriter writer)
        Write entries to a PrintWriter, one per line

      • toJSON

        public String toJSON()
        Return this dictionary as a String in JSON format.