Databases
StackOverflow2013
Postsdbo
POhow to convert a char array into string in java
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POhow to convert a char array into string in java
    primarykey
    data
    text
    <p>this is my porter stemmer program....i got the output in char array in stem() function....and i tried to convert that into string...but it takes the older value and not the new one.that is for example-"looking" is stemmed to give "look"....."look" is in char array (b[c] in stem ()) but while converting it into string takes the value "looking"<br> package file;</p> <pre><code>import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileReader; import java.io.FileWriter; import java.util.StringTokenizer; import java.util.Vector; /** * * @author sky */ public class stemmer { public static String line1,line,element,sentence,str; private char[] b; private int i, /* offset into b */ i_end, /* offset to end of stemmed word */ j, k; private static final int INC = 50; /* unit of size whereby b is increased */ public stemmer() { //b = new char[INC]; i = 0; i_end = 0; } /** * Add a character to the word being stemmed. When you are finished * adding characters, you can call stem(void) to stem the word. */ public void add(char ch) { System.out.println("in add() function"); if (i == b.length) { char[] new_b = new char[i+INC]; for (int c = 0; c &lt; i; c++) new_b[c] = b[c]; b = new_b; } b[i++] = ch; } /** Adds wLen characters to the word being stemmed contained in a portion * of a char[] array. This is like repeated calls of add(char ch), but * faster. */ public void add(char[] w, int wLen) { if (i+wLen &gt;= b.length) { char[] new_b = new char[i+wLen+INC]; for (int c = 0; c &lt; i; c++) new_b[c] = b[c]; b = new_b; } for (int c = 0; c &lt; wLen; c++) b[i++] = w[c]; } public void addstring(String s1) { b=new char[s1.length()]; for(int k=0;k&lt;s1.length();k++) { b[k] = s1.charAt(k); //System.out.println(b[k]); } i=s1.length(); } /** * After a word has been stemmed, it can be retrieved by toString(), * or a reference to the internal buffer can be retrieved by getResultBuffer * and getResultLength (which is generally more efficient.) */ public String toString() { return new String(b,0,i_end); } /** * Returns the length of the word resulting from the stemming process. */ public int getResultLength() { return i_end; } /** * Returns a reference to a character buffer containing the results of * the stemming process. You also need to consult getResultLength() * to determine the length of the result. */ public char[] getResultBuffer() { return b; } /* cons(i) is true &lt;=&gt; b[i] is a consonant. */ private final boolean cons(int i) { switch (b[i]) { case 'a': case 'e': case 'i': case 'o': case 'u': return false; case 'y': return (i==0) ? true : !cons(i-1); default: return true; } } /* m() measures the number of consonant sequences between 0 and j. if c is a consonant sequence and v a vowel sequence, and &lt;..&gt; indicates arbitrary presence, &lt;c&gt;&lt;v&gt; gives 0 &lt;c&gt;vc&lt;v&gt; gives 1 &lt;c&gt;vcvc&lt;v&gt; gives 2 &lt;c&gt;vcvcvc&lt;v&gt; gives 3 .... */ private final int m() { int n = 0; int i = 0; while(true) { if (i &gt; j) return n; if (! cons(i)) break; i++; } i++; while(true) { while(true) { if (i &gt; j) return n; if (cons(i)) break; i++; } i++; n++; while(true) { if (i &gt; j) return n; if (! cons(i)) break; i++; } i++; } } /* vowelinstem() is true &lt;=&gt; 0,...j contains a vowel */ private final boolean vowelinstem() { int i; for (i = 0; i &lt;= j; i++) if (! cons(i)) return true; return false; } /* doublec(j) is true &lt;=&gt; j,(j-1) contain a double consonant. */ private final boolean doublec(int j) { if (j &lt; 1) return false; if (b[j] != b[j-1]) return false; return cons(j); } /* cvc(i) is true &lt;=&gt; i-2,i-1,i has the form consonant - vowel - consonant and also if the second c is not w,x or y. this is used when trying to restore an e at the end of a short word. e.g. cav(e), lov(e), hop(e), crim(e), but snow, box, tray. */ private final boolean cvc(int i) { if (i &lt; 2 || !cons(i) || cons(i-1) || !cons(i-2)) return false; { int ch = b[i]; if (ch == 'w' || ch == 'x' || ch == 'y') return false; } return true; } private final boolean ends(String s) { int l = s.length(); int o = k-l+1; if (o &lt; 0) return false; for (int i = 0; i &lt; l; i++) if (b[o+i] != s.charAt(i)) return false; j = k-l; return true; } /* setto(s) sets (j+1),...k to the characters in the string s, readjusting k. */ private final void setto(String s) { int l = s.length(); int o = j+1; for (int i = 0; i &lt; l; i++) b[o+i] = s.charAt(i); k = j+l; } /* r(s) is used further down. */ private final void r(String s) { if (m() &gt; 0) setto(s); } /* step1() gets rid of plurals and -ed or -ing. e.g. caresses -&gt; caress ponies -&gt; poni ties -&gt; ti caress -&gt; caress cats -&gt; cat feed -&gt; feed agreed -&gt; agree disabled -&gt; disable matting -&gt; mat mating -&gt; mate meeting -&gt; meet milling -&gt; mill messing -&gt; mess meetings -&gt; meet */ private final void step1() { if (b[k] == 's') { if (ends("sses")) k -= 2; else if (ends("ies")) setto("i"); else if (b[k-1] != 's') k--; } if (ends("eed")) { if (m() &gt; 0) k--; } else if ((ends("ed") || ends("ing")) &amp;&amp; vowelinstem()) { k = j; if (ends("at")) setto("ate"); else if (ends("bl")) setto("ble"); else if (ends("iz")) setto("ize"); else if (doublec(k)) { k--; { int ch = b[k]; if (ch == 'l' || ch == 's' || ch == 'z') k++; } } else if (m() == 1 &amp;&amp; cvc(k)) setto("e"); } } /* step2() turns terminal y to i when there is another vowel in the stem. */ private final void step2() { if (ends("y") &amp;&amp; vowelinstem()) b[k] = 'i'; } /* step3() maps double suffices to single ones. so -ization ( = -ize plus -ation) maps to -ize etc. note that the string before the suffix must give m() &gt; 0. */ private final void step3() { if (k == 0) return; /* For Bug 1 */ switch (b[k-1]) { case 'a': if (ends("ational")) { r("ate"); break; } if (ends("tional")) { r("tion"); break; } break; case 'c': if (ends("enci")) { r("ence"); break; } if (ends("anci")) { r("ance"); break; } break; case 'e': if (ends("izer")) { r("ize"); break; } break; case 'l': if (ends("bli")) { r("ble"); break; } if (ends("alli")) { r("al"); break; } if (ends("entli")) { r("ent"); break; } if (ends("eli")) { r("e"); break; } if (ends("ousli")) { r("ous"); break; } break; case 'o': if (ends("ization")) { r("ize"); break; } if (ends("ation")) { r("ate"); break; } if (ends("ator")) { r("ate"); break; } break; case 's': if (ends("alism")) { r("al"); break; } if (ends("iveness")) { r("ive"); break; } if (ends("fulness")) { r("ful"); break; } if (ends("ousness")) { r("ous"); break; } break; case 't': if (ends("aliti")) { r("al"); break; } if (ends("iviti")) { r("ive"); break; } if (ends("biliti")) { r("ble"); break; } break; case 'g': if (ends("logi")) { r("log"); break; } } } /* step4() deals with -ic-, -full, -ness etc. similar strategy to step3. */ private final void step4() { switch (b[k]) { case 'e': if (ends("icate")) { r("ic"); break; } if (ends("ative")) { r(""); break; } if (ends("alize")) { r("al"); break; } break; case 'i': if (ends("iciti")) { r("ic"); break; } break; case 'l': if (ends("ical")) { r("ic"); break; } if (ends("ful")) { r(""); break; } break; case 's': if (ends("ness")) { r(""); break; } break; } } /* step5() takes off -ant, -ence etc., in context &lt;c&gt;vcvc&lt;v&gt;. */ private final void step5() { if (k == 0) return; /* for Bug 1 */ switch (b[k-1]) { case 'a': if (ends("al")) break; return; case 'c': if (ends("ance")) break; if (ends("ence")) break; return; case 'e': if (ends("er")) break; return; case 'i': if (ends("ic")) break; return; case 'l': if (ends("able")) break; if (ends("ible")) break; return; case 'n': if (ends("ant")) break; if (ends("ement")) break; if (ends("ment")) break; /* element etc. not stripped before the m */ if (ends("ent")) break; return; case 'o': if (ends("ion") &amp;&amp; j &gt;= 0 &amp;&amp; (b[j] == 's' || b[j] == 't')) break; /* j &gt;= 0 fixes Bug 2 */ if (ends("ou")) break; return; /* takes care of -ous */ case 's': if (ends("ism")) break; return; case 't': if (ends("ate")) break; if (ends("iti")) break; return; case 'u': if (ends("ous")) break; return; case 'v': if (ends("ive")) break; return; case 'z': if (ends("ize")) break; return; default: return; } if (m() &gt; 1) k = j; } /* step6() removes a final -e if m() &gt; 1. */ private final void step6() { j = k; if (b[k] == 'e') { int a = m(); if (a &gt; 1 || a == 1 &amp;&amp; !cvc(k-1)) k--; } if (b[k] == 'l' &amp;&amp; doublec(k) &amp;&amp; m() &gt; 1) k--; } /** Stem the word placed into the Stemmer buffer through calls to add(). * Returns true if the stemming process resulted in a word different * from the input. You can retrieve the result with * getResultLength()/getResultBuffer() or toString(). */ public void stem() { //System.out.println(i); k = i - 1; if (k &gt; 1) { step1(); step2(); step3(); step4(); step5(); step6(); } for(int c=0;c&lt;=k;c++) { // System.out.print(b[c]); } str=new String(b); //System.out.println(str); sentence+=str+" "; System.out.println(sentence); i_end = k+1; i = 0; } public static void main(String[] args) { stemmer s = new stemmer(); try { BufferedReader br = new BufferedReader(new FileReader("D:/output.txt")); BufferedWriter output = new BufferedWriter(new FileWriter("D:/output1.txt")); String separator = System.getProperty("line.separator"); while ((line = br.readLine()) != null) { StringTokenizer st2 = new StringTokenizer(line, "\n"); while (st2.hasMoreElements()) { String line1 = (String) st2.nextElement(); System.out.println(line1); StringTokenizer st3 = new StringTokenizer(line1, " "); // String sentence= new String(); while (st3.hasMoreTokens()) { element=st3.nextToken(); s.addstring(element); s.stem(); } output.append( separator+sentence); sentence=""; } } output.close(); } //System.out.println(element); // s.addstring(element); // s.stem(); // s.addstring("walks"); // s.stem(); //System.out.println("Output " +s.b); catch(Exception e) { } } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USsaranya
    1. USsaranya
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POhow to convert a char array into string in java
      1. This table or related slice is empty.
      1. VTDownMod
    2. VO
      singulars
      1. POhow to convert a char array into string in java
      1. This table or related slice is empty.
      1. VTDownMod
    3. VO
      singulars
      1. POhow to convert a char array into string in java
      1. This table or related slice is empty.
      1. VTDownMod
    1. COThis question is very confusing. We've no idea what `i` is, or what the various step methods do, or what the expected output is. Please read http://tinyurl.com/so-list
      singulars
      1. POhow to convert a char array into string in java
      1. USJon Skeet
    2. COWith more infos it will be easier to answer
      singulars
      1. POhow to convert a char array into string in java
      1. USJulianG
    3. COPlease write an SSCCE: http://sscce.org/
      singulars
      1. POhow to convert a char array into string in java
      1. USSimon Forsberg
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload