Suffix tree: Difference between revisions

{{trans|Python}}

String sub

[Int] ch

f(0, ‘’)

{{out}}

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

{{trans|C++}}

using System.Collections.Generic;

}

}

{{out}}

<pre>+

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

{{trans|D}}

#include <iostream>

#include <vector>

int main() {

SuffixTree("banana$").visualize();

{{out}}

<pre>+

=={{header|D}}==

{{trans|Kotlin}}

struct Node {

void main() {

SuffixTree("banana$").visualize();

{{out}}

<pre>┐

=={{header|Go}}==

Vis function from [[Visualize_a_tree#Unicode]].

import "fmt"

}

f(0, "")

{{out}}

<pre>

Implementation:

build_tree=:3 :0

tree=. B=:|:build_tree <\. y

((1+#y)-each {.tree),}.tree

Task example:

┌──┬───────┬─┬──┬───┬─┬─┬──┬───┬─┬─┐

│__│1 │_│_ │2 │4│6│_ │3 │5│7│

├──┼───────┼─┼──┼───┼─┼─┼──┼───┼─┼─┤

│ │banana$│a│na│na$│$│$│na│na$│$│$│

The first row is the leaf number (_ for internal nodes).

Visualizing, using [[Visualize_a_tree#J|showtree]] and prefixing the substring leading to each leaf with the leaf number (in brackets):

fmttree suffix_tree 'banana$'

├─ na ────────┴─ [5] $

└─ [7] $

=={{header|Java}}==

{{trans|Kotlin}}

import java.util.List;

new SuffixTree("banana$").visualize();

}

{{out}}

<pre>┐

=={{header|JavaScript}}==

{{trans|Java}}

sub = ''; // a substring of the input string

children = []; // list of child nodes

const st = new SuffixTree('banana');

{{out}}

=={{header|Julia}}==

{{trans|Go}}

mutable struct Node

println(SuffixTree("banana\$"))

<pre>

┐

=={{header|Kotlin}}==

{{trans|Go}}

class Node {

fun main(args: Array<String>) {

SuffixTree("banana$").visualize()

{{out}}

=={{header|Nim}}==

{{trans|Go}}

Tree = seq[Node]

{{out}}

=={{header|Perl}}==

{{trans|Raku}}

use warnings;

use Data::Dumper;

return $h;

}

{{out}}

<pre>$VAR1 = {

=={{header|Phix}}==

{{trans|D}}

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

<span style="color: #000080;font-style:italic;">-- tree nodes are simply {string substr, sequence children_idx}</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">t</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">SuffixTree</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"banana$"</span><span style="color: #0000FF;">)</span>

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

{{out}}

<pre>

=={{header|Python}}==

{{trans|D}}

def __init__(self, sub="", children=None):

self.sub = sub

f(0, "")

{{out}}

<pre>+-

by Danny Yoo for more information on how to use suffix trees in Racket.

(require (planet dyoo/suffixtree))

(define tree (make-tree))

((list c ct ...) (show-node c (string-append dpth " |")) (l ct)))))

{{out}}

The display code is a variant of the [[visualize_a_tree#Raku|visualize a tree]] task code.

multi suffix-tree(@a) {

hash

}

flat visit($tree, $indent xx 2);

{{out}}

=={{header|Sidef}}==

{{trans|Raku}}

suffix_tree(^t.len -> map { t.substr(_) })

}

}

{{out}}

<pre>

=={{header|Wren}}==

{{trans|Kotlin}}

construct new() {

_sub = "" // a substring of the input string

}

{{out}}