{set}

R# Documentation

set

require(R); #' Set Operations imports "set" from "REnv";

Set Operations

.NET clr function exports
unset	unset — Unset the feature slots value from a given variable
table	Cross Tabulation and Table Creation table uses the cross-classifying factors to build a contingency table of the counts at each combination of factor levels.
setdiff	setdiff: Set Difference of Subsets
rev	Reverse Elements rev provides a reversed version of its argument. It is generic function with a default method for vectors and one for dendrograms. Note that this Is no longer needed (nor efficient) For obtaining vectors sorted into descending order, since that Is now rather more directly achievable by sort(x, decreasing = True).
count	is a `table` liked function for count string occurance number
intersect	Performs set intersection
union	Performs set union
index_of	Create the hash index for element search
against	create subset of the given `listSet` via tuple value match against with the given `index_set`.
loop
duplicated	Determine Duplicate Elements `duplicated()` determines which elements of a vector or data frame are duplicates of elements with smaller subscripts, and returns a logical vector indicating which elements (rows) are duplicates.
crossing	Find Unique Combinations of All Elements from Two Vectors in R. Expand data frame to include all possible combinations of values.
combn	Generate All Combinations of n Elements, Taken m at a Time Generate all combinations of the elements of x taken m at a time. If x is a positive integer, returns all combinations of the elements of seq(x) taken m at a time. If argument FUN is not NULL, applies a function given by the argument to each point. If simplify is FALSE, returns a list; otherwise returns an array, typically a matrix. ... are passed unchanged to the FUN function, if specified.
jaccard	The Jaccard Index, also known as the Jaccard similarity coefficient, is a statistic used in understanding the similarities between sample sets. The measurement emphasizes similarity between finite sample sets, and is formally defined as the size of the intersection divided by the size of the union of the sample sets.
as.set	create a collection set based on a given vector or tuple list
!=

[Document Index]