AtomQ
Details
- You can use AtomQ in a recursive procedure to tell when you have reached the bottom of the tree corresponding to an expression.
- AtomQ gives True for symbols, numbers, strings, and other raw objects, such as sparse arrays.
- AtomQ gives True for any object whose subparts cannot be accessed using functions like Map.
Examples
open allclose allBasic Examples (1)
Scope (6)
Rational numbers appear to have a compound structure:
As numbers, they are not subdividable:
The parts can be accessed through Numerator and Denominator:
Complex numbers appear to have a compound structure:
As numbers, they are not subdividable:
The parts can be accessed through Re and Im:
SparseArray objects are atomic raw objects:
Commands that work with SparseArray objects typically do so on the represented array:
The FullForm of a SparseArray object is designed to be sufficient to reconstruct the raw object:
Applications (2)
Find the number of unsubdividable leaves in an expression:
This is equivalent to LeafCount:
With the option Heads->False, only atoms with no branches are counted:
This corresponds to the dangling leaves you see with TreeForm:
Find the minimum and maximum "depth" of an expression:
Depth gives the maximum depth plus 1:
Properties & Relations (1)
Map[f,expr,{-1}] generally maps f on atoms in expr:
Text
Wolfram Research (1988), AtomQ, Wolfram Language function, https://reference.wolfram.com/language/ref/AtomQ.html (updated 2003).
CMS
Wolfram Language. 1988. "AtomQ." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2003. https://reference.wolfram.com/language/ref/AtomQ.html.
APA
Wolfram Language. (1988). AtomQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/AtomQ.html