EVOLUTION-MANAGER
Edit File: unlist.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Flatten Lists</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for unlist {base}"><tr><td>unlist {base}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Flatten Lists</h2> <h3>Description</h3> <p>Given a list structure <code>x</code>, <code>unlist</code> simplifies it to produce a vector which contains all the atomic components which occur in <code>x</code>. </p> <h3>Usage</h3> <pre> unlist(x, recursive = TRUE, use.names = TRUE) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>x</code></td> <td> <p>an <span style="font-family: Courier New, Courier; color: #666666;"><b>R</b></span> object, typically a list or vector.</p> </td></tr> <tr valign="top"><td><code>recursive</code></td> <td> <p>logical. Should unlisting be applied to list components of <code>x</code>?</p> </td></tr> <tr valign="top"><td><code>use.names</code></td> <td> <p>logical. Should names be preserved?</p> </td></tr> </table> <h3>Details</h3> <p><code>unlist</code> is generic: you can write methods to handle specific classes of objects, see <a href="InternalMethods.html">InternalMethods</a>, and note, e.g., <code><a href="../../utils/html/relist.html">relist</a></code> with the <code>unlist</code> method for <code>relistable</code> objects. </p> <p>If <code>recursive = FALSE</code>, the function will not recurse beyond the first level items in <code>x</code>. </p> <p>Factors are treated specially. If all non-list elements of <code>x</code> are <code><a href="factor.html">factor</a></code> (or ordered factor) objects then the result will be a factor with levels the union of the level sets of the elements, in the order the levels occur in the level sets of the elements (which means that if all the elements have the same level set, that is the level set of the result). </p> <p><code>x</code> can be an atomic vector, but then <code>unlist</code> does nothing useful, not even drop names. </p> <p>By default, <code>unlist</code> tries to retain the naming information present in <code>x</code>. If <code>use.names = FALSE</code> all naming information is dropped. </p> <p>Where possible the list elements are coerced to a common mode during the unlisting, and so the result often ends up as a character vector. Vectors will be coerced to the highest type of the components in the hierarchy NULL < raw < logical < integer < double < complex < character < list < expression: pairlists are treated as lists. </p> <p>A list is a (generic) vector, and the simplified vector might still be a list (and might be unchanged). Non-vector elements of the list (for example language elements such as names, formulas and calls) are not coerced, and so a list containing one or more of these remains a list. (The effect of unlisting an <code><a href="../../stats/html/lm.html">lm</a></code> fit is a list which has individual residuals as components.) Note that <code>unlist(x)</code> now returns <code>x</code> unchanged also for non-vector <code>x</code>, instead of signalling an error in that case. </p> <h3>Value</h3> <p><code>NULL</code> or an expression or a vector of an appropriate mode to hold the list components. </p> <p>The output type is determined from the highest type of the components in the hierarchy NULL < raw < logical < integer < double < complex < character < list < expression, after coercion of pairlists to lists. </p> <h3>References</h3> <p>Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988) <em>The New S Language</em>. Wadsworth & Brooks/Cole. </p> <h3>See Also</h3> <p><code><a href="c.html">c</a></code>, <code><a href="list.html">as.list</a></code>, <code><a href="../../utils/html/relist.html">relist</a></code>. </p> <h3>Examples</h3> <pre> unlist(options()) unlist(options(), use.names = FALSE) l.ex <- list(a = list(1:5, LETTERS[1:5]), b = "Z", c = NA) unlist(l.ex, recursive = FALSE) unlist(l.ex, recursive = TRUE) l1 <- list(a = "a", b = 2, c = pi+2i) unlist(l1) # a character vector l2 <- list(a = "a", b = as.name("b"), c = pi+2i) unlist(l2) # remains a list ll <- list(as.name("sinc"), quote( a + b ), 1:10, letters, expression(1+x)) utils::str(ll) for(x in ll) stopifnot(identical(x, unlist(x))) </pre> <hr /><div style="text-align: center;">[Package <em>base</em> version 3.6.0 <a href="00Index.html">Index</a>]</div> </body></html>