Uses of Interface
org.knime.core.data.vector.bytevector.ByteVectorValue

Packages that use ByteVectorValue
org.knime.core.data.vector.bytevector   
 

Uses of ByteVectorValue in org.knime.core.data.vector.bytevector
 

Classes in org.knime.core.data.vector.bytevector that implement ByteVectorValue
 class DenseByteVectorCell
           
 class SparseByteVectorCell
           
 

Methods in org.knime.core.data.vector.bytevector with parameters of type ByteVectorValue
static SparseByteVectorCell SparseByteVectorCellFactory.max(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a sparse byte vector cell containing the result of the max operation on the passed operands (that is each position holds the maximum of the values of the operands).
static DenseByteVectorCell DenseByteVectorCellFactory.max(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a dense byte vector cell containing the result of the max operation on the passed operands (that is each position holds the maximum of the values of the operands).
static SparseByteVectorCell SparseByteVectorCellFactory.min(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a sparse byte vector cell containing the result of the min operation on the passed operands (that is each position holds the minimum of the values of the operands).
static DenseByteVectorCell DenseByteVectorCellFactory.min(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a dense byte vector cell containing the result of the min operation on the passed operands (that is each position holds the minimum of the values of the operands).
static SparseByteVectorCell SparseByteVectorCellFactory.sum(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a sparse byte vector cell containing the sum of the passed operands (that is each position holds the sum of the values of the operands).
static DenseByteVectorCell DenseByteVectorCellFactory.sum(ByteVectorValue bv1, ByteVectorValue bv2)
          Creates a dense byte vector cell containing the sum of the passed operands (that is each position holds the sum of the values of the operands).
 



Copyright, 2003 - 2010. All rights reserved.
University of Konstanz, Germany.
Chair for Bioinformatics and Information Mining, Prof. Dr. Michael R. Berthold.
You may not modify, publish, transmit, transfer or sell, reproduce, create derivative works from, distribute, perform, display, or in any way exploit any of the content, in whole or in part, except as otherwise expressly permitted in writing by the copyright owner or as specified in the license file distributed with this product.