Java Code Examples for jdk.nashorn.internal.runtime.arrays.ArrayData#nextIndex()

The following examples show how to use jdk.nashorn.internal.runtime.arrays.ArrayData#nextIndex() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: ScriptObject.java    From openjdk-8-source with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * return an array of own property keys associated with the object.
 *
 * @param all True if to include non-enumerable keys.
 * @return Array of keys.
 */
public String[] getOwnKeys(final boolean all) {
    final List<Object> keys    = new ArrayList<>();
    final PropertyMap  selfMap = this.getMap();

    final ArrayData array  = getArray();
    final long length      = array.length();

    for (long i = 0; i < length; i = array.nextIndex(i)) {
        if (array.has((int)i)) {
            keys.add(JSType.toString(i));
        }
    }

    for (final Property property : selfMap.getProperties()) {
        if (all || property.isEnumerable()) {
            keys.add(property.getKey());
        }
    }

    return keys.toArray(new String[keys.size()]);
}
Example 2
Source File: ScriptObject.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * return an array of own property keys associated with the object.
 *
 * @param all True if to include non-enumerable keys.
 * @return Array of keys.
 */
public String[] getOwnKeys(final boolean all) {
    final List<Object> keys    = new ArrayList<>();
    final PropertyMap  selfMap = this.getMap();

    final ArrayData array  = getArray();
    final long length      = array.length();

    for (long i = 0; i < length; i = array.nextIndex(i)) {
        if (array.has((int)i)) {
            keys.add(JSType.toString(i));
        }
    }

    for (final Property property : selfMap.getProperties()) {
        if (all || property.isEnumerable()) {
            keys.add(property.getKey());
        }
    }

    return keys.toArray(new String[keys.size()]);
}
Example 3
Source File: ScriptObject.java    From nashorn with GNU General Public License v2.0 6 votes vote down vote up 
/**
 * return an array of own property keys associated with the object.
 *
 * @param all True if to include non-enumerable keys.
 * @return Array of keys.
 */
public String[] getOwnKeys(final boolean all) {
    final List<Object> keys    = new ArrayList<>();
    final PropertyMap  selfMap = this.getMap();

    final ArrayData array  = getArray();
    final long length      = array.length();

    for (long i = 0; i < length; i = array.nextIndex(i)) {
        if (array.has((int)i)) {
            keys.add(JSType.toString(i));
        }
    }

    for (final Property property : selfMap.getProperties()) {
        if (all || property.isEnumerable()) {
            keys.add(property.getKey());
        }
    }

    return keys.toArray(new String[keys.size()]);
}
Example 4
Source File: NativeArray.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * ECMA 15.4.4.11 Array.prototype.sort ( comparefn )
 *
 * @param self       self reference
 * @param comparefn  element comparison function
 * @return sorted array
 */
@Function(attributes = Attribute.NOT_ENUMERABLE)
public static Object sort(final Object self, final Object comparefn) {
    try {
        final ScriptObject sobj    = (ScriptObject) self;
        final long         len     = JSType.toUint32(sobj.getLength());
        ArrayData          array   = sobj.getArray();

        if (len > 1) {
            // Get only non-missing elements. Missing elements go at the end
            // of the sorted array. So, just don't copy these to sort input.
            final ArrayList<Object> src = new ArrayList<>();
            for (long i = 0; i < len; i = array.nextIndex(i)) {
                if (array.has((int) i)) {
                    src.add(array.getObject((int) i));
                }
            }

            final Object[] sorted = sort(src.toArray(), comparefn);

            for (int i = 0; i < sorted.length; i++) {
                array = array.set(i, sorted[i], true);
            }

            // delete missing elements - which are at the end of sorted array
            if (sorted.length != len) {
                array = array.delete(sorted.length, len - 1);
            }

            sobj.setArray(array);
       }

        return sobj;
    } catch (final ClassCastException | NullPointerException e) {
        throw typeError("not.an.object", ScriptRuntime.safeToString(self));
    }
}
Example 5
Source File: NativeArray.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * ECMA 15.4.4.11 Array.prototype.sort ( comparefn )
 *
 * @param self       self reference
 * @param comparefn  element comparison function
 * @return sorted array
 */
@Function(attributes = Attribute.NOT_ENUMERABLE)
public static Object sort(final Object self, final Object comparefn) {
    try {
        final ScriptObject sobj    = (ScriptObject) self;
        final long         len     = JSType.toUint32(sobj.getLength());
        ArrayData          array   = sobj.getArray();

        if (len > 1) {
            // Get only non-missing elements. Missing elements go at the end
            // of the sorted array. So, just don't copy these to sort input.
            final ArrayList<Object> src = new ArrayList<>();
            for (long i = 0; i < len; i = array.nextIndex(i)) {
                if (array.has((int) i)) {
                    src.add(array.getObject((int) i));
                }
            }

            final Object[] sorted = sort(src.toArray(), comparefn);

            for (int i = 0; i < sorted.length; i++) {
                array = array.set(i, sorted[i], true);
            }

            // delete missing elements - which are at the end of sorted array
            if (sorted.length != len) {
                array = array.delete(sorted.length, len - 1);
            }

            sobj.setArray(array);
       }

        return sobj;
    } catch (final ClassCastException | NullPointerException e) {
        throw typeError("not.an.object", ScriptRuntime.safeToString(self));
    }
}
Example 6
Source File: NativeArray.java    From nashorn with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * ECMA 15.4.4.11 Array.prototype.sort ( comparefn )
 *
 * @param self       self reference
 * @param comparefn  element comparison function
 * @return sorted array
 */
@Function(attributes = Attribute.NOT_ENUMERABLE)
public static Object sort(final Object self, final Object comparefn) {
    try {
        final ScriptObject sobj    = (ScriptObject) self;
        final long         len     = JSType.toUint32(sobj.getLength());
        ArrayData          array   = sobj.getArray();

        if (len > 1) {
            // Get only non-missing elements. Missing elements go at the end
            // of the sorted array. So, just don't copy these to sort input.
            final ArrayList<Object> src = new ArrayList<>();
            for (long i = 0; i < len; i = array.nextIndex(i)) {
                if (array.has((int) i)) {
                    src.add(array.getObject((int) i));
                }
            }

            final Object[] sorted = sort(src.toArray(), comparefn);

            for (int i = 0; i < sorted.length; i++) {
                array = array.set(i, sorted[i], true);
            }

            // delete missing elements - which are at the end of sorted array
            if (sorted.length != len) {
                array = array.delete(sorted.length, len - 1);
            }

            sobj.setArray(array);
       }

        return sobj;
    } catch (final ClassCastException | NullPointerException e) {
        throw typeError("not.an.object", ScriptRuntime.safeToString(self));
    }
}