// This file was generated automatically by the Snowball to JSX compiler import "base-stemmer.jsx"; import "among.jsx"; /** * This class was automatically generated by a Snowball to JSX compiler * It implements the stemming algorithm defined by a snowball script. */ class SwedishStemmer extends BaseStemmer { static const serialVersionUID = 1; static const methodObject = new SwedishStemmer(); static const a_0 = [ new Among("a", -1, 1), new Among("arna", 0, 1), new Among("erna", 0, 1), new Among("heterna", 2, 1), new Among("orna", 0, 1), new Among("ad", -1, 1), new Among("e", -1, 1), new Among("ade", 6, 1), new Among("ande", 6, 1), new Among("arne", 6, 1), new Among("are", 6, 1), new Among("aste", 6, 1), new Among("en", -1, 1), new Among("anden", 12, 1), new Among("aren", 12, 1), new Among("heten", 12, 1), new Among("ern", -1, 1), new Among("ar", -1, 1), new Among("er", -1, 1), new Among("heter", 18, 1), new Among("or", -1, 1), new Among("s", -1, 2), new Among("as", 21, 1), new Among("arnas", 22, 1), new Among("ernas", 22, 1), new Among("ornas", 22, 1), new Among("es", 21, 1), new Among("ades", 26, 1), new Among("andes", 26, 1), new Among("ens", 21, 1), new Among("arens", 29, 1), new Among("hetens", 29, 1), new Among("erns", 21, 1), new Among("at", -1, 1), new Among("andet", -1, 1), new Among("het", -1, 1), new Among("ast", -1, 1) ]; static const a_1 = [ new Among("dd", -1, -1), new Among("gd", -1, -1), new Among("nn", -1, -1), new Among("dt", -1, -1), new Among("gt", -1, -1), new Among("kt", -1, -1), new Among("tt", -1, -1) ]; static const a_2 = [ new Among("ig", -1, 1), new Among("lig", 0, 1), new Among("els", -1, 1), new Among("fullt", -1, 3), new Among("l\u00F6st", -1, 2) ]; static const g_v = [17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 32] : int[]; static const g_s_ending = [119, 127, 149] : int[]; var I_x : int = 0; var I_p1 : int = 0; function copy_from (other : SwedishStemmer) : void { this.I_x = other.I_x; this.I_p1 = other.I_p1; super.copy_from(other); } function r_mark_regions () : boolean { var v_1 : int; var v_2 : int; // (, line 26 this.I_p1 = this.limit; // test, line 29 v_1 = this.cursor; // (, line 29 // hop, line 29 { var c : int = this.cursor + 3; if (0 > c || c > this.limit) { return false; } this.cursor = c; } // setmark x, line 29 this.I_x = this.cursor; this.cursor = v_1; // goto, line 30 golab0: while(true) { v_2 = this.cursor; var lab1 = true; lab1: while (lab1 == true) { lab1 = false; if (!(this.in_grouping(SwedishStemmer.g_v, 97, 246))) { break lab1; } this.cursor = v_2; break golab0; } this.cursor = v_2; if (this.cursor >= this.limit) { return false; } this.cursor++; } // gopast, line 30 golab2: while(true) { var lab3 = true; lab3: while (lab3 == true) { lab3 = false; if (!(this.out_grouping(SwedishStemmer.g_v, 97, 246))) { break lab3; } break golab2; } if (this.cursor >= this.limit) { return false; } this.cursor++; } // setmark p1, line 30 this.I_p1 = this.cursor; // try, line 31 var lab4 = true; lab4: while (lab4 == true) { lab4 = false; // (, line 31 if (!(this.I_p1 < this.I_x)) { break lab4; } this.I_p1 = this.I_x; } return true; } function r_main_suffix () : boolean { var among_var : int; var v_1 : int; var v_2 : int; // (, line 36 // setlimit, line 37 v_1 = this.limit - this.cursor; // tomark, line 37 if (this.cursor < this.I_p1) { return false; } this.cursor = this.I_p1; v_2 = this.limit_backward; this.limit_backward = this.cursor; this.cursor = this.limit - v_1; // (, line 37 // [, line 37 this.ket = this.cursor; // substring, line 37 among_var = this.find_among_b(SwedishStemmer.a_0, 37); if (among_var == 0) { this.limit_backward = v_2; return false; } // ], line 37 this.bra = this.cursor; this.limit_backward = v_2; switch (among_var) { case 0: return false; case 1: // (, line 44 // delete, line 44 if (!this.slice_del()) { return false; } break; case 2: // (, line 46 if (!(this.in_grouping_b(SwedishStemmer.g_s_ending, 98, 121))) { return false; } // delete, line 46 if (!this.slice_del()) { return false; } break; } return true; } function r_consonant_pair () : boolean { var v_1 : int; var v_2 : int; var v_3 : int; // setlimit, line 50 v_1 = this.limit - this.cursor; // tomark, line 50 if (this.cursor < this.I_p1) { return false; } this.cursor = this.I_p1; v_2 = this.limit_backward; this.limit_backward = this.cursor; this.cursor = this.limit - v_1; // (, line 50 // and, line 52 v_3 = this.limit - this.cursor; // among, line 51 if (this.find_among_b(SwedishStemmer.a_1, 7) == 0) { this.limit_backward = v_2; return false; } this.cursor = this.limit - v_3; // (, line 52 // [, line 52 this.ket = this.cursor; // next, line 52 if (this.cursor <= this.limit_backward) { this.limit_backward = v_2; return false; } this.cursor--; // ], line 52 this.bra = this.cursor; // delete, line 52 if (!this.slice_del()) { return false; } this.limit_backward = v_2; return true; } function r_other_suffix () : boolean { var among_var : int; var v_1 : int; var v_2 : int; // setlimit, line 55 v_1 = this.limit - this.cursor; // tomark, line 55 if (this.cursor < this.I_p1) { return false; } this.cursor = this.I_p1; v_2 = this.limit_backward; this.limit_backward = this.cursor; this.cursor = this.limit - v_1; // (, line 55 // [, line 56 this.ket = this.cursor; // substring, line 56 among_var = this.find_among_b(SwedishStemmer.a_2, 5); if (among_var == 0) { this.limit_backward = v_2; return false; } // ], line 56 this.bra = this.cursor; switch (among_var) { case 0: this.limit_backward = v_2; return false; case 1: // (, line 57 // delete, line 57 if (!this.slice_del()) { return false; } break; case 2: // (, line 58 // <-, line 58 if (!this.slice_from("l\u00F6s")) { return false; } break; case 3: // (, line 59 // <-, line 59 if (!this.slice_from("full")) { return false; } break; } this.limit_backward = v_2; return true; } override function stem () : boolean { var v_1 : int; var v_2 : int; var v_3 : int; var v_4 : int; // (, line 64 // do, line 66 v_1 = this.cursor; var lab0 = true; lab0: while (lab0 == true) { lab0 = false; // call mark_regions, line 66 if (!this.r_mark_regions()) { break lab0; } } this.cursor = v_1; // backwards, line 67 this.limit_backward = this.cursor; this.cursor = this.limit; // (, line 67 // do, line 68 v_2 = this.limit - this.cursor; var lab1 = true; lab1: while (lab1 == true) { lab1 = false; // call main_suffix, line 68 if (!this.r_main_suffix()) { break lab1; } } this.cursor = this.limit - v_2; // do, line 69 v_3 = this.limit - this.cursor; var lab2 = true; lab2: while (lab2 == true) { lab2 = false; // call consonant_pair, line 69 if (!this.r_consonant_pair()) { break lab2; } } this.cursor = this.limit - v_3; // do, line 70 v_4 = this.limit - this.cursor; var lab3 = true; lab3: while (lab3 == true) { lab3 = false; // call other_suffix, line 70 if (!this.r_other_suffix()) { break lab3; } } this.cursor = this.limit - v_4; this.cursor = this.limit_backward; return true; } function equals (o : variant) : boolean { return o instanceof SwedishStemmer; } function hashCode() : int { //http://stackoverflow.com/questions/194846/is-there-any-kind-of-hashcode-function-in-javascript var classname = "SwedishStemmer"; var hash = 0; if (classname.length == 0) return hash; for (var i = 0; i < classname.length; i++) { var char = classname.charCodeAt(i); hash = ((hash << 5) - hash) + char; hash = hash & hash; // Convert to 32bit integer } return hash; } }