VF_iselementVVD_iselementVVE_iselementV
VCF_iselementVVCD_iselementVVCE_iselementV
VPF_iselementVVPD_iselementVVPE_iselementV
VI_iselementVVBI_iselementVVSI_iselementVVLI_iselementVVQI_iselementV 
VU_iselementVVUB_iselementVVUS_iselementVVUL_iselementVVUQ_iselementVVUI_iselementV
FunctionTest for each element of a vector, if an identical element is present in a table.
Syntax C/C++#include <VFstd.h>
ui VF_iselementV( fVector Y, fVector X, ui sizex, fVector Tab, ui sizetab );
C++ VecObj#include <OptiVec.h>
ui vector<T>::iselementV( const vector<T>& X, const vector<T>& Tab );
Pascal/Delphiuses VFstd;
function VF_iselementV( Y, X:fVector; sizex:UIntSize; Tab:fVector; sizetab:UIntSize ): UIntSize;
CUDA function C/C++#include <cudaVFstd.h>
int cudaVF_iselementV( ui *h_nFound, fVector d_Y, fVector d_X, ui sizex, fVector d_Tab, ui sizetab );
ui VFcu_iselementV( fVector h_Y, fVector h_X, ui sizex, fVector h_Tab, ui sizetab );
CUDA function Pascal/Delphiuses VFstd;
function cudaVF_iselementV( var h_nFound:UIntSize; d_Y, d_X:fVector; sizex:UIntSize; d_Tab:fVector; sizetab:UIntSize ): IntBool;
function VFcu_iselementV( h_Y, h_X:fVector; sizex:UIntSize; h_Tab:fVector; sizetab:UIntSize ): UIntSize;
DescriptionThe table Tab is searched for each of the elements of X. For those elements of X which are found in Tab, the corresponding element of Y is set to +1 (in the complex versions: {1, 0} ). No ordering of X and Tab is assumed and a linear search for each Xi performed. In contrast to the comparison and counting functions, VF_cmp_eqV, VF_cnt_eqV, +0.0 and –0.0 are treated as different numbers here, as this functions searches for the exact bit-representation given by Tab[i].
A related function that finds the table element closest (but not necessarily equal) to each element of X is VF_searchV.
Error handlingnone
Return valueThe number of elements of X for which an element of Tab was found is returned.
See alsoVF_searchV,   VF_iselementC

VectorLib Table of Contents  OptiVec home