public interface MFNode extends MField
| Modifier and Type | Method and Description |
|---|---|
void |
append(X3DNode newValue)
Places a new value at the end of the existing value array, increasing the field length accordingly.
|
X3DNode |
get1Value(int index)
Get an individual value from the existing field array.
|
void |
getValue(X3DNode[] copiedNodes)
Write the current value of the field out to the provided copiedNodes array.
|
void |
insertValue(int imageIndex,
X3DNode newValue)
Insert a new value prior to the imageIndex location in the existing value array, increasing the field length accordingly.
|
void |
set1Value(int imageIndex,
X3DNode newValue)
Replace a single value at the appropriate location in the existing value array.
|
void |
setValue(int size,
X3DNode[] newValue)
Assign an array subset to this field.
|
addX3DEventListener, getDefinition, isReadable, isWritable, removeX3DEventListenervoid getValue(X3DNode[] copiedNodes)
copiedNodes - The array to be filled in with current field values.java.lang.ArrayIndexOutOfBoundsException - The provided copiedNodes array was too smallX3DNode get1Value(int index)
Get an individual value from the existing field array.
If the index is outside the bounds of the current array of data values, an ArrayIndexOutOfBoundsException is thrown.
index - is position of selected value in current arrayjava.lang.ArrayIndexOutOfBoundsException - The index was outside of the bounds of the current array.void setValue(int size,
X3DNode[] newValue)
size - indicates size of result to copy (i.e. the number of typed singleton values) from beginning of newValue array.newValue - The replacement value array to (potentially) slice and then assign.void set1Value(int imageIndex,
X3DNode newValue)
imageIndex - the index of the selected imagenewValue - provides new value to applyvoid append(X3DNode newValue)
newValue - The newValue to appendvoid insertValue(int imageIndex,
X3DNode newValue)
imageIndex - the index of the selected imagenewValue - The newValue to insertCopyright ©2005-2017 Web3D Consortium under an open-source license, free for any use. Feedback is welcome.