From 3cb0260e07d5db98a415e55efaa276ee38620e0f Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Wed, 16 Jun 2021 22:49:51 -0400 Subject: Depth diagram --- docs/doc/depth.html | 47 +++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 47 insertions(+) (limited to 'docs/doc') diff --git a/docs/doc/depth.html b/docs/doc/depth.html index dcb4f812..2b975c4e 100644 --- a/docs/doc/depth.html +++ b/docs/doc/depth.html @@ -5,6 +5,53 @@
BQN / main / doc

Depth

+ + + + 3 + + + + + 2 + + + + 0 + + + 1 + + + + + 0 + + + 0 + + + 0 + + + + + 0 + + + 1 + + + + 0 + + + 0 + + + + +

The depth of an array is the greatest level of array nesting it attains, or, put another way, the greatest number of times you can pick an element starting from the original array before reaching an atom. The monadic function Depth (≡) returns the depth of its argument, while the 2-modifier Depth (⚇) can control the way its left operand is applied based on the depth of its arguments. Several primitive functions also use the depth of the left argument to decide whether it applies to a single axis of the right argument or to several axes.

The Depth function

To find the depth of an array, use Depth (≡). For example, the depth of a list of numbers or characters is 1:

-- cgit v1.2.3