use v6;
use NativeCall;
use Algorithm::LibSVM::Node;
use Algorithm::LibSVM::Actions;
use Algorithm::LibSVM::Grammar;

my class Algorithm::LibSVM::CProblem:auth<zef:titsuki>:ver<0.0.14> is export is repr('CStruct') {
    has int32 $.l;
    has CArray[num64] $!y;
    has CArray[Algorithm::LibSVM::Node] $!x;

    method BUILD(int32 :$l, CArray[num64] :$y, CArray[Algorithm::LibSVM::Node] :$x) {
        $!l = $l;
        $!y := $y;
        $!x := $x;
    }

    method y(--> List) {
        my @ret;
        @ret[$_] = $!y[$_] for ^$!l;
        @ret
    }

    method x(--> List) {
        my @ret;
        @ret[$_] = $!x[$_] for ^$!l;
        @ret
    }
}

my class Algorithm::LibSVM::Problem:auth<zef:titsuki>:ver<0.0.14> is export {
    has Algorithm::LibSVM::CProblem $.as-c;
    has Int $.nr-feature;
    method BUILD(int32 :$l, CArray[num64] :$y, CArray[Algorithm::LibSVM::Node] :$x, :$!nr-feature) {
        $!as-c := Algorithm::LibSVM::CProblem.new(:$l, :$y, :$x);
    }
    method l(--> Int) { $!as-c.l }
    method x(--> List) { $!as-c.x }
    method y(--> List) { $!as-c.y }

    multi method _load-problem(::?CLASS:U: \lines --> Algorithm::LibSVM::Problem) {
        self!_load-problem(lines)
    }

    multi method _load-problem(::?CLASS:U: Str $filename --> Algorithm::LibSVM::Problem) {
        self!_load-problem($filename.IO.lines)
    }

    method from-file(::?CLASS:U: Str $filename --> Algorithm::LibSVM::Problem) {
        self!_load-problem($filename.IO.lines)
    }

    method from-matrix(::?CLASS:U: @x where { $_.shape ~~ ($,$) }, @y --> Algorithm::LibSVM::Problem) {
        my ($nr, $nc) = @x.shape;
        my $nr-feature = 0;
        my $prob-y = CArray[num64].new;
        my $prob-x = CArray[Algorithm::LibSVM::Node].new;
        my $y-idx = 0;
        for ^@y -> $row {
            my $next = Algorithm::LibSVM::Node.new(index => -1, value => 0e0);
            for (1..$nc).reverse -> $index {
                next unless @x[$row;$index-1].defined;
                $nr-feature = ($nr-feature, $index.Int).max;
                $next = Algorithm::LibSVM::Node.new(index => $index, value => @x[$row;$index-1].Num, next => $next);
            }
            $prob-y[$y-idx] = @y[$y-idx].Num;
            $prob-x[$y-idx] = $next;
            $y-idx++;
        }
        Algorithm::LibSVM::Problem.new(l => $y-idx, y => $prob-y, x => $prob-x, :$nr-feature);
    }

    method from-kernel-matrix(::?CLASS:U: @x where { $_.shape ~~ ($,$) }, @y --> Algorithm::LibSVM::Problem) {
        my ($nr, $nc) = @x.shape;
        my $nr-feature = 0;
        my $prob-y = CArray[num64].new;
        my $prob-x = CArray[Algorithm::LibSVM::Node].new;
        my $y-idx = 0;
        for ^$nr -> $i {
            my $next = Algorithm::LibSVM::Node.new(index => -1, value => 0e0);
            for @(^$nc).reverse -> $j {
                next unless @x[$i;$j].defined;
                $nr-feature = ($nr-feature, $j.Int + 1).max;
                $next = Algorithm::LibSVM::Node.new(index => $j + 1, value => @x[$i;$j].Num, next => $next);
            }
            $next = Algorithm::LibSVM::Node.new(index => 0, value => ($i + 1).Num, next => $next);
            $prob-y[$y-idx] = @y[$y-idx].Num;
            $prob-x[$y-idx] = $next;
            $y-idx++;
        }
        Algorithm::LibSVM::Problem.new(l => $y-idx, y => $prob-y, x => $prob-x, :$nr-feature);
    }

    method !_load-problem(\lines) {
        my $nr-feature = 0;
        my $prob-y = CArray[num64].new;
        my $prob-x = CArray[Algorithm::LibSVM::Node].new;
        my $y-idx = 0;
        for lines -> $line {
            my $parsed = Algorithm::LibSVM::Grammar.parse($line, actions => Algorithm::LibSVM::Actions).made;
            my ($label, $feature) = $parsed.head<label>, $parsed.head<pairs>;

            my $next = Algorithm::LibSVM::Node.new(index => -1, value => 0e0);
            for @($feature).sort(-*.key).map({ .key, .value }) -> ($index, $value) {
                $nr-feature = ($nr-feature, $index.Int).max;
                $next = Algorithm::LibSVM::Node.new(index => $index.Int, value => $value.Num, next => $next);
            }
            $prob-y[$y-idx] = $label.Num;
            $prob-x[$y-idx] = $next;
            $y-idx++;
        }
        return Algorithm::LibSVM::Problem.new(l => $y-idx, y => $prob-y, x => $prob-x, :$nr-feature);
    }
}



head

Algorithm::LibSVM::Problem - A Raku Algorithm::LibSVM::Problem class


Algorithm::LibSVM::Problem is a Raku Algorithm::LibSVM::Problem class


Returns the number of the training data.


Returns the array containing the target values (C<Int> values in classification, C<Num> values in regression) of the training data.


Returns the array of pointers, each of which points to a sparse representation (i.e. array of C<Algorithm::LibSVM::Node>) of one training vector.


method from-matrix(::?CLASS:U: @x where { $_.shape ~~ ($,$) }, @y --> Algorithm::LibSVM::Problem)


Creates a C<Algorithm::LibSVM::Problem> instance. Where C<@x> is the 2-dimensional shaped matrix for features, C<@y> is the 1-dimensional array for labels.


method from-kernel-matrix(::?CLASS:U: @x where { $_.shape ~~ ($,$) }, @y --> Algorithm::LibSVM::Problem)


Creates a C<Algorithm::LibSVM::Problem> instance. Where C<@x> is the 2-dimensional shaped kernel matrix, C<@y> is the 1-dimensional array for labels.


method from-file(::?CLASS:U: Str $filename --> Algorithm::LibSVM::Problem)


Creates a C<Algorithm::LibSVM::Problem> instance. Where <$filename> is the filename of the libsvm format file.


This library is free software; you can redistribute it and/or modify it under the terms of the MIT License.


libsvm ( https://github.com/cjlin1/libsvm ) by Chih-Chung Chang and Chih-Jen Lin is licensed under the BSD 3-Clause License.


root

README

Parameter

React

=begin React :component<HeaderCol> :id<menu> 
=para L<Documentation|/doc/introduction>
=para L<Modules| /mods>
=para L<Examples| file:../examples/index.podlite>
=para L<Download |file:../download/index.podlite>
=para L<About|file:../about/index.podlite>
=para 🔍 K<⌘K>/K<ctrl-K>
=end React


=begin React :component<HeaderCol> :id<footer>  
=begin nested :!nested
=item1 B<Language>
    =item2 L<Get started|file:../getting-started/getting-started.podlite>
    =item2 L<Why Raku?|/doc/language/faq#Why-should-I-learn-Raku-What's-so-great-about-it>
    =item2 L<Try Raku|https://glot.io/new/raku>
    =item2 L<Raku cheat sheet|https://github.com/Raku/mu/blob/master/docs/Perl6/Cheatsheet/cheatsheet.txt>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<Raku on Exercism|https://exercism.org/tracks/raku>
    =item2 L<Wikipedia|https://en.wikipedia.org/wiki/Raku_(programming_language)>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=end nested
=begin nested :!nested

=item1 B<L<Documentation|/doc>>
    =item2 L<Getting started, Migration guides from other languages, & Tutorials | file:../doc/introduction.podlite>
    =item2 L<Language References|file:../doc/reference.podlite>
    =item2 L<Type Reference| file:../doc/types.podlite>
    =item2 L<Miscellaneous| file:../doc/miscellaneous.podlite>
    =item2 L<FAQs (Frequently Asked Questions)|/doc/language/faq>
    =item2 L<Community|/doc/language/community>
    =item2 L<The list of all documents|file:../doc/index.podlite>

=item1 B<Resources>
    =item2 L<The Raku Guide|https://raku.guide/>
    =item2 L<Books |https://perl6book.com/>
    =item2 L<Rosetta Code | https://www.raku.org/community/rosettacode>

=end nested
=begin nested :!nested

=item1 B<Resoures>
    =item2 L<Download | file:../download/index.podlite>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=item1 B<Learning>
    =item2 L<The Raku Guide|https://raku.guide/>
    =item2 L<Wikibook |https://en.wikibooks.org/wiki/Raku_Programming>
    =item2 L<Books |https://perl6book.com/>
    =item2 L<Rosetta Code | https://www.raku.org/community/rosettacode>
    =item2 L<Learn Raku in Y minutes|https://learnxinyminutes.com/docs/raku/>
    =item2 L<Golfing |https://github.com/AlexDaniel/raku-golf-cheatsheet>
=end nested
=begin nested :!nested

=item1 B<Explore>
    =item2 L<Raku Blog Aggregator|https://planet.raku.org/>
    =item2 L<Rakudo Weekly|https://rakudoweekly.blog/>
    =item2 L<The Weekly Challenge |https://perlweeklychallenge.org/>
    =item2 L<Raku Advent Calendar|https://raku-advent.blog/>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=end nested
=end React


=begin React :component<CookieConsent> :id<CookieConsent> :buttonCaption("Got it!")
=para
This website uses cookies for analytics.
=end React


Problem

NAME

SYNOPSIS

DESCRIPTION

METHODS

l

y

x

nr-feature

from-matrix

from-kernel-matrix

from-file

AUTHOR

COPYRIGHT AND LICENSE

Algorithm::LibSVM v0.0.16

Authors

License

Dependencies

Test Dependencies

Provides

Documentation