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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
\name{lcSuffix}
\alias{lcSuffix}
\alias{lcPrefix}
\alias{lcPrefixC}
\title{Compute the longest common prefix or suffix of a string}
\description{
These functions find the longest common prefix or suffix among the
strings in a character vector.
}
\usage{
lcPrefix(x, ignore.case=FALSE)
lcPrefixC(x, ignore.case=FALSE)
lcSuffix(x, ignore.case=FALSE)
}
\arguments{
\item{x}{ a character vector. }
\item{ignore.case}{ A logical value indicating whether or
not to ignore the case in making comparisons. }
}
\details{
Computing the longest common suffix is helpful for truncating names of
objects, like microarrays, that often have a common suffix, such as .CEL.
There are some potential problems with the approach used if
multibyte character encodings are being used.
\code{lcPrefixC} is a faster implementation in C. It only handles
ascii characters.
}
\value{
The common prefix or suffix.
}
\author{ R. Gentleman }
\seealso{ \code{\link{nchar}}, \code{\link{nchar}}}
\examples{
s1 <- c("ABC.CEL", "DEF.CEL")
lcSuffix(s1)
s2 <- c("ABC.123", "ABC.456")
lcPrefix(s2)
CHK <- stopifnot
CHK(".CEL" == lcSuffix(s1))
CHK("bc" == lcSuffix(c("abc", "333abc", "bc")))
CHK("c" == lcSuffix(c("c", "abc", "xxxc")))
CHK("" == lcSuffix(c("c", "abc", "xxx")))
CHK("ABC." == lcPrefix(s2))
CHK("ab" == lcPrefix(c("abcd", "abcd123", "ab", "abc", "abc333333")))
CHK("a" == lcPrefix(c("abcd", "abcd123", "ax")))
CHK("a" == lcPrefix(c("a", "abcd123", "ax")))
CHK("" == lcPrefix(c("a", "abc", "xxx")))
CHK("ab" == lcPrefixC(c("abcd", "abcd123", "ab", "abc", "abc333333")))
CHK("a" == lcPrefixC(c("abcd", "abcd123", "ax")))
CHK("a" == lcPrefixC(c("a", "abcd123", "ax")))
CHK("" == lcPrefixC(c("a", "abc", "xxx")))
}
\keyword{ manip }
|
