Tree problems

Hi,
I want to make a tree and I wrote:
{tag}
select 1, level, lpad(' ',level)||first_name fname, last_name, salary
from employees
start with manager_id is null
connect by prior employee_id = manager_id
{tag}
as select query
and in trigger "when-new-item-instance"
{tag}
DECLARE
htree ITEM;
node ftree.node;
state varchar2(30);
BEGIN
-- Find the tree itself.
htree := Find_Item('block3.tree4');
-- Sets the record group and causes the data to display.
Ftree.Set_Tree_Property(htree, Ftree.RECORD_GROUP, 'record_group6');
END;
{tag}
When I try to run that form I get no result.
Thank you

Hi!
Do you use the select statement or a record group for tree population?
You can not use both at the same time.
It seems you use record group, but is the group beeing populated before it set to the tree?
Regards

Similar Messages

  • Two iterators browsing the same data (a table and a tree) problem

    I have an ADF UIX application with a navigation tree and a central page with a table of the records of a Works view object.
    There is a hierarchical relationship of Works ->Subworks-> Tasks which is shown in the tree. In the central part of the page, there is a table of Works.
    I want
    1) the tree to show all the data, but only about 10 works at a time (using small arrows for scrolling up and down)
    2) the table to show only 10 or 20 records each time. Not the same with the tree.
    3) Both clicking on a link on the tree and selecting a work on the table will open the appropriate page.
    4) Opening the children of a node in the tree and clicking on the links being able to send me directly in the correct subwork or task page EVEN if I haven't visited the parent node (work) first.
    I cannot seem to be able to succed in the "even if" part of 4 and I can succeed in only any 2 of the first three.
    If the tree iterator and table iterator point to the same view object (work1 for example), it is impossible to show a different set of works in the tree and the table
    If I use different view objects, then, if the tree part is working, the table selection doesn't work. I imagined that's a problem with "SetCurrentRowWithIndex" and I tried to set up correctly a "SetCurrentRowWithKey" event, but I didn't know how to write the handler. (I use JHS event handling, by the way)
    I suppose the following has errors:
    <event name="setCurrentRowWithKey" source="GetaeergView1">
    <set target="${bindings.GetaeergView1Iterator}" property="currentRowKeyInRange" value="${ui:tableSelectedKey(uix, 'GetaeergView1')}"/>
    </event>
    Any suggestions?

    Noone has tried this again?

  • ALV Tree Problem with Checkboxes

    Hello,
    i've got a problem.
    I have an ALV-Tree and die ALV-Detaillist of the tree are type checkbox.
    That's working correct.
    But i want to fill initial data in the checkboxes but the checkbox isnt set.
    i've done as followed:
      CALL METHOD go_alv_tree->set_table_for_first_display
        EXPORTING
         I_STRUCTURE_NAME     =
         IS_VARIANT           =
         I_SAVE               =
          i_default            = abap_false
          is_hierarchy_header  = ls_header
         IS_EXCEPTION_FIELD   =
         IT_SPECIAL_GROUPS    =
         IT_LIST_COMMENTARY   =
         I_LOGO               =
         I_BACKGROUND_ID      =
         IT_TOOLBAR_EXCLUDING =
        CHANGING
          it_outtab            = <go_data_tab>
         IT_FILTER            =
          it_fieldcatalog      = lt_fcat.
    fieldcat are several fields all as checkbox.
    Then i get a component of the output structure and set a X.
    ASSIGN COMPONENT lv_help_arbpl OF STRUCTURE <go_data_struc>
                           TO <fs_arbl>.
          IF <fs_arbl> IS ASSIGNED.
            <fs_arbl> = lc_xfeld.
          ENDIF.
            CALL METHOD go_alv_tree->add_node
              EXPORTING
                i_relat_node_key     = lv_matnr
                i_relationship       = cl_gui_column_tree=>relat_last_child
                is_outtab_line       = <go_data_struc>
                is_node_layout       = ls_layout
             IT_ITEM_LAYOUT       =
                i_node_text          = lv_node_text
              IMPORTING
                e_new_node_key       = lv_period
              EXCEPTIONS
                relat_node_not_found = 1
                node_not_found       = 2
                OTHERS               = 3.
    in <go_data_struc> the fields which should be set, are set with X.
    But after i add all of my nodes and do CALL METHOD p_go_alv_tree->frontend_update, the checkbox is empty but there is an X in the field beside the checkbox.
    Thanks in advance.
    best regards,
    Dennis

    Ok i solved the problem.
    best regards,
    Dennis

  • J(Check)Tree Problems

    Hi,
    I'm using the JCheckTree from: http://www.fawcette.com/archives/premier/mgznarch/javapro/2001/01jan01/vc0101/vc0101.asp And have some problems with it, hopefull somebody can help me... (source on website)
    1:
    In a normal JTree when you dubbleclick on a folder it opens, when I dubbleclick on the JCheckTree nothing happens. I tried using: .setToggleClickCount(2) but that doesn't help. How can I solve this?
    2:
    In "BasicTreeCellRenderer.java" I use: setIcon(expanded ? UIManager.getIcon("FileView.fileIcon") : UIManager.getIcon("FileView.fileIcon"); to set the Icon for an item, it works. But when I click and select the item the icon is gone and the default Icon is there. When I deselect the Item the right icon is showed agian. How can I fix this?
    3:
    When I click on a folder al childs are automaticly selected, that's nice. I need that, but it will also be handy when I select all the child items manual the folder will be selected to. Or when I select a few child items the folder checked will be gray. (so the userS can see that items are selected when the folder is closed). How can I build this?
    4:
    With the option node.isSelected() I can check of the item is selected. How would it be possible to write a function that checks all the items if they are checked and but then in an array?
    Hopefully somebody can help me, or push me in the right direction.
    Thanks for your time and help!
    Greetings,
    Rene

    4:
    With the option I can check of the item is selected.
    How would it be possible to write a function
    that checks all the items if they are checked
    and but then in an array?I already found this one!    
        Enumeration enum = Tree.breadthFirstEnumeration();
        while (enum.hasMoreElements()) {
          CheckTreeNode node = (CheckTreeNode)enum.nextElement();
          if (node.isSelected()) {
             if (node.isLeaf()) {
                  // CODE
       }

  • Binary Tree Problem, help !!!!!!!

    Hi I have some Tree Traversal problem,
    my output has this problem,what's going on????
    Exception in thread "main" java.lang.NullPointerException
    at Tree.inTraversal2(Tree.java:150)
    at TreeTest.main(TreeTest.java:33)
    My Tree.java:
    class TreeNode {
       TreeNode leftNode;          
       TreeNode rightNode;
       int data;
       public TreeNode(int nodeData)
          data = nodeData;             
          leftNode = rightNode = null;
       public void insert(int value)
          if( value < data )
             if( leftNode == null )
                leftNode = new TreeNode(value);
             else
                leftNode.insert(value);
          else if ( value > data )
             if( rightNode == null )
                rightNode = new TreeNode(value);
             else
                rightNode.insert(value);
       }  //end method insert
    }  //end class TreeNode
    public class Tree {
       TreeNode root;
       Stack s;
       public Tree()
          root = null;
       public void insertNode(int value)
          if( root == null )
             root = new TreeNode(value);
          else
             root.insert(value);
       public void inTraversal2(TreeNode node)
             if( node == null )
             return;
         TreeNode p;
         p = node;
         do
                while(p != null)
                     s.push(p); //problem comes in here
                     p = p.leftNode;
                 if(!s.empty())
                     p = s.pop();
                     System.out.print( p.data + " " );
                     p = p.rightNode;
                   }while( (p != null) || (!s.empty()));
    }  //end class TreeMy Stack.java:
    public class Stack {
          TreeNode items[];
         int StackSize;
         int top;
        public Stack(int size)
             StackSize = size;
            items = new TreeNode[size];
            top = -1;
        public boolean empty()
             if(top == -1)
               return true;
            else
              return false;
        public boolean full()
             if(top == StackSize-1)
               return true;
             else
               return false;
        public void push(TreeNode c)
            if(full() == true)
               System.out.println("stack overflow");
            else
                items[++top] = c;
        public TreeNode pop()
             if(empty())
               System.out.println("stack underflow");
            return items[top--];
    }

    You don't seem to instantiate Stack anywhere.

  • Rapid Spanning Tree Problem

    Hi all,
    I am experiencing an RSTP problem. I have two swtitches connected via wireless link, the port is in trunk mode, the native vlan is vlan 1 the problem is that bpdu's are exchanged for other vlan's but not for vlan 1, when i connect a second backup wireless link it causes the loop, it seems that there are no bpdu exchanges between switches for vlan 1, also in trunk ports i see that BPDU's for vlan 1 are sent by both switches but they do not receive any BPDU's from each other. Any explanation about thiss issue ?
    Thanks in advance

    I would need to know some things to troubleshoot this:
    1. Is VLAN 1 the native VLAN of the trunk, on both sides?
    2. I presume VLAN 1 is in the allowed VLANs list on both sides of the link?
    3. If the native VLAN is not 1, is the native VLAN allowed on the trunk, on both sides?
    4. What model of switch is it, and what version of the software?
    5. Can you do a show run int for each end of each trunk link?
    6. Can you do a show int xxx trunk for each end of each trunk link?
    7. Can you do a show spanning-tree vlan 1 on each side of each trunk?
    Kevin Dorrell
    Luxembourg

  • Navigation Tree Problem

    Hi,
    I am having trouble creating the tree menu with xMII 11.5.1's navigation function.  Even though it is not a problem to create the menu structure there seems to be am problem showing it in the browser.  While the 'parent' links are shown properly (with a plus to click on) the 'children' will not appear on click.  Any idea what the problem might be?
    BR
    Paul

    Sounds like you're using firefox..?  Do you see a JavaScript error at the bottom of the page?
    Anyway if you update to a newer version of v11.5, latest is 11.5.4, this problem should go away.
    Sam

  • Huge tree problem

    Hello,
    I want to store huge amount of combinations in memory. For each combination I want to store an integer value.
    A combination looks like: 2,4,3,8. For this combination I build a tree composed of nodes: 2, 4, 3, 8. Then for node 8, I set the int value to be 1. if the same combination is encountered again, the in value will be incremented to 2.
    I can also get the combination: 2,4,3. Then the int value of node "3" will be incremented to 1. The combinations are randomally generated, but they have limited length. For example, I know in advance that I can get combinations:
    3 * 4 * 2 * 20 * 12. Then, I know that the first number in the sequaence will be between 1-3, the second between 1-4 and so on ... Valid combinations are can be either all the sequence or a part of it. For example:
    - 1
    - 1,3
    - 1,3,2,19,10
    all are valid combinations that can be excepted.
    As was mentioned before, for each received combination an integer value of the last node in the sequence is incremented.
    My problem is that I need to store this entire tree in memory, and I expect it to be very big.
    I there some algorithm for dealing with huge trees allowing it to be compressed or arranged in a manner that will reduce size and efficiency of the tree ??

    I wrote you an encoder and a decoder, that will convert an array of answers to questions to an integer and back. This will let you eliminate the overhead of a tree encodeing. (I rather arbitrarily wired the shape to be {2,3,5} so Q1 has two possible answers, namely 0 and 1, Q2 has 3 answers, 0,1,2 etc.)
    They can be used to help in several of the schemes that have already been mentioned.
    I would mention one other, just a varient on the last one, use byte[] rather than short. Then you are only burning a single byte for each unused combination. When a byte hits 255, you add a pair (encodeValue, fullCount) into a list. Which you can grovel over however you choose.
      public static class ED{
        int[] shape = {2,3,5};
        void decode(int[] a, int n){
          int base = 1;
          for(int i=0; i<shape.length; i++){
            if(n < 0) {
              a[i] = -1;
            } else {
              a[i] = n%shape;
    n = n/shape[i] -1;
    int encode(int[] a){
    int result = 0;
    for(int i = shape.length-1; i>-1; i--){
    if(a[i] >= 0){
    result += a[i];
    if(i>0)result = (result+1)*shape[i-1];
    return result;
    void printArray(int[] a){
    System.out.print("[");
    for(int i=0;i<a.length; i++){
    System.out.print(a[i]);
    if(i<a.length-1) System.out.print(", ");
    System.out.print("]");
    void test(int n){
    int[] a = new int[3];
    for(int i=0; i<n; i++){
    System.out.print(i + " - ");
    decode(a,i);
    printArray(a);
    System.out.print(" - " + encode(a));
    System.out.println();
    public static void main(String args[]){
    ED ed = new ED();
    ed.test(42);
    Sample of test output to show that the encoding and decoding works as expected.
    0 - [0, -1, -1] - 0
    1 - [1, -1, -1] - 1
    2 - [0, 0, -1] - 2
    3 - [1, 0, -1] - 3
    4 - [0, 1, -1] - 4
    5 - [1, 1, -1] - 5
    6 - [0, 2, -1] - 6
    7 - [1, 2, -1] - 7
    8 - [0, 0, 0] - 8
    9 - [1, 0, 0] - 9
    10 - [0, 1, 0] - 10
    11 - [1, 1, 0] - 11
    12 - [0, 2, 0] - 12
    13 - [1, 2, 0] - 13
    14 - [0, 0, 1] - 14
    15 - [1, 0, 1] - 15
    16 - [0, 1, 1] - 16
    17 - [1, 1, 1] - 17
    18 - [0, 2, 1] - 18
    19 - [1, 2, 1] - 19
    20 - [0, 0, 2] - 20
    21 - [1, 0, 2] - 21
    22 - [0, 1, 2] - 22
    23 - [1, 1, 2] - 23
    24 - [0, 2, 2] - 24
    25 - [1, 2, 2] - 25
    26 - [0, 0, 3] - 26
    27 - [1, 0, 3] - 27
    28 - [0, 1, 3] - 28
    29 - [1, 1, 3] - 29
    30 - [0, 2, 3] - 30
    31 - [1, 2, 3] - 31
    32 - [0, 0, 4] - 32
    33 - [1, 0, 4] - 33
    34 - [0, 1, 4] - 34
    35 - [1, 1, 4] - 35
    36 - [0, 2, 4] - 36
    37 - [1, 2, 4] - 37

  • B-tree problem, won't start

    I have a 1.42Ghz mini that is running 10.4.11. I recently installed garageband and the mini started running slower and crashing allot. I booted off the original installation disk and ran the disk utility. It did not find a problem with the disk. I did repair the permissions.
    I decided to use TechTool deluxe because the problems continued. While I was backing up my files, my hard drive suddenly filled up completely. As far as I can tell I didn’t copy my own files back to my harddrive.
    I could not find any duplicate files or any new files.
    I did manage to back up my files and run TechTool. TechTool found an error in the harddrive and repaired it. When I restarted the mini the screen with the white apple comes up, but then the apple disappears and a black rectangle appears in its spot. It does not startup any further then that.
    I did try to use the disk utility of the original installation disk and it found a problem with the b-tree, but the disk utility could not repair it.
    I am kind of stuck as to what I should do next. Any ideas?

    OSX gets really unhappy if you let the hard drive fill up completely.
    It's not clear whether your hard drive was already dying when this mishap occurred, or whether the "fill-up" caused the B-tree error and the drive is otherwise mechanically healthy.
    If you have a decent backup, you might be best using DiskUtility to erase and reformat and then re-install everything.
    If you don't have a good backup, then your options would appear to be to try to fix the b-tree error with DiskWarrior, or to recover what files you can to another hard drive using DataRescueII.
    If the hard drive was full when it died, DiskWarrior will have a hard time doing the repair, however.
    A third option would be to install Tiger on an external firewire drive and use that as your startup drive from now on. (I run my Mini from a firewire external.) You could then, at your leisure, try to rescue what data you can from the internal. If you do this, be sure to use the Apple Partition Map on the external drive, because PPC Minis require this to boot.

  • Oracle apex Tree problem

    hello
    I have two trees in different pages. Both trees selected same data ,but have different conditions. When i have child in one tree, in second tree is not seen anything and I should see a parent.
    I don't know what is the problem!
    Please help!
    Thank You!!

    Hi,
    I had the same problem some time ago, I needed to display arround 15000 records like you, and the APEX tree was too slow. I tried some tree plugins but all failed somehow...
    The best one I found was an old script called "tigra tree menu", I wrote my own PL/SQL function that returns data formated as a javascript table. This javascript table is passed to the tigra tree menu function that build the corresponding HTML table. I have improved the code (xhtml, cookies management, etc...) but it is still a little slow when a node contains too much children.
    So as you said, the best way is to load children dynamically.
    Maybe you can write a PL/SQL function that will execute a hierarchical query with a condition level <= 1, taking the root node as parameter. And call it each time you clic a node to display children.
    I don't implemented it that way because I had other requirements and it is more complicated in my case (cookies to keep tree state, ability to filter the tree, etc...) but maybe it is enough for your case.
    Hope it can helps.
    Yann.

  • MD04 overview tree problem

    Hi SAP experts i hope you can help me on something, i need to know the requirements for the Overview tree to work with my materials, i have a group order that i would like to view in the overview tree but i can only see the FERT material, i cant see the other two HALBs, i hope you can help me out, if you need more info please tell me.

    German ,
    It does not matter if your MRP type is M0 or PD. You should be able to see the entire Order structure if you have the MRP  element (planned order/ production order ) for that material. 
    If there is no such MRP element either due to no requirement ( sale order /dependent requiremnt) or Excess Stock (stock more than requirements) then you cannot see the Order Tree in the Overview screen. The Order tree will display only if there is a order( plan or production).
    Hope this explains your issue. If you have further questions please come back.
    Thanks,
    Ram

  • ADF Tree problem

    hi all,
    i have master detailed view objects
    i have dropped the master view object as adf tree in my page
    how can i use only specified field to get its value
    i have made all fields available while creating tree
    i am using adf bc jdeveloper 11.1.1.2.0
    please help
    thanks

    1. Always Choose appropriate Subject for your questions....
    2. clearly define your issue.
    Your post is not clear what you need actually......Do you want to access value in java? or only want to display 1 column in the tree?
    if 2nd option then edit the Tree binding in bindings section.

  • Tree problem in 11g

    Hi,
    I'm using Jdeveloper 11g.
    When I add an item in a tree, the tree does not refresh until I click on the tree's root. What should I do too see the changes in the tree by the time I add a new item in it ?
    Thanx in advance,
    Shadi

    From you explanation, i suppose,
    1. Your creation form is in the jsff page.
    2. Your tree is in the jspx page.
    3. You've dropped the jsff page as region in the jspx page where you have tree.
    Now, after pressing submit on the region, your tree is not refreshed with the new row you created. Am I correct?
    If yes, then, I suppose your tree and creation form are bound to different Iterators. So, you may need to perform execute on the iteration (on which the tree is bound to).
    Try this,
    1. In the action Listener of the Commit button, after the commit operation, get the Iterator on which the tree is based on.
    2. Perform execute.
    Does it work now?
    -Arun

  • Binary tree problems.

    hi everyone.
    I have an assignment to use a binary search tree whose nodes hold a reference to a string, and also to an int which is the count of how many times that word occurs in an input file, then it traverses the tree and prints out the result to an output file.
    But when I compile, I get this one error, which I'm not sure how to fix.
    the error says:
    WordCount2.java:142: displayNode(java.lang.String,int) in Node cannot be applied to () localRoot.displayNode();
    and here's he code:
    import java.io.*;
    import java.util.*;
    import java.util.StringTokenizer;
    import java.lang.String.*;
    class WordCount2
    public static void main (String [] args) throws IOException
    StringTokenizer tokenizer;
    String inputpath, outputpath;
    String line = "";
    String str = "";
    Tree tree = new Tree();
    int i = 0;
    int count = 0;
    Node now = new Node();
    BufferedReader stdin= new BufferedReader(new InputStreamReader(System.in));
    System.out.println("Enter the pathname of the input file: ");
    inputpath = stdin.readLine();
    System.out.println("Enter the pathname of the output file: ");
    outputpath = stdin.readLine();
    FileReader textFile1 = new FileReader(inputpath);
    BufferedReader inputFile = new BufferedReader (textFile1);
    FileWriter textFile2 = new FileWriter(outputpath);
    PrintWriter outputFile = new PrintWriter(textFile2);
    while ((line = inputFile.readLine()) != null)
    tokenizer = new StringTokenizer(line, " ");
    while (tokenizer.hasMoreTokens())
    String s = tokenizer.nextToken().toLowerCase();
    tree.insert(s, i);
    tree.inOrderTraverse(now);
    class Node
    public String sData;
    public int iData;
    public Node leftChild;
    public Node rightChild;
    public Node()
    sData = "";
    iData = 0;
    public void displayNode(String s, int i) throws IOException
    String file = "test1.txt";
    FileReader fr = new FileReader (file);
    BufferedReader inFile = new BufferedReader(fr);
    String line = inFile.readLine();
    String file2 = "outfile.txt";
    FileWriter fw = new FileWriter (file2);
    BufferedWriter bw = new BufferedWriter(fw);
    PrintWriter outFile = new PrintWriter(bw);
    outFile.print (s);
    outFile.print (" - ");
    outFile.print (i);
    outFile.flush();
    class Tree
    private Node root;
    public Tree()
    root = null;
    public void insert(String sd, int id)
    Node newNode = new Node();
    newNode.sData = sd;
    newNode.iData = id;
    if (root == null)
    root = newNode;
    else
    Node current = root;
    Node parent;
    while (true)
    parent = current;
    if ((newNode.sData).compareTo(current.sData) < 0)
    current = current.leftChild;
    if (current == null)
    parent.leftChild = newNode;
    return;
    else if((newNode.sData).compareTo(current.sData) == 0)
    increment(newNode.iData);
    else
    current = current.rightChild;
    if(current == null)
    parent.rightChild = newNode;
    return;
    public void inOrderTraverse (Node localRoot)
    if (localRoot != null)
    inOrderTraverse(localRoot.leftChild);
    localRoot.displayNode();
    inOrderTraverse(localRoot.rightChild);
    private int increment(int i)
    return i++;
    any help is greatly appreciated! thanks!

    ok, thanks a lot!
    so i was able to fix that, and it compiles, but when I run it, it gets stuck after i enter the name of the input and output files. anyone have any idea why it's doing that? I can't figure it out...
    here's the edited code:
    import java.io.*;
    import java.util.*;
    import java.util.StringTokenizer;
    import java.lang.String.*;
    class WordCount2
    public static void main (String [] args) throws IOException
    StringTokenizer tokenizer;
    String inputpath, outputpath;
    String line = "";
    String str = "";
    Tree tree = new Tree();
    int i = 0;
    int count = 0;
    Node now = new Node();
    BufferedReader stdin= new BufferedReader(new InputStreamReader(System.in));
    System.out.println("Enter the pathname of the input file: ");
    inputpath = stdin.readLine();
    System.out.println("Enter the pathname of the output file: ");
    outputpath = stdin.readLine();
    FileReader textFile1 = new FileReader(inputpath);
    BufferedReader inputFile = new BufferedReader (textFile1);
    FileWriter textFile2 = new FileWriter(outputpath);
    PrintWriter outputFile = new PrintWriter(textFile2);
    while ((line = inputFile.readLine()) != null)
    tokenizer = new StringTokenizer(line, " ");
    while (tokenizer.hasMoreTokens())
    String s = tokenizer.nextToken().toLowerCase();
    tree.insert(s, i);
    tree.inOrderTraverse(now);
    class Node
    public String sData;
    public int iData;
    public Node leftChild;
    public Node rightChild;
    public Node()
    sData = "";
    iData = 0;
    public void displayNode(String s, int i) throws IOException
    String file = "test1.txt";
    FileReader fr = new FileReader (file);
    BufferedReader inFile = new BufferedReader(fr);
    String line = inFile.readLine();
    String file2 = "outfile.txt";
    FileWriter fw = new FileWriter (file2);
    BufferedWriter bw = new BufferedWriter(fw);
    PrintWriter outFile = new PrintWriter(bw);
    outFile.print (s);
    outFile.print (" - ");
    outFile.print (i);
    outFile.flush();
    class Tree
    private Node root;
    public Tree()
    root = null;
    public void insert(String sd, int id)
    Node newNode = new Node();
    newNode.sData = sd;
    newNode.iData = id;
    if (root == null)
    root = newNode;
    else
    Node current = root;
    Node parent;
    while (true)
    parent = current;
    if ((newNode.sData).compareTo(current.sData) < 0)
    current = current.leftChild;
    if (current == null)
    parent.leftChild = newNode;
    return;
    else if((newNode.sData).compareTo(current.sData) == 0)
    increment(newNode.iData);
    else
    current = current.rightChild;
    if(current == null)
    parent.rightChild = newNode;
    return;
    public void inOrderTraverse (Node localRoot) throws IOException
    String s = "";
    int i = 0;
    if (localRoot != null)
    inOrderTraverse(localRoot.leftChild);
    localRoot.displayNode(s, i);
    inOrderTraverse(localRoot.rightChild);
    private int increment(int i)
    return i++;
    thanks again!

  • Directory tree problem

    I am using a JTree to display the directory structure.
    I have to show the files in a JList present in the particular directory.
    But the contents of the JList dont change as soon as I select the other
    directory in the tree.
    Please suggest how to display the files in a particular directory ,
    selected during runtime in a JList.

    http://java.sun.com/docs/books/tutorial/uiswing/components/tree.html

  • Interactive ALV tree problem

    Hi all,
    Please help,
    I have created ALV tree, with the help of standard program bcalv_tree_01. now i want to create it interative like DOUBLE CLICK on any ITEM or NODE. so i have define class and implement it with two method for event NODE_DOUBLE_CLICK and ITEM_DOUBLE_CLICK. and i have register it. when i display the tree it doesn't expand, but i comments the CALL METHOD gd_tree->set_registered_events it works fine. should i have to implement the event EXPAND_NO_CHILDREN also?
    and what should be the code, becoz i am new in alv tree and oops. for sytex please refer BCALV_TREE_01.
    please help as soon as possible.
    Thanks in advance.

    Hi!
    Ya you have to code for the method  EXPAND_NO_CHILDREN
    Where you will be defining the childs to the particular node.
    the better example for it you can refer to SAPSIMPLE_TREE_CONTROL_DEMO
    where
    HANDLE_EXPAND_NO_CHILDREN method implemented shows the childs added and  METHOD  HANDLE_NODE_DOUBLE_CLICK
    implemented to handle the doulbe click.
    Regards.

Maybe you are looking for