From 2afb23928e1984d475cc460e1672e8f6fa0e4dbe Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Wed, 11 Aug 2021 17:21:31 -0400 Subject: Allow clicking on header to get fragment link --- docs/doc/depth.html | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'docs/doc/depth.html') diff --git a/docs/doc/depth.html b/docs/doc/depth.html index c2501726..6d043d8d 100644 --- a/docs/doc/depth.html +++ b/docs/doc/depth.html @@ -4,7 +4,7 @@ BQN: Depth -

Depth

+

Depth

@@ -65,7 +65,7 @@

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

+

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:

↗️
     234
 1
@@ -105,7 +105,7 @@
     2030
 1
 
-

Testing depth for multiple-axis primitives

+

Testing depth for multiple-axis primitives

Several primitive functions use the left argument to manipulate the right argument along one or more axes, using the leading axis convention.

@@ -151,7 +151,7 @@ ↗️
    214 <¨ 3452
 ⟨ ⟨ 2 1 4 0 ⟩ ⟨ 2 1 4 1 ⟩ ⟩
 
-

The Depth modifier

+

The Depth modifier

The Depth 2-modifier () is a generalization of Each that allows diving deeper into an array. To illustrate it we'll use a shape 43 array of lists of lists.

↗️
     n  <12 4322⥊↕48
 ┌─                                                                         
-- 
cgit v1.2.3