Registered StackHub users may elect to receive email notifications whenever a new package version is released.
There are 2 watchers.
Returns all rows from a
where there are not matching values in b
, keeping columns from a
only.
antiJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Given a function name fn
, return the number of arguments the function accepts.
Transform the contents of a dict into a string compatible with parseFilter. The resulting filter string matches records with tags that include all the name-value pairs in dict d
.
d
will cause parseFilter to fail downstream; use the utility function removeNull as needed to clean the input.Exports a grid of functions funcs
to a tagged record input/output (TRIO) file filename
for reuse elsewhere. If missing, the "io/" prefix and ".trio" suffix are added to filename
automatically. See also importFunctions.
readAll(func).exportFunctions("myFunctions") >> Writes to `io/myFunctions.trio`
Returns all rows and columns from both a
and b
. Rows in a
with no match in b
will have missing entries in the columns joined from b
, and vice versa.
fullJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Returns true if x
has all the elements in names
.
Returns true if x
has any of the elements in names
.
Imports a tagged record input/output (TRIO) file of functions and commits them to the Folio. If missing, the "io/" prefix and ".trio" suffix are added to filename
automatically. See also exportFunctions.
importFunctions("myFunctions") >> Reads from `io/myFunctions.trio`
Returns all rows from a
where there are matching values in b
and all columns from a
and b
. If there are multiple matches between a
and b
, all combinations of the matches are returned.
innerJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Returns the set intersection of two lists or dicts a
and b
. Behavior for dicts differs by checked
:
checked
is true, verifies that keys included in both a
and b
have matching values, and throws an error on mismatch.checked
is false, excludes name-value pairs with matching keys but differing values.intersect([1, 2, 3],[2, 3, 4]) >> [2, 3] intersect({a, b}, {a, c}) >> {a} intersect({a, b:1}, {a, b:1}) >> {a, b:1} intersect({a, b:1}, {a, b:2}) >> error intersect({a, b:1}, {a, b:2}, false) >> {a}
Returns true if val
is equal to NA, false otherwise.
Returns true if val
is null, false otherwise.
Returns all rows from a
and all columns from a
and b
. Rows in a
with no match in b
will have missing entries in the columns joined from b
. If there are multiple matches between a
and b
, all combinations of the matches are returned.
leftJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Convenience wrapper for parseRef that supports leading "@" without throwing error.
Removes NA values from list or dict x
.
Side effects: may rearrange dict key order.
Removes NaN values from list or dict x
.
Side effects: may rearrange dict key order.
Removes null values from list or dict x
.
Side effects: may rearrange dict key order.
Remove any elements from list or dict x
that equal val
.
Side effects: may rearrange dict key order.
Replicate the value x
the specified number of times
. Returns a list.
rep(1, 2) >> [1,1] rep("A", 3).concat("") >> "AAA"
Convenience wrapper for replace that also allows processing of URIs or dicts.
val
is a string, identical to replaceval
is a URI, it is coerced to string, modified, and re-parsed as a URIval
is a dict or list, all its string and URI elements have the replacement appliedFor dicts and lists, the string replacement is not recursive. (For instance, the replacement will not reach inside of dicts nested within lists.)
Returns all rows from b
and all columns from a
and b
. Rows in b
with no match in a
will have missing entries in the columns joined from a
. If there are multiple matches between a
and b
, all combinations of the matches are returned.
rightJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Returns all rows from a
where there are matching values in b
, keeping columns from a
only. Differs from innerJoin in that it will never duplicate rows of a
.
semiJoin
is one of six SQL-style joins modeled on the two-table verbs in the dplyr R package. For more information, including syntax for by
and valid options for opts
, see the join documentation.
Returns the set difference of two lists or dicts a
and b
: all elements of a
that are not in b
.
For dicts, elements for removal are checked by name only. Values are ignored, including for keys mapped to Remove.val
.
setDiff([1, 2, 3],[2, 3, 4]) >> [1] setDiff({a, b}, {a, c}) >> {b} setDiff({a, b:1}, {b:2}) >> {a} setDiff({a, b:1}, {-b}) >> {a}
Converts a string of comma-separated values to a dict using eval. Automatically adds brackets {
}
if needed.
Converts a string of comma-separated values to a list using eval. Automatically adds brackets [
]
if needed.
Returns the set union of two lists or dicts a
and b
. Behavior for dicts differs by checked
:
checked
is true, verifies that keys included in both a
and b
have matching values, and throws an error on mismatch.checked
is false, values from a
override values from b
. This is similar to merge(b, a)
except that keys not mapped to Remove.val
always take precedence.union([1, 2, 3],[2, 3, 4]) >> [1, 2, 3, 4] union({a, b}, {a, c}) >> {a, b, c} union({a, b}, {-b, c}, false) >> {a, b, c} union({a, b:1}, {a, b:1}) >> {a, b:1} union({a, b:1}, {a, b:2}) >> error union({a, b:1}, {a, b:2}, false) >> {a, b:1}