RotateLeft¶
Status: Stable
documented, exercised by the test suite and/or worked examples, with no known limitations recorded.
Description¶
Examples¶
No verified examples yet for this function.
Implementation notes¶
Algorithm. builtin_rotateleft cyclically shifts elements toward the front by n
(default 1) using rotate_rec: at each level it computes the wrapped offset ((n mod len) +
len) mod len and reads element i from source index (i + offset) mod len. A List-valued
n applies a per-level shift amount as the recursion descends into nested lists. RotateRight
is implemented by negating n and calling the same routine.
Attributes: Protected.
Implementation status¶
Stable — documented, exercised by the test suite and/or worked examples, with no known limitations recorded.
References¶
- Source:
src/list.c - Specification:
docs/spec/builtins/structural-manipulation.md
Notes & additional examples¶
Worked examples¶
In[1]:= RotateLeft[{1,2,3,4},1]
Out[1]= {2, 3, 4, 1}
In[2]:= RotateLeft[{a,b,c,d,e},2]
Out[2]= {c, d, e, a, b}
Notes¶
Cyclically shifts elements n positions to the left, wrapping the front elements to the back.