From afa17dfda2fb4fcc74e58236b2bf86f9ba6c50a4 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 22 Aug 2020 14:15:28 -0400 Subject: Add favicon --- docs/doc/depth.html | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) (limited to 'docs/doc/depth.html') diff --git a/docs/doc/depth.html b/docs/doc/depth.html index e7f8f143..8c293d9a 100644 --- a/docs/doc/depth.html +++ b/docs/doc/depth.html @@ -1,4 +1,7 @@ - + + + +
BQN

Depth

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 a non-array. 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.

-- cgit v1.2.3