1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/match.R
\name{greedy_match}
\alias{greedy_match}
\title{Greedily match against a tree}
\usage{
greedy_match(trie, to_match, include_keys = FALSE)
}
\arguments{
\item{trie}{a trie object, created with \code{\link{trie}}}
\item{to_match}{a character vector containing the strings to check against the
trie's keys.}
\item{include_keys}{a logical value indicating whether to include the keys in the
returned results or not. If TRUE (\emph{not} the default) the returned object will
be a list of data.frames, rather than of vectors.}
}
\value{
a list, the length of \code{to_match}, with each entry containing any trie values
where the \code{to_match} element greedily matches the associated key. In the case that
nothing was found, the entry will contain \code{NA}. In the case that \code{include_keys}
is TRUE, the matching keys will also be included
}
\description{
\code{greedy_match} accepts a trie and a character vector
and returns the values associated with any key that is "greedily" (read: fuzzily)
matched against one of the character vector entries.
}
\examples{
trie <- trie(keys = c("afford", "affair", "available", "binary", "bind", "blind"),
values = c("afford", "affair", "available", "binary", "bind", "blind"))
greedy_match(trie, c("avoid", "bring", "attack"))
}
\seealso{
\code{\link{longest_match}} and \code{\link{prefix_match}}
for longest and prefix matching, respectively.
}
|
