< prev index next >
src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector.java
Print this page
*** 110,120 ****
* @return a zero vector of given species
*/
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector zero(VectorSpecies<Short> species) {
! return VectorIntrinsics.broadcastCoerced((Class<ShortVector>) species.boxType(), short.class, species.length(),
0, species,
((bits, s) -> ((ShortSpecies)s).op(i -> (short)bits)));
}
/**
--- 110,120 ----
* @return a zero vector of given species
*/
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector zero(VectorSpecies<Short> species) {
! return VectorIntrinsics.broadcastCoerced((Class<ShortVector>) species.vectorType(), short.class, species.length(),
0, species,
((bits, s) -> ((ShortSpecies)s).op(i -> (short)bits)));
}
/**
*** 140,150 ****
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector fromByteArray(VectorSpecies<Short> species, byte[] a, int offset) {
Objects.requireNonNull(a);
offset = VectorIntrinsics.checkIndex(offset, a.length, species.bitSize() / Byte.SIZE);
! return VectorIntrinsics.load((Class<ShortVector>) species.boxType(), short.class, species.length(),
a, ((long) offset) + Unsafe.ARRAY_BYTE_BASE_OFFSET,
a, offset, species,
(c, idx, s) -> {
ByteBuffer bbc = ByteBuffer.wrap(c, idx, a.length - idx).order(ByteOrder.nativeOrder());
ShortBuffer tb = bbc.asShortBuffer();
--- 140,150 ----
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector fromByteArray(VectorSpecies<Short> species, byte[] a, int offset) {
Objects.requireNonNull(a);
offset = VectorIntrinsics.checkIndex(offset, a.length, species.bitSize() / Byte.SIZE);
! return VectorIntrinsics.load((Class<ShortVector>) species.vectorType(), short.class, species.length(),
a, ((long) offset) + Unsafe.ARRAY_BYTE_BASE_OFFSET,
a, offset, species,
(c, idx, s) -> {
ByteBuffer bbc = ByteBuffer.wrap(c, idx, a.length - idx).order(ByteOrder.nativeOrder());
ShortBuffer tb = bbc.asShortBuffer();
*** 198,208 ****
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector fromArray(VectorSpecies<Short> species, short[] a, int offset){
Objects.requireNonNull(a);
offset = VectorIntrinsics.checkIndex(offset, a.length, species.length());
! return VectorIntrinsics.load((Class<ShortVector>) species.boxType(), short.class, species.length(),
a, (((long) offset) << ARRAY_SHIFT) + Unsafe.ARRAY_SHORT_BASE_OFFSET,
a, offset, species,
(c, idx, s) -> ((ShortSpecies)s).op(n -> c[idx + n]));
}
--- 198,208 ----
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector fromArray(VectorSpecies<Short> species, short[] a, int offset){
Objects.requireNonNull(a);
offset = VectorIntrinsics.checkIndex(offset, a.length, species.length());
! return VectorIntrinsics.load((Class<ShortVector>) species.vectorType(), short.class, species.length(),
a, (((long) offset) << ARRAY_SHIFT) + Unsafe.ARRAY_SHORT_BASE_OFFSET,
a, offset, species,
(c, idx, s) -> ((ShortSpecies)s).op(n -> c[idx + n]));
}
*** 311,321 ****
public static ShortVector fromByteBuffer(VectorSpecies<Short> species, ByteBuffer bb, int offset) {
if (bb.order() != ByteOrder.nativeOrder()) {
throw new IllegalArgumentException();
}
offset = VectorIntrinsics.checkIndex(offset, bb.limit(), species.bitSize() / Byte.SIZE);
! return VectorIntrinsics.load((Class<ShortVector>) species.boxType(), short.class, species.length(),
U.getReference(bb, BYTE_BUFFER_HB), U.getLong(bb, BUFFER_ADDRESS) + offset,
bb, offset, species,
(c, idx, s) -> {
ByteBuffer bbc = c.duplicate().position(idx).order(ByteOrder.nativeOrder());
ShortBuffer tb = bbc.asShortBuffer();
--- 311,321 ----
public static ShortVector fromByteBuffer(VectorSpecies<Short> species, ByteBuffer bb, int offset) {
if (bb.order() != ByteOrder.nativeOrder()) {
throw new IllegalArgumentException();
}
offset = VectorIntrinsics.checkIndex(offset, bb.limit(), species.bitSize() / Byte.SIZE);
! return VectorIntrinsics.load((Class<ShortVector>) species.vectorType(), short.class, species.length(),
U.getReference(bb, BYTE_BUFFER_HB), U.getLong(bb, BUFFER_ADDRESS) + offset,
bb, offset, species,
(c, idx, s) -> {
ByteBuffer bbc = c.duplicate().position(idx).order(ByteOrder.nativeOrder());
ShortBuffer tb = bbc.asShortBuffer();
*** 375,385 ****
*/
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector broadcast(VectorSpecies<Short> species, short e) {
return VectorIntrinsics.broadcastCoerced(
! (Class<ShortVector>) species.boxType(), short.class, species.length(),
e, species,
((bits, sp) -> ((ShortSpecies)sp).op(i -> (short)bits)));
}
/**
--- 375,385 ----
*/
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector broadcast(VectorSpecies<Short> species, short e) {
return VectorIntrinsics.broadcastCoerced(
! (Class<ShortVector>) species.vectorType(), short.class, species.length(),
e, species,
((bits, sp) -> ((ShortSpecies)sp).op(i -> (short)bits)));
}
/**
*** 399,409 ****
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector scalars(VectorSpecies<Short> species, short... es) {
Objects.requireNonNull(es);
int ix = VectorIntrinsics.checkIndex(0, es.length, species.length());
! return VectorIntrinsics.load((Class<ShortVector>) species.boxType(), short.class, species.length(),
es, Unsafe.ARRAY_SHORT_BASE_OFFSET,
es, ix, species,
(c, idx, sp) -> ((ShortSpecies)sp).op(n -> c[idx + n]));
}
--- 399,409 ----
@ForceInline
@SuppressWarnings("unchecked")
public static ShortVector scalars(VectorSpecies<Short> species, short... es) {
Objects.requireNonNull(es);
int ix = VectorIntrinsics.checkIndex(0, es.length, species.length());
! return VectorIntrinsics.load((Class<ShortVector>) species.vectorType(), short.class, species.length(),
es, Unsafe.ARRAY_SHORT_BASE_OFFSET,
es, ix, species,
(c, idx, sp) -> ((ShortSpecies)sp).op(n -> c[idx + n]));
}
*** 777,805 ****
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector rotateEL(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector rotateER(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector shiftEL(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector shiftER(int i);
/**
* Bitwise ANDs this vector with an input vector.
--- 777,805 ----
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector rotateLanesLeft(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector rotateLanesRight(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector shiftLanesLeft(int i);
/**
* {@inheritDoc}
*/
@Override
! public abstract ShortVector shiftLanesRight(int i);
/**
* Bitwise ANDs this vector with an input vector.
*** 975,1052 ****
/**
* Logically left shifts this vector by the broadcast of an input scalar.
* <p>
* This is a lane-wise binary operation which applies the primitive logical left shift
* operation ({@code <<}) to each lane to left shift the
! * element by shift value as specified by the input scalar. Only the 4
! * lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to left shift
* @return the result of logically left shifting left this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftL(int s);
/**
* Logically left shifts this vector by the broadcast of an input scalar,
* selecting lane elements controlled by a mask.
* <p>
* This is a lane-wise binary operation which applies the primitive logical left shift
* operation ({@code <<}) to each lane to left shift the
! * element by shift value as specified by the input scalar. Only the 4
! * lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to left shift
* @param m the mask controlling lane selection
* @return the result of logically left shifting left this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftL(int s, VectorMask<Short> m);
// logical, or unsigned, shift right
/**
* Logically right shifts (or unsigned right shifts) this vector by the
* broadcast of an input scalar.
* <p>
* This is a lane-wise binary operation which applies the primitive logical right shift
* operation ({@code >>>}) to each lane to logically right shift the
! * element by shift value as specified by the input scalar. Only the 4
! * lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to right shift
* @return the result of logically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftR(int s);
/**
* Logically right shifts (or unsigned right shifts) this vector by the
* broadcast of an input scalar, selecting lane elements controlled by a
* mask.
* <p>
* This is a lane-wise binary operation which applies the primitive logical right shift
! * operation ({@code >>>}) to each lane to logically right shift the
! * element by shift value as specified by the input scalar. Only the 4
! * lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to right shift
* @param m the mask controlling lane selection
* @return the result of logically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftR(int s, VectorMask<Short> m);
/**
* Arithmetically right shifts (or signed right shifts) this vector by the
* broadcast of an input scalar.
* <p>
--- 975,1123 ----
/**
* Logically left shifts this vector by the broadcast of an input scalar.
* <p>
* This is a lane-wise binary operation which applies the primitive logical left shift
* operation ({@code <<}) to each lane to left shift the
! * element by shift value as specified by the input scalar.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to left shift
* @return the result of logically left shifting left this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftLeft(int s);
/**
* Logically left shifts this vector by the broadcast of an input scalar,
* selecting lane elements controlled by a mask.
* <p>
* This is a lane-wise binary operation which applies the primitive logical left shift
* operation ({@code <<}) to each lane to left shift the
! * element by shift value as specified by the input scalar.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to left shift
* @param m the mask controlling lane selection
* @return the result of logically left shifting left this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftLeft(int s, VectorMask<Short> m);
+ /**
+ * Logically left shifts this vector by an input vector.
+ * <p>
+ * This is a lane-wise binary operation which applies the primitive logical left shift
+ * operation ({@code <<}) to each lane. For each lane of this vector, the
+ * shift value is the corresponding lane of input vector.
+ * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
+ * were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
+ * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
+ *
+ * @param v the input vector
+ * @return the result of logically left shifting this vector by the input
+ * vector
+ */
+ public abstract ShortVector shiftLeft(Vector<Short> v);
+
+ /**
+ * Logically left shifts this vector by an input vector, selecting lane
+ * elements controlled by a mask.
+ * <p>
+ * This is a lane-wise binary operation which applies the primitive logical left shift
+ * operation ({@code <<}) to each lane. For each lane of this vector, the
+ * shift value is the corresponding lane of input vector.
+ * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
+ * were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
+ * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
+ *
+ * @param v the input vector
+ * @param m the mask controlling lane selection
+ * @return the result of logically left shifting this vector by the input
+ * vector
+ */
+ public ShortVector shiftLeft(Vector<Short> v, VectorMask<Short> m) {
+ return blend(shiftLeft(v), m);
+ }
// logical, or unsigned, shift right
/**
* Logically right shifts (or unsigned right shifts) this vector by the
* broadcast of an input scalar.
* <p>
* This is a lane-wise binary operation which applies the primitive logical right shift
* operation ({@code >>>}) to each lane to logically right shift the
! * element by shift value as specified by the input scalar.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to right shift
* @return the result of logically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftRight(int s);
/**
* Logically right shifts (or unsigned right shifts) this vector by the
* broadcast of an input scalar, selecting lane elements controlled by a
* mask.
* <p>
* This is a lane-wise binary operation which applies the primitive logical right shift
! * operation ({@code >>}) to each lane to logically right shift the
! * element by shift value as specified by the input scalar.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
* were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
* The shift distance actually used is therefore always in the range 0 to 15, inclusive.
*
* @param s the input scalar; the number of the bits to right shift
* @param m the mask controlling lane selection
* @return the result of logically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftRight(int s, VectorMask<Short> m);
!
! /**
! * Logically right shifts (or unsigned right shifts) this vector by an
! * input vector.
! * <p>
! * This is a lane-wise binary operation which applies the primitive logical right shift
! * operation ({@code >>>}) to each lane. For each lane of this vector, the
! * shift value is the corresponding lane of input vector.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
! * were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
! * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
! *
! * @param v the input vector
! * @return the result of logically right shifting this vector by the
! * input vector
! */
! public abstract ShortVector shiftRight(Vector<Short> v);
+ /**
+ * Logically right shifts (or unsigned right shifts) this vector by an
+ * input vector, selecting lane elements controlled by a mask.
+ * <p>
+ * This is a lane-wise binary operation which applies the primitive logical right shift
+ * operation ({@code >>>}) to each lane. For each lane of this vector, the
+ * shift value is the corresponding lane of input vector.
+ * Only the 4 lowest-order bits of shift value are used. It is as if the shift value
+ * were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
+ * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
+ *
+ * @param v the input vector
+ * @param m the mask controlling lane selection
+ * @return the result of logically right shifting this vector by the
+ * input vector
+ */
+ public ShortVector shiftRight(Vector<Short> v, VectorMask<Short> m) {
+ return blend(shiftRight(v), m);
+ }
/**
* Arithmetically right shifts (or signed right shifts) this vector by the
* broadcast of an input scalar.
* <p>
*** 1059,1069 ****
*
* @param s the input scalar; the number of the bits to right shift
* @return the result of arithmetically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector aShiftR(int s);
/**
* Arithmetically right shifts (or signed right shifts) this vector by the
* broadcast of an input scalar, selecting lane elements controlled by a
* mask.
--- 1130,1140 ----
*
* @param s the input scalar; the number of the bits to right shift
* @return the result of arithmetically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftArithmeticRight(int s);
/**
* Arithmetically right shifts (or signed right shifts) this vector by the
* broadcast of an input scalar, selecting lane elements controlled by a
* mask.
*** 1078,1089 ****
* @param s the input scalar; the number of the bits to right shift
* @param m the mask controlling lane selection
* @return the result of arithmetically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector aShiftR(int s, VectorMask<Short> m);
/**
* {@inheritDoc}
*/
@Override
--- 1149,1272 ----
* @param s the input scalar; the number of the bits to right shift
* @param m the mask controlling lane selection
* @return the result of arithmetically right shifting this vector by the
* broadcast of an input scalar
*/
! public abstract ShortVector shiftArithmeticRight(int s, VectorMask<Short> m);
!
! /**
! * Arithmetically right shifts (or signed right shifts) this vector by an
! * input vector.
! * <p>
! * This is a lane-wise binary operation which applies the primitive arithmetic right
! * shift operation ({@code >>}) to each lane. For each lane of this vector, the
! * shift value is the corresponding lane of input vector.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift
! * value were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
! * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
! *
! * @param v the input vector
! * @return the result of arithmetically right shifting this vector by the
! * input vector
! */
! public abstract ShortVector shiftArithmeticRight(Vector<Short> v);
!
! /**
! * Arithmetically right shifts (or signed right shifts) this vector by an
! * input vector, selecting lane elements controlled by a mask.
! * <p>
! * This is a lane-wise binary operation which applies the primitive arithmetic right
! * shift operation ({@code >>}) to each lane. For each lane of this vector, the
! * shift value is the corresponding lane of input vector.
! * Only the 4 lowest-order bits of shift value are used. It is as if the shift
! * value were subjected to a bitwise logical AND operator ({@code &}) with the mask value 0xF.
! * The shift distance actually used is therefore always in the range 0 to 15, inclusive.
! *
! * @param v the input vector
! * @param m the mask controlling lane selection
! * @return the result of arithmetically right shifting this vector by the
! * input vector
! */
! public ShortVector shiftArithmeticRight(Vector<Short> v, VectorMask<Short> m) {
! return blend(shiftArithmeticRight(v), m);
! }
!
! /**
! * Rotates left this vector by the broadcast of an input scalar.
! * <p>
! * This is a lane-wise binary operation which produces the result of rotating left the two's
! * complement binary representation of each lane of first operand (this vector) by input scalar.
! * Rotation by any multiple of 16 is a no-op, so only the 4 lowest-order bits of input value are used.
! * It is as if the input value were subjected to a bitwise logical
! * AND operator ({@code &}) with the mask value 0x15.
! *
! * @param s the input scalar; the number of the bits to rotate left
! * @return the result of rotating left this vector by the broadcast of an
! * input scalar
! */
! @ForceInline
! public final ShortVector rotateLeft(int s) {
! return shiftLeft(s).or(shiftRight(-s));
! }
!
! /**
! * Rotates left this vector by the broadcast of an input scalar, selecting
! * lane elements controlled by a mask.
! * <p>
! * This is a lane-wise binary operation which produces the result of rotating left the two's
! * complement binary representation of each lane of first operand (this vector) by input scalar.
! * Rotation by any multiple of 16 is a no-op, so only the 4 lowest-order bits of input value are used.
! * It is as if the input value were subjected to a bitwise logical
! * AND operator ({@code &}) with the mask value 0x15.
! *
! * @param s the input scalar; the number of the bits to rotate left
! * @param m the mask controlling lane selection
! * @return the result of rotating left this vector by the broadcast of an
! * input scalar
! */
! @ForceInline
! public final ShortVector rotateLeft(int s, VectorMask<Short> m) {
! return shiftLeft(s, m).or(shiftRight(-s, m), m);
! }
+ /**
+ * Rotates right this vector by the broadcast of an input scalar.
+ * <p>
+ * This is a lane-wise binary operation which produces the result of rotating right the two's
+ * complement binary representation of each lane of first operand (this vector) by input scalar.
+ * Rotation by any multiple of 16 is a no-op, so only the 4 lowest-order bits of input value are used.
+ * It is as if the input value were subjected to a bitwise logical
+ * AND operator ({@code &}) with the mask value 0x15.
+ *
+ * @param s the input scalar; the number of the bits to rotate right
+ * @return the result of rotating right this vector by the broadcast of an
+ * input scalar
+ */
+ @ForceInline
+ public final ShortVector rotateRight(int s) {
+ return shiftRight(s).or(shiftLeft(-s));
+ }
+
+ /**
+ * Rotates right this vector by the broadcast of an input scalar, selecting
+ * lane elements controlled by a mask.
+ * <p>
+ * This is a lane-wise binary operation which produces the result of rotating right the two's
+ * complement binary representation of each lane of first operand (this vector) by input scalar.
+ * Rotation by any multiple of 16 is a no-op, so only the 4 lowest-order bits of input value are used.
+ * It is as if the input value were subjected to a bitwise logical
+ * AND operator ({@code &}) with the mask value 0x15.
+ *
+ * @param s the input scalar; the number of the bits to rotate right
+ * @param m the mask controlling lane selection
+ * @return the result of rotating right this vector by the broadcast of an
+ * input scalar
+ */
+ @ForceInline
+ public final ShortVector rotateRight(int s, VectorMask<Short> m) {
+ return shiftRight(s, m).or(shiftLeft(-s, m), m);
+ }
/**
* {@inheritDoc}
*/
@Override
*** 1424,1440 ****
*/
static final class ShortSpecies extends AbstractSpecies<Short> {
final Function<short[], ShortVector> vectorFactory;
private ShortSpecies(VectorShape shape,
! Class<?> boxType,
Class<?> maskType,
Function<short[], ShortVector> vectorFactory,
Function<boolean[], VectorMask<Short>> maskFactory,
Function<IntUnaryOperator, VectorShuffle<Short>> shuffleFromArrayFactory,
fShuffleFromArray<Short> shuffleFromOpFactory) {
! super(shape, short.class, Short.SIZE, boxType, maskType, maskFactory,
shuffleFromArrayFactory, shuffleFromOpFactory);
this.vectorFactory = vectorFactory;
}
interface FOp {
--- 1607,1623 ----
*/
static final class ShortSpecies extends AbstractSpecies<Short> {
final Function<short[], ShortVector> vectorFactory;
private ShortSpecies(VectorShape shape,
! Class<?> vectorType,
Class<?> maskType,
Function<short[], ShortVector> vectorFactory,
Function<boolean[], VectorMask<Short>> maskFactory,
Function<IntUnaryOperator, VectorShuffle<Short>> shuffleFromArrayFactory,
fShuffleFromArray<Short> shuffleFromOpFactory) {
! super(shape, short.class, Short.SIZE, vectorType, maskType, maskFactory,
shuffleFromArrayFactory, shuffleFromOpFactory);
this.vectorFactory = vectorFactory;
}
interface FOp {
< prev index next >