Rather than using
length(), vctrs has notions of prototype (
vec_ptype()) and size (
vec_size()). This vignette motivates why these alternatives are necessary, and connects their definitions to type coercion and the recycling rules.
The idea of a prototype is to capture the metadata associated with a vector, without capturing any data. Unfortunately, the
class() of an object is inadequate for this purpose:
class() doesn’t include attributes. Attributes are important because, for example, they store the levels of a factor, and the timezone of a
POSIXct. You can not combine two factors or two
POSIXcts without thinking about the attribute.
class() of a matrix is “matrix”, and doesn’t include the type of the underlying vector, or the dimensionality.
Instead vctrs takes advantage of R’s vectorised nature and uses a prototype, a 0-observation slice of the vector (this is basically
x but with some subtleties we’ll come back to later) . This is a miniature version of the vector that contains all of the attributes but none of the data.
Conveniently, you can create many prototypes using existing base functions (e.g,
factor(levels = c("a", "b"))). vctrs provides a few helpers (e.g.
new_duration()) where the equivalents in base R are missing.
vec_type() creates a prototype from an existing object. However, many base vectors have uninformative printing methods for 0-length subsets, so vctrs also provides
vec_ptype(), which prints the prototype in a friendly way (and returns nothing).
vec_ptype() allows us to see the prototypes base R classes:.
Atomic vectors have no attributes, and just display the underlying
The prototype of matrices and arrays include the base type, and the dimensions after the first:
The prototype of a factor includes its levels. Levels are a character vector, which can be arbitrarily long, so the prototype just shows a hash. If the hash of two factors is equal it’s highly likely that their levels are also equal.
vec_ptype() prints only the hash, the prototype object itself does contain all levels:
Base R has three key date time classes: dates, date-times (
POSIXct), and durations (
difftime). Date-times have a timezone, and durations have a unit.
Data frames have the most complex prototype: the prototype of a data frame is the name and prototype of each column:
Data frames can have columns that are themselves data frames, making this a “recursive” type:
class(vec_type_common(x, vec_type_common(y, z)) equals
class(vec_type_common(vec_type_common(x, y), z)).
vec_type_common(x, NULL) == x.
vec_type_common() is both commutative and associative (with respect to class), and has an identity element,
NULL, i.e. it’s a commutative monoid. This means the underlying implementation is quite simple: we can find the common type of any number of objects by progressively finding the common type of pairs of objects.
vec_type(), the easiest way to explore
vec_type_common() is with
vec_ptype(): when given multiple inputs, it will print their common prototype. (In other words: program with
vec_type_common() but play with
The common type of atomic vectors is computed very similar to rules of base R, except that we do not coerce to character automatically:
Matrices and arrays are automatically broadcast to higher dimensions:
vec_ptype( array(1, c(0, 1)), array(1, c(0, 2)) ) #> Prototype: <double[,2]> #> 0. ( , <double[,1]> ) = <double[,1]> #> 1. ( <double[,1]> , <double[,2]> ) = <double[,2]> vec_ptype( array(1, c(0, 1)), array(1, c(0, 3)), array(1, c(0, 3, 4)), array(1, c(0, 3, 4, 5)) ) #> Prototype: <double[,3,4,5]> #> 0. ( , <double[,1]> ) = <double[,1]> #> 1. ( <double[,1]> , <double[,3]> ) = <double[,3]> #> 2. ( <double[,3]> , <double[,3,4]> ) = <double[,3,4]> #> 3. ( <double[,3,4]> , <double[,3,4,5]> ) = <double[,3,4,5]>
Provided that the dimensions follow the vctrs recycling rules:
Factors combine levels in the order in which they appear.
Combining a date and date-time yields a date-time:
When combining two date times, the timezone is taken from the first input:
Unless it’s the local timezone, in which case any explicit time zone will win:
vec_ptype( new_datetime(tzone = ""), new_datetime(tzone = ""), new_datetime(tzone = "Pacific/Auckland") ) #> Prototype: <datetime<Pacific/Auckland>> #> 0. ( , <datetime<local>> ) = <datetime<local>> #> 1. ( <datetime<local>> , <datetime<local>> ) = <datetime<local>> #> 2. ( <datetime<local>> , <datetime<Pacific/Auckland>> ) = <datetime<Pacific/Auckland>>
The common type of two data frames is the common type of each column that occurs in both data frames:
vec_ptype( data.frame(x = FALSE), data.frame(x = 1L), data.frame(x = 2.5) ) #> Prototype: <data.frame<x:double>> #> 0. ( , <data.frame<x:logical>> ) = <data.frame<x:logical>> #> 1. ( <data.frame<x:logical>> , <data.frame<x:integer>> ) = <data.frame<x:integer>> #> 2. ( <data.frame<x:integer>> , <data.frame<x:double>> ) = <data.frame<x:double>>
And the union of the columns that only occur in one:
vec_ptype(data.frame(x = 1, y = 1), data.frame(y = 1, z = 1)) #> Prototype: <data.frame< #> x: double #> y: double #> z: double #> >> #> 0. ┌ , <data.frame< ┐ = <data.frame< #> │ x: double │ x: double #> │ y: double │ y: double #> └ >> ┘ >> #> 1. ┌ <data.frame< , <data.frame< ┐ = <data.frame< #> │ x: double y: double │ x: double #> │ y: double z: double │ y: double #> │ >> >> │ z: double #> └ ┘ >>
Note that new columns are added on the right-hand side. This is consistent with the way that factor levels and time zones are handled.
str(vec_cast_common( FALSE, 1:5, 2.5 )) #> List of 3 #> $ : num 0 #> $ : num [1:5] 1 2 3 4 5 #> $ : num 2.5 str(vec_cast_common( factor("x"), factor("y") )) #> List of 2 #> $ : Factor w/ 2 levels "x","y": 1 #> $ : Factor w/ 2 levels "x","y": 2 str(vec_cast_common( data.frame(x = 1), data.frame(y = 1:2) )) #> List of 2 #> $ :'data.frame': 1 obs. of 2 variables: #> ..$ x: num 1 #> ..$ y: int NA #> $ :'data.frame': 2 obs. of 2 variables: #> ..$ x: num [1:2] NA NA #> ..$ y: int [1:2] 1 2
Alternatively, you can cast to a specific prototype using
If a cast is possible in general (i.e. double -> integer), but information is lost for a specific input (e.g. 1.5 -> 1), it will generate a warning.
The set of casts is more permissive than the set of coercions and is summarised in the diagram below. Coercions are shown by arrows; possible casts are shown with circles.
vec_size() was motivated by the need to have an invariant that describes the number of “observations” in a data structure. This is particularly important for data frames as it’s useful to have some function such that
f(x). No base function has this property:
1, because the length of a data frame is the number of columns.
NROW(x) for vector
x, so is almost what we want. But because
NROW() is defined in terms of
length(), it returns a value for every object, even types that can’t go in a data frame, e.g.
data.frame(mean) errors even though
vec_size() as follows:
vec_size(), we can give a precise definition of a data frame: a data frame is a list of vectors where every vector has the same size. This has the desirable property of trivially supporting matrix and data frame columns.
xis a vector.
x[i, , drop = FALSE]when
xis a data frame.
x[i, , , drop = FALSE]when
xis a 3d array.
Closely related to the definition of size are the recycling rules. The recycling rules determine the size of the output when two vectors of different sizes are combined. In vctrs, the recycling rules are encoded in
vec_size_common() which give the common size of a set of vectors:
vctrs obeys a stricter set of recycling rules than base R, only recycling under two circumstances:
All other size combinations will generate an error. This strictness prevents common mistakes like
dest == c("IAH", "HOU")), at the cost of occasionally requiring an explicit calls to
You can apply the recycling rules in two ways:
The recycling rules in base R are described in The R Language Definition but are not implemented in a single function, and thus are not applied consistently. Here I give a brief overview of their most common realisation, as well as showing some of the exceptions.
Generally, in base R, when a pair of vectors is not the same length, the shorter vector is recycled to the same length as the longer:
If the length of the longer vector is not an integer multiple of the length of the shorter, you usually get a warning:
invisible(pmax(1:2, 1:3)) #> Warning in pmax(1:2, 1:3): an argument will be fractionally recycled invisible(1:2 + 1:3) #> Warning in 1:2 + 1:3: longer object length is not a multiple of shorter #> object length invisible(cbind(1:2, 1:3)) #> Warning in cbind(1:2, 1:3): number of rows of result is not a multiple of #> vector length (arg 1)
But some functions recycle silently:
data.frame() throws an error:
The R language definition states that “any arithmetic operation involving a zero-length vector has a zero-length result”. But outside of arithmetic, this rule is not consistently followed:
# length-0 output 1:2 + integer() #> integer(0) atan2(1:2, integer()) #> numeric(0) pmax(1:2, integer()) #> integer(0) # dropped cbind(1:2, integer()) #> [,1] #> [1,] 1 #> [2,] 2 # recycled to length of first ifelse(rep(TRUE, 4), integer(), character()) #>  NA NA NA NA # preserved-ish paste(1:2, integer()) #>  "1 " "2 " # Errors data.frame(1:2, integer()) #> Error in data.frame(1:2, integer()): arguments imply differing number of rows: 2, 0