How to resolve the algorithm Display an outline as a nested table step by step in the J programming language

Published on 12 May 2024 09:40 PM
#J

How to resolve the algorithm Display an outline as a nested table step by step in the J programming language

Table of Contents

Problem Statement

The graphic representation of outlines is a staple of mind-mapping and the planning of papers, reports, and speeches. Given a outline with at least 3 levels of indentation, for example: write a program in your language which translates your outline into a nested table, with WikiTable or HTML colspan values attached (where needed) to parent nodes in the nested table. The WikiTable at the top of this page was generated from the indented outline shown above, producing the following markup string: Use background color to distinguish the main stages of your outline, so that the subtree of each node at level two is consistently colored, and the edges between adjacent subtrees are immediately revealed.

Display your nested table on this page.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Display an outline as a nested table step by step in the J programming language

Source code in the j programming language

depth=: (i.~ ~.)@(0 i."1~' '=];._2)
tree=: (i: 0>.<:@{:)\
width=: {{NB. y is tree
   c=. *i.#y  NB. children
   NB. sum of children, inductively
   y (+//. c&*)`(~.@[)`]}^:_ c
}}

NB. avoid dark colors
NB. avoid dark colors
NB. avoid dark colors
pastel=: {{256#.192+?y$,:3#64}}

task=: {{
   depths=: depth y   NB. outline structure
   t=: tree depths    NB. outline as tree
   pad=: (i.#depths) -. t,I.(=>./)depths
   tr=: t,pad         NB. outline as constant depth tree
   dr=: depths,1+pad{depths
   lines=:(#dr){.<@dlb;._2 y
   widths=. width tr  NB. column widths
   top=. I.2>dr
   color=.<"1 hfd 8421504 (I.tr e.pad)} (top top} tr)&{^:_ (<:2^24),pastel<:#dr
   r=.'{| class="wikitable" style="text-align: center;"',LF
   for_d.~.dr do.     NB. descend through the depths
    k=.I.d=dr         NB. all lines at this depth
    p=. |:({:,~{&tr)^:d ,:k
    j=. k/:p          NB. order padding to fit parents
    r=. r,'|-',LF
    r=. r,;'| style="background: #',L:0 (j{color),L:0'" colspan=',L:0(j{widths),&":each' | ',L:0 (j{lines),L:0 LF
   end.
   r=.r,'|}',LF
}}


outline=:{{)n
Display an outline as a nested table.
    Parse the outline to a tree,
        measuring the indent of each line,
        translating the indentation to a nested structure,
        and padding the tree to even depth.
    count the leaves descending from each node,
        defining the width of a leaf as 1,
        and the width of a parent node as a sum.
            (The sum of the widths of its children)
    and write out a table with 'colspan' values
        either as a wiki table,
        or as HTML.
}}

You may also check:How to resolve the algorithm Stack step by step in the Ioke programming language
You may also check:How to resolve the algorithm Concurrent computing step by step in the C# programming language
You may also check:How to resolve the algorithm S-expressions step by step in the J programming language
You may also check:How to resolve the algorithm Roots of a function step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Calkin-Wilf sequence step by step in the ALGOL 68 programming language