Sort an outline at every level: Difference between revisions

 

=={{header|AutoHotkey}}==

;-----------------------

; get Delim, Error Check

result.=delim

return result

(

zeta

MsgBox % Sort_an_outline(Data_2)

MsgBox % Sort_an_outline(Data_2, 1)

Output: tabulated for ease of reading, actual output is text only, Error check returns first line with inconsistent delimiter!<pre>

======================================================================================================

=={{header|Go}}==

{{trans|Wren}}

 

import (

fmt.Println("\nSecond unspecified outline, descending sort:")

sortedOutline(outline4, false)

 

{{out}}

 

=={{header|Haskell}}==

 

import Data.Tree (Tree(..), foldTree)

| x <- textLines

, s <- [T.takeWhile isSpace x]

{{Out}}

<pre>Four-spaced (A -> Z):

 

=={{header|J}}==

((=<./)y (1 i.~ -.@e.)S:0 m) m {{

({.y),<m parse2^:(*@#)}.y

sortout=: {{ if. L.y do. u~ ({."1 y),.u sortout each}."1 y else. u~y end. }}

 

 

alpha

epsilon

gamma

delta

 

Data for task examples:

zeta

beta

iota

epsilon

 

=={{header|Julia}}==

A <code>for</code> loop was used in the constructor, and recursive functions for sorting and printing.

 

abstract type Entry end

println(y)

end

<pre>

Given the text:

There are several differences between the Julia original and our transcription. Most are due to the fact that Nim way to do some things is different of the Julia way to do it.

 

 

type

epsilon""")

except ValueError:

 

{{out}}

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Sort_an_outline_at_every_level

theta

iota

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">without</span> <span style="color: #008080;">javascript_semantics</span> <span style="color: #000080;font-style:italic;">-- (tab chars are browser kryptonite)</span>

<span style="color: #008080;">procedure</span> <span style="color: #000000;">print_children</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">lines</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">children</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">string</span> <span style="color: #000000;">indent</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">bool</span> <span style="color: #000000;">bRev</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">test</span><span style="color: #0000FF;">(</span><span style="color: #000000;">lines</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

 

=={{header|Python}}==

 

 

# MAIN ---

if __name__ == '__main__':

{{Out}}

<pre>4-space indented (A -> Z):

* Routine(s) to output the data structure in the desire sort order.

 

zeta

beta

multi pretty-print (Str $struct, :$level = 0, :$ws = ' ', :$desc = False) {

say $ws x $level , $struct;

{{out}}

<pre>=======================================================

{{libheader|Wren-sort}}

{{libheader|Wren-fmt}}

import "/fmt" for Fmt

 

 

System.print("\nSecond unspecified outline, descending sort:")

 

{{out}}