Eertree: Difference between revisions

{{trans|D}}

Int length

Int suffix

V tree = eertree(‘eertree’)

{{out}}

=={{header|C sharp|C#}}==

{{trans|Java}}

using System.Collections.Generic;

}

}

{{out}}

<pre>[ee, e, r, t, rtr, ertre, eertree]</pre>

=={{header|C++}}==

{{trans|D}}

#include <functional>

#include <map>

return 0;

{{out}}

<pre>[ee, e, r, t, rtr, ertre, eertree]</pre>

=={{header|D}}==

{{trans|Go}}

import std.stdio;

}

return s.data;

{{out}}

<pre>["ee", "e", "r", "t", "rtr", "ertre", "eertree"]</pre>

=={{header|Go}}==

import "fmt"

}

return

{{out}}

<pre>

=={{header|Java}}==

{{trans|D}}

import java.util.HashMap;

import java.util.List;

}

}

{{out}}

<pre>[ee, r, t, rtr, ertre, eertree, e]</pre>

=={{header|Julia}}==

{{trans|Python}}

edges::Dict{Char, Node}

link::Union{Node, Missing}

eertree("eertree")

Results of processing string "eertree":

Number of sub-palindromes: 7

=={{header|Kotlin}}==

{{trans|Python}}

class Node {

val result = eertree.getSubPalindromes()

println("Sub-palindromes: $result")

{{out}}

=={{header|M2000 Interpreter}}==

If Version<9.5 Then exit

If Version=9.5 And Revision<2 Then Exit

Print Palindromes$(eertree("eertree"))

{{out}}

<pre>

=={{header|Nim}}==

{{trans|Kotlin}}

type

echo fmt"Number of sub-palindromes: {eertree.nodes.len}"

let result = eertree.getSubPalindromes()

{{out}}

=={{header|Objeck}}==

{{trans|Java}}

class Eertree {

return @edges;

}

{{output}}

=={{header|Perl}}==

{{trans|Raku}}

for $n (1 .. length($str)) {

}

{{out}}

<pre>e ee eertree ertre r rtr t</pre>

=={{header|Phix}}==

If you use this in anger it may be wise to replace {string chars, sequence next} with a dictionary, which can obviously be either a new dictionary for each node, or perhaps better a single/per tree dictionary keyed on {n,ch}.

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">enum</span> <span style="color: #000000;">LEN</span><span style="color: #0000FF;">,</span><span style="color: #000000;">SUFF</span><span style="color: #0000FF;">,</span><span style="color: #000000;">CHARS</span><span style="color: #0000FF;">,</span><span style="color: #000000;">NEXT</span>

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

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

{{out}}

The tree matches Fig 1 in the pdf linked above.

=={{header|Python}}==

from __future__ import print_function

eertree.get_sub_palindromes(eertree.rto, [eertree.rto], [], result) #Odd length words

eertree.get_sub_palindromes(eertree.rte, [eertree.rte], [], result) #Even length words

{{out}}

{{trans|Python}}

(struct node (edges ; edges (or forward links)

link ; suffix link (backward links)

(for ((c "eertree")) (eertree-add! et (char->integer c)))

(map (compose list->string (curry map integer->char)) (eertree-get-palindromes et)))

{{out}}

(formerly Perl 6)

{{trans|Ring}}

my @pal = ();

my ($strrev,$strpal);

say @pal.unique;

{{out}}

<pre>

=={{header|REXX}}==

This REXX program is modeled after the &nbsp; '''Ring''' &nbsp; example.

parse arg x . /*obtain optional input string from CL.*/

if x=='' | x=="," then x= 'eertree' /*Not specified? Then use the default.*/

say '──────── The number of sub─palindromes found: ' words($)

say '──────── The list of sub─palindromes found: ' strip($)

{{out|output|text=&nbsp; when using the default input:}}

<pre>

=={{header|Ring}}==

# Project : Eertree

next

see sortpal + nl

Output:

<pre>

=={{header|Ruby}}==

{{trans|D}}

def initialize(length, edges = {}, suffix = 0)

@length = length

tree = eertree("eertree")

{{out}}

<pre>["ee", "e", "r", "t", "rtr", "ertre", "eertree"]</pre>

=={{header|Visual Basic .NET}}==

{{trans|C#}}

Class Node

End Sub

{{out}}

<pre>[ee, e, r, t, rtr, ertre, eertree]</pre>

=={{header|Wren}}==

{{trans|Kotlin}}

construct new() {

_edges = {} // edges (or forward links)

System.print("Number of sub-palindromes: %(eertree.nodes.count)")

var result = eertree.getSubPalindromes()

{{out}}

=={{header|zkl}}==

{{trans|Python}}

fcn init(length){

var edges=Dictionary(), # edges (or forward links). (char:Node)

}

}

println("Processing string \"", st,"\"");

eertree:=Eertree(st);

println("Number of sub-palindromes: ", eertree.nodes.len());

{{out}}

<pre>