Problem in replacing characters of a string ?

Question

Hello everybody,
I want to replace a few characters with their corresponding unicode codepoint values.
I have a userdefined method that gets the unicode codepoint value for a character.
1. I want to know how to replace the characters and have the replaced string after the comparision is over in the for loop in my main.
Currently , i am able to replace , but i am not able to have the replacements done in a single variable.
The output of the code is
e\u3006ame
ena\u3005e
But i want the output i require is,
e\u3006a\u3005e
Please offer some help in this regard
import java.io.*;
class Read1
     public static void main(String s[])
         String rp,snd;
         String tmp="ename";
         for(int i=0;i<tmp.length();i++)
             snd=getCodepoint(tmp.charAt(i));
             if(snd!=null)
                rp=replace(tmp,String.valueOf(tmp.charAt(i)),"\\u"+snd);
                System.out.println(rp);
public static String replace(String source, String pattern, String replace)
     if (source!=null)
         final int len = pattern.length();
         StringBuffer sb = new StringBuffer();
         int found = -1;
         int start = 0;
         while( (found = source.indexOf(pattern, start) ) != -1)
             sb.append(source.substring(start, found));
             sb.append(replace);
             start = found + len;
         sb.append(source.substring(start));
         return sb.toString();
     else return "";
...,Any help in this regard would be useful
Thanks
khurram

Answer 1

This manual replacement thingy reminds me of quite an old technique, when
64KB of memory was considered enough for 20 users (at the same time that is!)
Suppose you have a buffer of, say, n characters. Starting at location i, a region
of chars have to be swapped with bytes starting at location j >= i+l_i; the lengths
of the two regions are l_i and l_j respectively.
Suppose the following method is available:public void reverse(char[] buffer, int f, int l_f) {
   for (int t= f+l_f; --t > f; f++) {
      char tmp=buffer[f]; buffer[f]= buffer[t]; buffer[t]= tmp;
}i.e. the above method reverses a region of characters, starting at position f
with length l_f. Given this simple method, the original problem can be solved
using the following simple sequence:reverse(buffer, i, j+l_j);
reverse(buffer, i, l_j);
reverse(buffer, i+l_j, j-i-l_i);
reverse(buffer, j+l_j-l_i, l_i);Of course, when replacing characters we don't need the last reversal.
kind regards,
Jos (dinosaurus)