Sort tokens in a string

Hello,
I have a table
SQL> SELECT name FROM employee
NAME
KUMAR AJAY
MANOJ KUMAR AGRAWAL
KUSH KRANTI AMOL
SHETTY PRIYA RAVIPlease let me know how can I get the individual names rearranged in an alphabetical order like:
SQL> SELECT sorted_name FROM employee
SORTED_NAME
AJAY KUMAR
AGRAWAL KUMAR MANOJ
AMOL KRANTI KUSH
PRIYA RAVI SHETTYEdited by: 944558 on 16 Jan, 2013 3:35 AM

May be
with employee
as
select 'KUMAR AJAY' name from dual
union all
select 'MANOJ KUMAR AGRAWAL' name from dual
union all
select 'KUSH KRANTI AMOL ' name from dual
union all
select 'SHETTY PRIYA RAVI' name from dual
select ltrim(sys_connect_by_path(name_token, ' '), ' ') new_name
  from (
          select rno, row_number() over(partition by rno order by name_token) token_no, name_token
            from (
                    select rno, regexp_substr(name, '[^ ]+', 1, no) name_token
                      from (
                              select rownum rno, name
                                from employee
                     cross      
                      join (
                              select level no
                                from dual
                             connect
                                  by level <= (
                                                select max(length(name) - length(replace(name, ' ')) + 1)
                                                  from employee
                     where regexp_substr(name, '[^ ]+', 1, no) is not null 
where connect_by_isleaf = 1      
start
with token_no = 1
connect
   by rno = prior rno
  and token_no = prior token_no + 1;
NAME                NEW_NAME          
KUMAR AJAY          AJAY KUMAR          
MANOJ KUMAR AGRAWAL AGRAWAL KUMAR MANOJ 
KUSH KRANTI AMOL    AMOL KRANTI KUSH    
SHETTY PRIYA RAVI   PRIYA RAVI SHETTY   

Similar Messages

  • I need to sort an array of strings based on the number in each string.

    Basically, I have a directory of files that all have the same name but each with a different number on the end.
    example: image 1.jpg, image 2.jpg, etc.
    When I use the List Directory function that returns an array of strings containing the file names in the directory, they don't come out in a 1, 2, 3, order like they appear in the directory. It sorts them character by character so that they come out like: 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 2, 20, 21, 22 etc.
    Is there a simple way of sorting this array of strings with the file names (as above) so that they are in numerical order?

    It's a while since this thread was started, but I am sure others will have use for this so here goes:
    The in-built array sort function sorts the strings the same way DOS and Windows do. Microsoft has fixed this in the Explorer that comes with XP, however the rest of the OS(s) still sorts the old way.
    The attached "AlphaLogical String Array Sort" VIs will sort strings arrays the same way as the new XP Explorer. There are three different implementations of the sorting, one based on the Insertion sort algorithm, a Quick Sort based on recursive calls (the most elegant way, but unfortunately LabVIEW has too much overhead when doing recursive calls so this is actually a very slow alternative) and finally the fastest; a stack based Quick Sort. There is also a test VI that will show you how the different implementations perform.
    I had not used recursive calls in LV much until I made the attached quick sort and was a bit disappointed by the fact that it is so slow, but it's a good learning example...The ability to do recursive calls this way was introduced in LV7 I believe...There is an example here on the zone that shows how you can calulate a factorial by using recursive calls, however - unlike for the quick sort (normally) - recursive calls are actually not the optimal solution for that calculation.
    Message Edited by Mads on 09-13-2005 02:30 AM
    MTO
    Attachments:
    AlphaLogical Sorting.zip ‏142 KB

  • How to sort a list of strings, without methods and stuff just simple code?

    Hi
    How to sort a list of strings, without methods and stuff just simple code?
    Thanks in adavance!!

    Without methods? How are you going to all the sort code? What is the point of code?
    Collections.sort(List) will sort strings or anything that implements the Comparable interface, or you can use the sort method that takes a Comparator implemenation.
    If you want "just code", you could either get the Collections class souce and follow it to the code. But otherwise, there isn't one set of code. There are various sorting algorithms with advantages and disadvantages. Maybe you'd be better off searching for sorting algorithms and if you understand them, it should be simple to write Java implementations of them.

  • How to count no. of tokens in a string?

    hello everybody?
    I am using StringToknizer to read a csv file line by line.
    My problem is:
    i want to know how many tokens are there in a particular row. How to count it at a streatch?
    i am using
    <%
    if (st.hasMoreTokens())
         a3=st.nextToken().trim();
    %>i thought of using String.split(), but, i don't know how to use it?(what class to import)
    Anyguidence will be appreciated
    Thanks for your time.
    Regards,
    Ashvini

    StringTokenizer will do it for you!
    int numberOfTokens = st.countTokens();m

  • Need help sorting an ArrayList of strings by an in common substring

    I'm trying to sort a .csv file, which I read into an ArrayList as strings. I would like to sort by the IP address within the string. Can someone please help me figure out the best way to sort these strings by a common substring each has, which is an IP address.
    I'm pretty sure that I need to use Collections some how, but I don't know where to begin with them besides trying to look online for help. I had no luck finding any good examples, so I came here as a last resort.
    Thanks for any help provided.

    You need to write your own Comparator class. In the compare() method you substring out the two IP addresses, compare them and return appropriate value. Then you call Collections.sort() and pass your list and comparator.

  • Command line to sort semi-colon delimited string

    I'm sure there's a simple solution eluding me... I have an app which stores sets as a string like:
    "bee;ant;cow;ant;Aardvark;dog"
    which I want to sort to a string like:
    "Ardvark;ant;bee;cow;dog"
    ...where letter sort** is case insensitive and number strings sort on numberical value (i.e. 1,2,10 not 1,10,2). FWIW, the string length is likely to be short and not large numbers of delimited terms - in case that matters.
    ** I can duck issue of sorting & accented characters if that's a significant complication at this point.
    The app in question can't do the sort but can call a Unix command line and read its stdout. I want a single command line not an external script for portability/support reasons, though it doesn't matter if the CL is long. So, please don't suggest I use a script even if it's your own preferred method!
    I thought of using 'sort' but that's for lines in a file vs a single input line. I guess I use awk, or can a pass perl as a CL (as opposed to calling a script)? Either way, my poring over the references I have hasn't showed me a solution and I don't know perl. Here's hoping someone can point me in the right direction.
    TIA
    Mark

    Here's one way to accomplish what you're asking:set stuff2Sort to "bee;ant;cow;ant;Aardvark;dog;1;10;2"
    set sortedStuff to sortStuff(stuff2Sort)
    on sortStuff(x)
    set tmpSort to paragraphs of (do shell script "echo " & quoted form of x & " | awk 'gsub(\"",\"\\n\") {print}' | sort -g")
    set oldDelims to text item delimiters
    set text item delimiters to ";"
    set theSorted to tmpSort as string
    set text item delimiters to oldDelims
    return theSorted
    end sortStuffI don't know if the ";" and "\" are appearing correctly or not. When I preview this post it shows up as a smiley face even though I have it in a code block!
    Hope this helps...
    Message was edited by: Chachi
    Sorry, thought I was in the Applescript forum! DOH!!!

  • Store and sort large amounts of Strings

    Hi, everyone.
    I would be very grateful if someone could help me with the two questions I have.
    I am working on the program, which has to turn a billion of integers in words, sort them and find a certain character.
    My first question is how can I process my convertion of integer other than in loop? ( loop takes about an hour). The algorithm works well for smaller iterations.
    Where can I store such large amounts of strings to be able to sort them then and work with them?
    Thank you in advance.

    I will try to explain it better.
    I have written a function, which converts integers in
    words. I call it in a for loop for all the integers
    from 1 to 999999999. It works well for smaller
    integers, but takes too long to complete all the
    cycles for 999999999. This seems nonsensical. But yes it will take a long time.
    Do you in fact mean that you are converting integers INTO words? Maybe?
    I try to store each converted integer in an array of
    Strings, but obviously it is a lot of Strings. Yes it would seem that is in fact what you do mean...
    would like to find out what kind of array I can use
    to store all those Strings. I have to sort them then,
    concatenate all of them and get a certain character.You can store them into a file instead.
    Why do you want to sort AND concatenate them? This also makes no sense and will be difficult.
    Is it better?
    Thank you.Not really.
    At any rate in order to solve this problem I think you are going to
    a) have to live with buffering to disk
    b) use multiple threads
    c) get a more realistic requirement then concatenating 900 million Strings together because that won't be happening

  • Sorting an array of Strings

    Okay, my first concern is that I'm pretty new to Java. It's my first language that I've ever looked at, and I'm just getting into it.
    I'm trying to read from a .txt file a name and an integer value associated with that name, like for instance, Jimmy Bob Jones 123. I have several lines of different names with different integers associated with each, sorted alphabetically in the .txt file to begin with. That's not the issue really--though I haven't figured out how to do that, I figure it's pretty simple compared to what I have to do with those. I set each line as a new element in an array of Strings, and then I want to sort them based on the value of the integer that follows each. I know that each integer is 5 digits, so I'm thinking about some way to sort based on Integer.parseInt(name.substring(name.length - 5, name.length)) for each element, but it's not coming to me.
    I mean, let's say I have the following in a .txt file:
    Abigail 32534
    Bo 28935
    Chris 45000
    Damian 13777
    And I feed those into my .class and set each line to an array element, so it would be like arrayName[0] = "Abigail 32534" etc. for each. Convoluted question, sorry. How would I sort those strings based solely on the integer values, yet also retain the name that goes along with it?
    Any help is appreciated, though I don't guarantee I'll understand : )

    One easy (such a relative term) way is to create an Object, such as NameAndNumber, which has two member variables (name and number). When you read in your file, create objects of this type.
    As for the sorting, this is a two step process:
    1) Create a Comparator class to compare your objects
    2) Populate a TreeSet which uses this comparator.
    The TreeSet will be sorted automatically (based on your Comparator) and you can then iterate through it to retrieve instances of your object.
    This all sounds much more complicated than it is. I have written some code to get you started.
    // Your class
    public class NameAndNumber {
      private int m_nNumber;
      private String m_sName;
      // sets the name
      public void setName(String sName) {
        m_sName = sName;
      // gets the name
      public String getName() {
        return m_sName;
      // sets the number
      public void setNumber(int nNumber) {
        m_nNumber = nNumber;
      // gets the number
      public int getNumber() {
        return m_nNumber;
    // Your comparator
    public class MyComparator implements Comparator {
      // required by interface
      public int compare(Object obj1, Object obj2) {
        // throws ClassCastException if there is a problem - you will need to add
        // handling if this is an issue
        NameAndNumber objNan1 = (NameAndNumber) obj1;
        NameAndNumber objNan2 = (NameAndNumber) obj2;
        // will return the proper comparison based on the number
        return (objNan1.getNumber() - objNan2.getNumber());
    // Inside your "main" class
    TreeSet setNumbers = new TreeSet(new MyComparator());
    NameAndNumber objNameAndNumber = getNextListing(); // you need to provide this method, which gets the items one at a time
    setNumbers.add(objNameAndNumber);Hope this helps.

  • Regarding Month sorting in List Map String, Object

    Dear All,
    i have a list which is- List<Map<String, Object>> results . What i need is i want to sort the 'results ' .The values in results, when i tried to print it are
    RESULTS :{Apr 2009}
    RESULTS :{August 2008}
    RESULTS :{December 2008}
    RESULTS :{Feb 2009}
    RESULTS :{Jan 2009}
    RESULTS :{Jun 2009}
    RESULTS :{Mar 2009}
    RESULTS :{May 2009}
    RESULTS :{Nov 2008}
    RESULTS :{October 2008}
    RESULTS :{Sep 2008}
    i want to sort the values according to the month. like jan 2008,feb 2008 etc .
    Somebody please help .
    Thanks in advanced .

    sha_2008 wrote:
    The output sholud be june 2008,Dec 2008, Mar 2009. ie according to the increase order of monthsThat doesn't make it any clearer, in the example "June 2008" and "Mar 2009" are in the same map. Do you want that map to appear both before and after "Dec 2008" which doesn't make sense or are you expecting to restructure the data. If so, I would suggest you use a SortedMap like;
    List<Map<String,Object>> maps = ...
    SortedMap<String, Object> results = new TreeMap<String, Object>(dateComparator);
    for(Map<String, Object> map: maps)
       results.putAll(map);BTW: is there any good reason your dates are Strings instead of Date objects which are much easier to sort?

  • How to sort multiple combinations alphanumeric Strings

    Hi All,
    I have problem that
    i need to sort 1A1a,1Aa,1Aa1,1B1a........................
    as 1Aa,1A1a,1Aa1,1B1a.......................
    can anybody help me....
    Thanks
    Anil.

    I have problem that i need to sort
    1A1a,1Aa,1Aa1,1B1a........................
    as 1Aa,1A1a,1Aa1,1B1a.......................Build a Comparator that implements the ordering rule you want.
    (I can't figure out the order from the example you showed).
    kind regards,
    Jos

  • Sorting a String

    Hi,
    I was wondering how would I sort the following String using String class methods and StringTokenizer.
    For example.
    Input: String a = 12hello^25hello^10hello;
    Sort it chronologically
    Output String a = 10hello^12hello^25hello;
    Thanks in advance.

    In Java 5.0, something like the following?
    import java.util.Arrays;
    import java.util.Comparator;
    import java.util.regex.Pattern;
    import java.util.regex.Matcher;
    public class Test {
        public static void main(String[] args) {
            String a = "12hello^25hello^10hello^100hello";
            String[] tokens = a.split("\\^");
            Arrays.sort(tokens, new Comparator<String>() {
                String regexp = "(\\d+)";
                Pattern p = Pattern.compile(regexp);
                public int compare(String s1, String s2) {
                    Matcher m1 = p.matcher(s1);
                    Matcher m2 = p.matcher(s2);
                    if (!m1.find() || !m2.find()) {
                        return s1.compareTo(s2);
                    int i1 = Integer.parseInt(m1.group(1));
                    int i2 = Integer.parseInt(m2.group(1));
                    if (i1 < i2) {
                        return -1;
                    } else if (i1 > i2) {
                        return 1;
                    } else {
                        return s1.compareTo(s2);
            StringBuilder sb = new StringBuilder();
            for (String b : tokens) {
                sb.append("^").append(b);
            String result = sb.toString().substring(1);
            System.out.println(result);
    }Beware, I haven't checked this for bugs. You'd probably want to check the logic of the comparator ;-)
    Cheers, Neil

  • Sorting string like windows file name sorting

    Hi everybody, I have a simple question.
    I was trying to sort some file name in java
    Let say we have a list of string which are :
    1.txt
    a.txt
    2.txt
    11.txt
    a(1).txt
    a(11).txt
    a(2).txt
    If i convert those strings as file names, and sort it by file name in the windows explorer the result is
    1.txt
    2.txt
    11.txt
    a(1).txt
    a(2).txt
    a(11).txt
    a.txt
    But if i enter those strings into an Arraylist and use Arrays.sort or Collections.sort, the result is
    1.txt
    11.txt
    2.txt
    a(1).txt
    a(11).txt
    a(2).txt
    a.txt
    Is there a way to achieve the string sort similar to windows rather than aplhabetically like the default sort of Arrays/Collection.
    I have done some searching but only found problem regarding to different language character sorting which can be achieved using Collator but this was not my case. Has anybody encounter this issue ?
    Any help is greatly appreciated
    regards
    Hendra Effendi

    ballistic_realm wrote:
    Let say we have a list of string which are :
    1.txt
    a.txt
    2.txt
    11.txt
    a(1).txt
    a(11).txt
    a(2).txt
    If i convert those strings as file names, and sort it by file name in the windows explorer the result is
    1.txt
    2.txt
    11.txt
    a(1).txt
    a(2).txt
    a(11).txt
    a.txt
    ...Not sure, but wouldn't Windows sort it like:
    1.txt
    2.txt
    11.txt
    a.txt
    a(1).txt
    a(2).txt
    a(11).txt
    If so, the try something like this (UNTESTED!):
    class WindowsFileNamesComparator implements Comparator<String> {
        public int compare(String a, String b) {
            String[] tokensA = tokenize(withoutExtension(a));
            String[] tokensB = tokenize(withoutExtension(b));
            int max = Math.min(tokensA.length, tokensB.length);
            for(int i = 0; i < max; i++) {
                if(tokensA.equalsIgnoreCase(tokensB[i]))
    continue;
    else if(tokensA[i].matches("\\d+") && tokensB[i].matches("\\D+"))
    return -1;
    else if(tokensA[i].matches("\\D+") && tokensB[i].matches("\\d+"))
    return 1;
    else if(tokensA[i].matches("\\d+") && tokensB[i].matches("\\d+"))
    return Integer.valueOf(tokensA[i])-Integer.valueOf(tokensB[i]);
    else
    return tokensA[i].compareTo(tokensB[i]);
    return tokensA.length - tokensB.length;
    private String[] tokenize(String s) {
    List<String> tokens = new ArrayList<String>();
    Matcher m = Pattern.compile("\\d+|\\D+").matcher(s);
    while(m.find()) {
    tokens.add(m.group());
    return tokens.toArray(new String[]{});
    private String withoutExtension(String s) {
    int lastDot = s.lastIndexOf('.');
    return lastDot < 0 ? s : s.substring(0, lastDot);

  • Newbie trying to sort 2D string array

    Dear all,
    After read some book chapters, web sites including this, I still don't get the point.
    If I have a file like,
    1 aaa 213 0.9
    3 cbb 514 0.1
    2 abc 219 1.3
    9 bbc 417 10.4
    8 dee 887 2.1
    9 bba 111 7.1
    and I load into memory as a String[][]
    here comes the problem, I sort by column 1 (aaa,...,bba) using an adaptation of the Quicksort algorithm for 2D arrays
    * Sort for a 2D String array
    * @param a an String 2D array
    * @param column column to be sort
    public static void sort(String[][] a, int column) throws Exception {
    QuickSort(a, 0, a.length - 1, column);
    /** Sort elements using QuickSort algorithm
    static void QuickSort(String[][] a, int lo0, int hi0, int column) throws Exception {
    int lo = lo0;
    int hi = hi0;
    int mid;
    String mitad;
    if ( hi0 > lo0) {
    /* Arbitrarily establishing partition element as the midpoint of
    * the array.
    mid = ( lo0 + hi0 ) / 2 ;
    mitad = a[mid][column];
    // loop through the array until indices cross
    while( lo <= hi ) {
    /* find the first element that is greater than or equal to
    * the partition element starting from the left Index.
    while( ( lo < hi0 ) && ( a[lo][column].compareTo(mitad)<0))
    ++lo;
    /* find an element that is smaller than or equal to
    * the partition element starting from the right Index.
    while( ( hi > lo0 ) && ( a[hi][column].compareTo(mitad)>0))
    --hi;
    // if the indexes have not crossed, swap
    if( lo <= hi )
    swap(a, lo, hi);
    ++lo;
    --hi;
    /* If the right index has not reached the left side of array
    * must now sort the left partition.
    if( lo0 < hi )
    QuickSort( a, lo0, hi, column );
    /* If the left index has not reached the right side of array
    * must now sort the right partition.
    if( lo < hi0 )
    QuickSort( a, lo, hi0, column );
    * swap 2D String column
    private static void swap(String[][] array, int k1, int k2){
    String[] temp = array[k1];
    array[k1] = array[k2];
    array[k2] = temp;
    ----- end of the code --------
    if I call this from the main module like this
    import MyUtil.*;
    public class kaka
    public static void main(String[] args) throws Exception
    String[][]a = MyUtil.fileToArray("array.txt");
    MyMatrix.printf(a);
    System.out.println("");
    MyMatrix.sort(a,1);
    MyMatrix.printf(a);
    System.out.println("");
    MyMatrix.sort(a,3);
    MyMatrix.printf(a);
    for the first sorting I get
    1 aaa 213 0.9
    2 abc 219 1.3
    9 bba 111 7.1
    9 bbc 417 10.4
    3 cbb 514 0.1
    8 dee 887 2.1
    (lexicographic)
    but for the second one (column 3) I get
    3 cbb 514 0.1
    1 aaa 213 0.9
    2 abc 219 1.3
    9 bbc 417 10.4
    8 dee 887 2.1
    9 bba 111 7.1
    this is not the order I want to apply to this sorting, I would like to create my own one. but or I can't or I don't know how to use a comparator on this case.
    I don't know if I am rediscovering the wheel with my (Sort String[][], but I think that has be an easy way to sort arrays of arrays better than this one.
    I've been trying to understand the Question of the week 106 (http://developer.java.sun.com/developer/qow/archive/106/) that sounds similar, and perfect for my case. But I don't know how to pass my arrays values to the class Fred().
    Any help will be deeply appreciated
    Thanks for your help and your attention
    Pedro

    public class StringArrayComparator implements Comparator {
      int sortColumn = 0;
      public int setSortColumn(c) { sortColumn = c; }
      public int compareTo(Object o1, Object o2) {
        if (o1 == null && o2 == null)
          return 0;
        if (o1 == null)
          return -1;
        if (o2 == null)
          return 1;
        String[] s1 = (String[])o1;
        String[] s2 = (String[])o2;
        // I assume the elements at position sortColumn is
        // not null nor out of bounds.
        return s1[sortColumn].compareTo(s2[sortColumn]);
    // Then you can use this to sort the 2D array:
    Comparator comparator = new StringArrayComparator();
    comparator.setSortColumn(0); // sort by first column
    String[][] array = ...
    Arrays.sort(array, comparator);I haven't tested the code, so there might be some compiler errors, or an error in the logic.

  • Problem in sorting numeric string

    hii
    i have created one method using comparator and passed a list with list of strings as argument to sort method of Collections class.The string ,which is combined a string and numeric value for example A1,A2,A11,A3 .....So i wanted the result as A1,A2,A3..A11,A12... and so on as final output.but when i print the output ,they are sorted as A1,A11,A12....A2,A3....so i learned from javadoc why those are sorted as like since comparator is using charAt() method while making override compare() method.but i am not expected this sorting for my application. i need sorting output as A1,A2,A3...A11,A12.....How to compare a string with another string both have combination of string and number using java?
    if any one know the logic reply me.
    i have pasted my code,if any changes have to be made only in this code,correct the code.
    package sample.sorting;
    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.Comparator;
    import java.util.List;
    public class SortString {
         public static List<String> sort(List<String> data) {
              Collections.sort(data,new Comparator<String>(){
                   public int compare(String s1,String s2) {
                        return s1.compareTo(s2)     ;
              return data;
         public static void main(String[] args) {
              List<String> sortList     = new ArrayList<String>();
              sortList.add("A1");
              sortList.add("A3");
              sortList.add("A2");
              sortList.add("A9");
              sortList.add("A11");
              sortList.add("A6");
              List<String> sort = sort(sortList);
              for(String str : sort) {
                   System.out.println("STR :: "+str); // O/P : A1,A11,A2,A3,A6... but expected O/P : A1,A2,A3..A11.
    }thanks in advance.
    with regards
    Oasisderts
    Edited by: oasisdesert on Dec 29, 2009 4:15 AM

    In the compare method of the comparator, check if two Strings have equal length, if so compare them as normal, otherwise treat them as a separate case.
    e.g. uncompiled return s1.length == s2.length ? s1.compareTo(s2) : if(s1.length < s2.length) -1 else 1;Mel

  • Scan String Token Problem with leading Tokens

    Hi, I'm using the scan string for token to read in a string of tokens that contain a leading "*" char in front of each string and terminates when the token index = -2. This works great if I have say *12345*1234 and so forth, but if there is bad data, say 1234 without the leading "*" in front, the token index return value is still -1 and it returns data which I read in thinking it found the "*". Maybe I shouldn't use the string for token function since it's probably just designed for ending tokens and not data with leading tokens. Is there a way to make this work properly or should I use another method to search for leading tokens in a string?
    Thanks.
    Solved!
    Go to Solution.

    Here.  Try this one.  It does the same thing and uses exposed functions.
    The string functions look for something to mark the end of a string.  All languages that I know of do this.  So, like I said, remove the first element.  I recommend the Subarray function with the index set to 1 and length unwired.
    There are only two ways to tell somebody thanks: Kudos and Marked Solutions
    Unofficial Forum Rules and Guidelines
    Attachments:
    Parse Message.png ‏10 KB

Maybe you are looking for

  • Table to see stock on particular date

    Hello SAP Gurus,    I know that through mb5b report you can see the stock on posting date.But guys can u  tell me that from which table and field it takes the data?

  • Functional specs for output of ship and debit contract

    Hi All, Does anyone have a doc on the functional specs for output of ship and debit contract? If so pls email me at [email protected] With Thanks & Warm Regards SK

  • ALV - refresh data after value is selected from input help

    Hello, I have input ALV where after I enter material number and press enter, the logic goes ahead and populates description column by utilizing ON_DATA_CHECK event. Is is possible to trigger some kind of event after the value is selected from search

  • Error: Export data missing

    while Invoice-Release to accounting I got error as "Export data missing" when I check I found that Foreign trade data is incomplete as per system. Also I have seen foreign trade no also in invoice foreign trade/customes view. I dont know why this err

  • Inserting HTML to Captivate elements

    I have a project, an e-Learning piece that is created with HTML and Flash. Flash is used to create some of the learning confirmation modules (or mini-quizzes) that are scattered through the e-Learning piece. I heed to update these mini-quizzes, but T