Make tree structure persitent

Hello,
i have a tree structure in my Webdynpro.
For example a project of buildings, levels, floors and rooms.
This works fine with recursive nodes in the context and the WD-Tree-UI-Element.
Now i want to make this persistent in my Database.
I use CAF with Application Services, WebService and Business Objects.
What is the best BO-Structure ? One BO with an association to himself ?
I test it, but i doesn't work.
Or better a BO with a parentKey-Field and no assocation ?.
What is the best way ?
What ist the best container to transfer the tree-date to the Application-Service to store and load it.
Can anybody help me ?.
Thanks.
Best regards
Klemens

Hi, please read the FAQ before posting again.  Following those guidelines will yield better results and sooner.
See this link for some great examples of APEX Trees:
http://apex.oracle.com/pls/apex/f?p=36648
Jeff

Similar Messages

  • Listing File Hierarchy in console using a Tree structure

    first off i'm a college student. i'm not that good at java... we got this CA in class and try as i might i just can't get my head around it
    i was wondering if someone who know a bit more about java then i do would point me in the right direction, were i'm going wrong in my code
    i have to list out sub-files and sub-directorys of a folder (i.e. C:/test) to console using tree structure
    like this
    startingdir
    dir1 //subfolder of startingdir
    dir11 //subfolder of dir1
    dir111 //subfolder of dir11
    dir12 //subfolder of dir1
    file1A // document on dir1
    dir2 //subfolder of startingdir
    Tree.java
    import java.util.Iterator;
    import java.util.LinkedList;
    import java.util.ListIterator;
    import java.util.NoSuchElementException;
    import java.util.Deque;
    public class Tree<E> {
        // Each Tree object is an unordered tree whose
        // elements are arbitrary objects of type E.
        // This tree is represented by a reference to its root node (root), which
        // is null if the tree is empty. Each tree node contains a link to its
        // parent and a LinkedList of child nodes
        private Node root;
        //////////// Constructor ////////////
        public Tree () {
        // Construct a tree, initially empty.
            root = null;
        //////////// Accessors ////////////
        public boolean isEmpty () {
        // Return true is and only if this tree is empty.
             return (root == null);
        public Node root () {
        // Return the root node of this tree, or null if this tree is empty.
            return root;
        public Node parent (Node node) {
        // Return the parent of node in this tree, or null if node is the root node.
            return node.parent;
        public void makeRoot (E elem) {
        // Make this tree consist of just a root node containing element elem.
            root = new Node(elem);
        public Node addChild (Node node, E elem) {
        // Add a new node containing element elem as a child of node in this
        // tree. The new node has no children of its own. Return the node
        // just added.
            Node newChild = new Node(elem);
            newChild.parent = node;
            node.children.addLast(newChild);
            return newChild;
        public E element (Node node) {
             return node.getElement();
        //////////// Iterators ////////////
        public Iterator childrenIterator (Node node) {
            return node.children.iterator();
        public Iterator nodesPreOrder () {
        // Return an iterator that visits all nodes of this tree, with a pre-order
        // traversal.
            return new Tree.PreOrderIterator();
        //////////// Inner classes ////////////
        public class Node {
            // Each Tree.Node object is a  node of an
            // unordered tree, and contains a single element.
            // This tree node consists of an element (element),
            // a link to its parent
            // and a LinkedList of its children
            private E element;
            private Node parent;
            private LinkedList<Node> children;
            private Node (E elem) {
                // Construct a tree node, containing element elem, that has no
                // children and no parent.
                this.element = elem;
                this.parent = null;
                children = new LinkedList<Node>();
            public E getElement () {
            // Return the element contained in this node.
                return this.element;
            public String toString () {
            // Convert this tree node and all its children to a string.
                String children = "";
                // write code here to add all children
                return element.toString() + children;
            public void setElement (E elem) {
            // Change the element contained in this node to be elem.
                this.element = elem;
        public class PreOrderIterator implements Iterator {
            private Deque<Node> track; //Java recommends using Deque rather
            // than Stack. This is used to store sequence of nomempty subtrees still
            //to be visited
            private PreOrderIterator () {
                track = new LinkedList();
                if (root != null)
                    track.addFirst(root);
            public boolean hasNext () {
                return (! track.isEmpty());
            public E next () {
                Node place = track.removeFirst();
                //stack the children in reverse order
                if (!place.children.isEmpty()) {
                    int size = place.children.size(); //number of children
                    ListIterator<Node> lIter =
                            place.children.listIterator(size); //start iterator at last child
                    while (lIter.hasPrevious()) {
                        Node element = lIter.previous();
                        track.addFirst(element);
                return place.element;
            public void remove () {
                throw new UnsupportedOperationException();
        FileHierarchy.java
    import java.io.File;
    import java.util.Iterator;
    public class FileHierarchy {
        // Each FileHierarchy object describes a hierarchical collection of
        // documents and folders, in which a folder may contain any number of
        // documents and other folders. Within a given folder, all documents and
        // folders have different names.
        // This file hierarchy is represented by a tree, fileTree, whose elements
        // are Descriptor objects.
        private Tree fileTree;
        //////////// Constructor ////////////
        public FileHierarchy (String startingDir, int level) {
            // Construct a file hierarchy with level levels, starting at
            // startingDir
            // Can initially ignore level and construct as many levels as exist
            fileTree = new Tree();
            Descriptor descr = new Descriptor(startingDir, true);
            fileTree.makeRoot(descr);
            int currentLevel = 0;
            int maxLevel = level;
            addSubDirs(fileTree.root(), currentLevel, maxLevel);
        //////////// File hierarchy operations ////////////
        private void addSubDirs(Tree.Node currentNode, int currentLevel,
                int maxLevel) {
        // get name of directory in currentNode
        // then find its subdirectories (can add files later)
        // for each subdirectory:
        //    add it to children of currentNode - call addChild method of Tree
        //    call this method recursively on each child node representing a subdir
        // can initially ignore currentLevel and maxLevel   
            Descriptor descr = (Descriptor) currentNode.getElement();
            File f = new File(descr.name);
            File[] list = f.listFiles();
            for (int i = 0; i < list.length; ++i) {
                if (list.isDirectory()) {
    File[] listx = null;
    fileTree.addChild(currentNode, i);
    if (list[i].list().length != 0) {
    listx = list[1].listFiles();
    addSubDirs(currentNode,i,1);
    } else if (list[i].isFile()) {
    fileTree.addChild(currentNode, i);
    // The following code is sample code to illustrate how File class is
    // used to get a list of subdirectories from a starting directory
    // list now contains subdirs and files
    // contained in dir descr.name
    ////////// Inner class for document/folder descriptors. //////////
    private static class Descriptor {
    // Each Descriptor object describes a document or folder.
    private String name;
    private boolean isFolder;
    private Descriptor (String name, boolean isFolder) {
    this.name = name;
    this.isFolder = isFolder;
    FileHierarchyTest.javapublic class FileHierarchyTest {
    private static Tree fileTree;
    public static void main(String[] args) {
    FileHierarchy test = new FileHierarchy ("//test", 1);
    System.out.println(test.toString());

    Denis,
    Do you have [red hair|http://www.dennisthemenace.com/]? ;-)
    My advise with the tree structure is pretty short and sweet... make each node remember
    1. it's parent
    2. it's children
    That's how the file system (inode) actually works.
    <quote>
    The exact reasoning for designating these as "i" nodes is unsure. When asked, Unix pioneer Dennis Ritchie replied:[citation needed]
    In truth, I don't know either. It was just a term that we started to use. "Index" is my best guess, because of the
    slightly unusual file system structure that stored the access information of files as a flat array on the disk, with all
    the hierarchical directory information living aside from this. Thus the i-number is an index in this array, the
    i-node is the selected element of the array. (The "i-" notation was used in the 1st edition manual; its hyphen
    became gradually dropped).</quote>

  • Event Handling for tree structure using "CL_GUI_ALV_TREE_SIMPLE"

    Hi,
    I have created a tree structure using class CL_GUI_ALV_TREE_SIMPLE.
    Now I wanted to insert a check and give message when the user opens the last node in my structure.
    I checked the events available in the class , but there in none which gets trigered when we try to open a node.
    Please guide me with this scenario.
    Thanks & Regards,
    Omkar M.

    Hello Omkar
    The solution is somewhat odd but apparently works. As sample report please check BCALV_TREE_SIMPLE_DEMO.
    Copy this report and make the following changes:
    class lcl_tree_event_receiver definition.
      public section.
        methods:
        on_expand_no_children " new event handler method
          for event expand_no_children of cl_gui_column_tree
            importing NODE_KEY,  " class = CL_GUI_COLUMN_TREE !!!
        on_add_hierarchy_node
                  for event on_add_hierarchy_node of cl_gui_alv_tree_simple
                        importing grouplevel
                                  index_outtab.
    endclass.
    CLASS lcl_tree_event_receiver IMPLEMENTATION.
      METHOD on_expand_no_children.
        BREAK-POINT.
      ENDMETHOD.                    "on_expand_no_children
    FORM register_events.
    * define the events which will be passed to the backend
      DATA: lt_events TYPE cntl_simple_events,
            l_event TYPE cntl_simple_event.
    * define the events which will be passed to the backend
      l_event-eventid = cl_gui_column_tree=>eventid_node_context_menu_req.
      APPEND l_event TO lt_events.
      l_event-eventid = cl_gui_column_tree=>eventid_expand_no_children.
      APPEND l_event TO lt_events.
      CALL METHOD tree1->set_registered_events
        EXPORTING
          events                    = lt_events
        EXCEPTIONS
          cntl_error                = 1
          cntl_system_error         = 2
          illegal_event_combination = 3.
    * set Handler
      DATA: l_event_receiver TYPE REF TO lcl_tree_event_receiver.
      CREATE OBJECT l_event_receiver.
      SET HANDLER l_event_receiver->on_add_hierarchy_node
                                                            FOR tree1.  " CL_GUI_ALV_TREE_SIMPLE
      SET HANDLER l_event_receiver->on_expand_no_children
                                              FOR ALL INSTANCES. " CL_GUI_COLUMN_TREE !!!
    ENDFORM.                               " register_events
    As soon as you open a node in the ALV tree the report will stop at the break-point.
    Now you need to check if there are still children nodes to be displayed.
    If not then trigger your special coding.
    Regards
      Uwe

  • KMC Error- Internal Error in Tree Structure

    Hi,
    I am getting this error in my DefaultTrc.log file and am not able able to make out what it is coming for. I have installed EP6 SP9 with patches and KMC sp9 with patch2.
    Also i have configured muliple LDAP servers for UME. The LDAP connection and user maintenance is working fine. But i get this error in my log files.
    Also the installation is a distributed WebAS installation.
    Here is the error i am getting
    RegisterNode</Applications/KMC/Repository Framework/Components/Repository Managers/ume/Creation>: com.sap.mona.api.JMonException: com.sap.mona.api.JMonAPIException: Internal error in tree structure.
    Can Anyone tell me if they are getting any such errors.
    Any solutions?
    Regards,
    Hassan

    Hi Hassan,
    you might want to log a support message to SAP about this and (there as well as here) add information about the used LDAP technology and involved opereating systems.
    Regards,
    Karsten

  • How to  create Tree Structure for given data?

    Hi,
    I have to create a tree structure of Folders and the contents in the Folder.
    I have a XML, it contains data for the tree structure to display. How can I create a tree structure which would look like below
    Parent
       Child
         Supporting Views
            Raw eInfotree Table Views
            Background Calculations
            QC Data Views
         Calculation Views
         Unit Operation Views
            Cell Culture Views
            Purification Views
            MFR Views
         Personal Views
    All the nodes should have folder Icon.
    Please find the XML as
    <?xml version="1.0" encoding="UTF-8"?><Rowsets DateCreated="2007-05-02T07:37:37" EndDate="2007-05-02T16:59:53" StartDate="2007-05-02T16:59:53" Version="11.5.3"><Rowset><Columns><Column Description="" MaxRange="1" MinRange="0" Name="TK" SQLDataType="4" SourceColumn="TK"/><Column Description="" MaxRange="1" MinRange="0" Name="NAME" SQLDataType="1" SourceColumn="NAME"/><Column Description="" MaxRange="1" MinRange="0" Name="TYPE" SQLDataType="1" SourceColumn="TYPE"/><Column Description="" MaxRange="1" MinRange="0" Name="PK" SQLDataType="4" SourceColumn="PK"/></Columns>
    <Row><TK>1</TK><NAME>Parent</NAME><TYPE>F</TYPE><PK>0</PK></Row>
    <Row><TK>2</TK><NAME>Child</NAME><TYPE>F</TYPE><PK>1</PK></Row>
    <Row><TK>3</TK><NAME>Supporting Views</NAME><TYPE>F</TYPE><PK>2</PK></Row>
    <Row><TK>4</TK><NAME>Raw eInfotree Table Views</NAME><TYPE>F</TYPE><PK>3</PK></Row>
    <Row><TK>5</TK><NAME>Background Calculations</NAME><TYPE>F</TYPE><PK>3</PK></Row>
    <Row><TK>6</TK><NAME>QC Data Views</NAME><TYPE>F</TYPE><PK>3</PK></Row>
    <Row><TK>7</TK><NAME>Calculation Views</NAME><TYPE>F</TYPE><PK>2</PK></Row>
    <Row><TK>8</TK><NAME>Unit Operation Views</NAME><TYPE>F</TYPE><PK>2</PK></Row>
    <Row><TK>9</TK><NAME>Cell Culture Views</NAME><TYPE>F</TYPE><PK>8</PK></Row>
    <Row><TK>10</TK><NAME>Purification Views</NAME><TYPE>F</TYPE><PK>8</PK></Row>
    <Row><TK>11</TK><NAME>MFR Views</NAME><TYPE>F</TYPE><PK>8</PK></Row>
    <Row><TK>12</TK><NAME>Personal Views</NAME><TYPE>F</TYPE><PK>2</PK></Row>
    </Rowset>
    </Rowsets>

    Vishal,
    If you structure your data with two columns, the first being the Node name and the second being the Parent node name (see your information below), the iBrowser applet will make a nice data driven tree with all of the SelectionEvent or navigational capabilities you want.
    <?xml version="1.0" encoding="UTF-8"?>
    <Rowsets DateCreated="2007-05-02T07:37:37" EndDate="2007-05-02T16:59:53" StartDate="2007-05-02T16:59:53" Version="11.5.3">
    <Rowset><Columns><Column Description="" MaxRange="1" MinRange="0" Name="NAME" SQLDataType="1" SourceColumn="NAME"/><Column Description="" MaxRange="1" MinRange="0" Name="PARENT" SQLDataType="1" SourceColumn="PARENT"/></Columns>
    <Row><NAME>Parent</NAME><PARENT></PARENT></Row>
    <Row><NAME>Child</NAME><PARENT>Parent</PARENT></Row>
    <Row><NAME>Supporting Views</NAME><PARENT>Child</PARENT></Row>
    <Row><NAME>Calculation Views</NAME><PARENT>Child</PARENT></Row>
    <Row><NAME>Unit Operation Views</NAME><PARENT>Child</PARENT></Row>
    <Row><NAME>Personal Views</NAME><PARENT>Child</PARENT></Row>
    <Row><NAME>Raw eInfotree Table Views</NAME><PARENT>Supporting Views</PARENT></Row>
    <Row><NAME>Background Calculations</NAME><PARENT>Supporting Views</PARENT></Row>
    <Row><NAME>QC Data Views</NAME><PARENT>Supporting Views</PARENT></Row>
    <Row><NAME>Cell Culture Views</NAME><PARENT>Unit Operation Views</PARENT></Row>
    <Row><NAME>Purification Views</NAME><PARENT>Unit Operation Views</PARENT></Row>
    <Row><NAME>MFR Views</NAME><PARENT>Unit Operation Views</PARENT></Row>
    </Rowset>
    </Rowsets>
    Regards,
    Jeremy

  • WebLogic missing data on JNDI Tree Structure

    I need to work with Tuxedo through WebLogic, but I am having a bad time trying to figure what is going wrong in here. I have installed WebLogic 10.3 twice and still can't make it right.
    In the JNDI Tree Structure many data is missing (among them tuxedo) and can't find a way to fix it.
    Please, if anyone can give me a light I'll appreciate it.
    Regards.
    Pablo Bustos.
    EDIT: I am running WebLogic 10.3 on Windows XP 32bits.

    Hi,
    Check this debug in ur environment.
    -Dweblogic.jndi.retainenvironment=true
    this should show you the path.
    Regards,
    Kal.

  • TREE STructures

    hi all,
    i was working with the tree structures . . . i used CL_GUI_SIMPLE_TREE. when i was done with it i found that it can only make one level nodes nesting .
    Please help what should i use, i want to have a tree with any number of levels of tree nodes.
    Thanx in Advance
    Zahid

    Hello Shehryar,
    Firstly, it's nice to know that you like some of the posts that I make here. I like some of your posts very much, too.
    Secondly, Sorry for this late response.
    Now I shall try to correct you :-)...
    Please consider the last post that Zahid had made. He says :
    <i>Thank You Raj! for ur help..
    plz look at the problem what i am actually facing , i mentioned in the above post . . . plz tell me some solution
    Zahid</i>
    What I understand when he says <u>"....the problem i am actually facing, i mentioned in the above post..."</u> is that he wants to have a solution to the problem of building a tree of his specifications.
    In fact, I see that you had also sent him a mail giving him some information. I have no idea about what that was.
    Since he says he is a beginner, I just wanted to give him a little <i>food for thought</i>, if I can call it that, to some basic problem-solving skills in computation. The tree control had just happened to be an example here.
    Trust this sorts things out a bit. Please revert, if you have something else to be clarified.
    Regards,
    Anand Mandalika.
    P.S. 1. I personally prefer going to the Class and clicking the button for "Method Documentation" (place your cursor on the method name and hit F9), rather than going to SE63 (to which the developer might sometimes be unauthorized)
    2. Attempting / wanting to find out the documentation of all the objects (be it programs / FMs / classes / anything ) is something that I don't think makes too much sense. You would have to know the object for which you want the documentation. In other words, you would have to know ( or find out if you do not know ) the tool that you need to use. Then you can read more about it and see if the particular tool does what you want. It is hardly the case that you see what a tool offers and then decide whether you have a requirement for that.

  • ATP Tree Structure error -MATP

    Hi Experts,
    I am testing MATP with RBA, I could not see the planned orders in ATP tree structure once I saved the sales order in ECC.
    Scenario -
    I have product  A (header) and A1 & A2 are the components of product A (Header)
    I have stock on component A1 - 100 & component A2 - 100, STOCK on header material A -0
    I have created sales order for header material A - customer requested  quantity 201.
    THEN system is confirming the sales order only for 100 qty because the components A1 & A2 stock available only 100.
    I can see the dependent demand in rrp3 for Components A1 and A2
    I can see the planned order in rrp3 for header material A
    BUT I could not see any planned orders either in /SAPAPO/RRP_ATP2PPDS - Conversion ATP Tree Structures -> Production Planning OR
    /SAPAPO/ATREE_DSP - ATP Tree Structures
    below is the error message I am getting in the transaction -/SAPAPO/RRP_ATP2PPDS - Conversion ATP Tree Structure
    What could be the wrong in the above case.. can you please suggest.. Advance thanks for your information.

    Hi Experts,
    Can someone please help in the below ATP Tree Structure error-
    I am not able to covert the sales orders from the ATP Tree Structure
    The error message as below - Transaction - /SAPAPO/RRP_ATP2PPDS - Conversion ATP Tree Structures -> Production Planning
    Can you just help me what could be the wrong in the setting and how to make the sales orders to be converted from this transaction /SAPAPO/RRP_ATP2PPDS
    Error appears when I convert the sales orders from the ATP Tree Structure as below -
    ''The successor reqmts groups of the ATP tree structure were not converted''
    Conversion canceled with error
    ATP tree for sales order xxxx, item xx could not be converted
    Thanks,

  • The tree structure in SE09

    Hello Gurus,
            will you please explain the tree item of the tree structure in all level in SE09 ?
    Many thanks,
    Frank Zhang

    Hi,
    The Transport Organizer with Transaction SE09 or SE10. You can also access the request overview of the Transport Organizer from all ABAP Workbench transactions by choosing Environment Transport Organizer (Requests).
    The Display function lets you search for all requests that belong to the specified user and match the standard selection criteria set. You can change the standard selection as required.
    The status selection for requests is used by default for the task selection. However, you can change this by going to the initial screen and choosing Settings other settings.
    Tasks that are not assigned to a request can no longer be created. This means that these tasks are no longer displayed as standard. If you still own tasks of this type, use the request search to display them
    Piece lists
    You can use this request type to set up your own object lists and save them under a name of your choice.
    Piece lists have the following attributes:
    u2022You cannot release them this also means that you cannot transport them.
    u2022They have an object directory entry and are therefore assigned to a package.
       They have the same transport attributes as all objects in this package.
    u2022If you have assigned the piece list to a transportable package, then when you make changes to the piece list the entry LIMU COMM <piece list name> is made in your current change request.
    u2022After the change request has been imported, the piece list is also in the target system of the request; however, the objects entered in the piece list are not automatically included in the transport.
    Delivery Transports
    Use the Delivery selection screen to display transports that deliver software changes from SAP or SAP partners to customers.
    The selection screen covers the following request types:
    u2022Piece list for upgrade
    This transport type imports new releases into your SAP System when you upgrade.
    u2022Piece list for Support Package
    This transport type imports corrections into your SAP System.

  • How compile an entire tree structure packages in JDev

    Hello there
    When i use jdev i have the src folder (source files) and the classes folder (compiled files) as Jdev makes them, but the compiled files are not updated correctly.
    For eg. i created a batch file that runs the application with this content
    echo on
    C:
    set path=C:\Program Files\Java\jdk1.6.0_11\bin;%path%
    set classpath=
    cd C:\jdevstudio10133\jdev\mywork\Supreme\ProjectServer\classes
    java project.main.Main
    And the application started is an older version of the application that i have now, if i put the first line System.out.println("Message") even if i make and rebuild the project, the message will not appear and i dont know how to get the compiled files.
    Also i tried to find out how to compile a tree structure of packages from command line but it seems very difficult. If anyone can give a reference.
    Thank you.

    User,
    you left out vital information. Read this post before posting.
    what happens if you delete the whole classes folder and rebuild the application? JDev will recreate the folder and you should see all changes then. If not you are not running the right classes.
    Timo

  • How to store a Tree Structure in Memory

    hi all!
    I wanted to show a Org Chart on web page. Recursion is used for constructing.Based on B/S architecture,(get Org from DataBase)this is not a effective way!! How can I store a tree structure(Org object are stored as TreeNodes) in memory for recursion??? Thanks!

    My English is too poor! So I posted the interfaces blow.
    I used these interface to construct a org tree(which will displyed in browser ),but it's
    efficiency is low. (recursion)Because the org infor. are stored in database(thounds of
    orgs are stored).(I think this is the bottleneck)
    Now I want to store the tree structure in memeory! Then jsp page only needs to build the tree
    from memory!Needn't make a DbConnection every time. A timer will updated tree org(in memory)
    automatic
    So I want to use a N dimensions array to store the data (N is the number of orgs)
    but I don't konw how to make a compositor for sorting!
    after sorting .look at the matrix I poster blow(eg.)
    Matrix:(a,b,c,d are orgs 1 mean's is parents 0 means not, this is a Sparse Set huh? ^_^ )
    * a b c d
    a 0 0 0 0
    b 1 0 0 0
    c 1 0 0 0
    d 0 1 0 0
    Org tree:
    a
    b c
    d
    so O(n(n-1)/2)
    question:
    1)How to sort orgs?
    2)Any good suggestion is wanted!
    Thanks!
    interfaces
    public interface IOrg {             //entity class
    public String getName(); //get Org Name
    public String getId(); //get Org Id
    public String getLevel(); //get Org Level (as String)
    public String getParentId(); //get parent org Id
    public String getDescription(); //get the description
    public boolean isActive(); //is Org active
    Org Factory
    import java.util.*;
    * Description of the Interface
    *@author ymruan
    *@created 2002��1��4��
    public interface IOrgFactory {
    public IOrg getOrgById(String orgId);
    public IOrg getOrgByObjId(String objId);
    public Enumeration getManagers(String orgId);
    public Enumeration getManagers(IOrg org);
    public Enumeration getEmployees(String orgId);
    public Enumeration getEmployees(IOrg org);
    public Enumeration getOrgsByLevel(String level);
    public Enumeration getAllOrgs();
    public Enumeration getOrgsLikeName(String name);
    public IOrg getParentOrg(IOrg org);
    public IOrg getRootOrg(); //get Root Org
    public Enumeration getChildOrgs(IOrg org); //get Ogg's children
    public boolean hasSubOrgs(IOrg org); // is leaf
    public boolean hasActiveSubOrgs(IOrg org);
    public boolean isInOrg(String orgId, String empId);
    public boolean hasEmployees(IOrg org);

  • Sidebar expand folder functionality/ file tree structure

    Is there a way to get "favorites" that I've added to my sidebar to expand in Mavericks? I'd like to show a file tree structure in the sidebar. This would make it SO much easier to move image files one folder up. Right now I have to have multiple folders open or have columns view which doesn't enable me to have a usable thumbnail preview in the working folder. Please help!
    --Francesca

    No.   The sidebar does not provide that; there's no hierarchical navigation within the sidebar.
    If not already doing so, you might consider using tabs for your various Finder views.
    Otherwise, there might be a different option available as a Finder alternative.

  • Tree Structure generation in content management

    Hi,
    I am new to Oracle portals.I have a task of generating a default
    tree structure based on say somes values from database eg: DEALS1,DEALS2, DEALS3 displayed, when I create or click any of these it should open a dynamic folder structure depending on users security level.One of the examples oracle uses is when you create a content area, by default portal generates Folders
    folder , Category folder, Navigation bar folders , etc.
    2. Is it possible to achieve tree similar to the one Oracle Portal displays when we open a default content page and click Content Area Map on top left , i.e with folders expands and closes on each click to Icon.
    Thanks
    Morozov

    Is it feasible in your scenario to simply set the unwanted folders to "hidden" or is it completely ACL-based? With the regular end-user explorers (e.g. ConsumerExplorer), hidden folders won't be shown (this is a setting of the corresponding collection renderer). Administrative Explorers (e.g. Admin Explorer) do show hidden files, though. Note that you can only modify the hidden state with such an administrative explorer. This makes sure that you have at least one way to reset that state and to not hide it in an explorer that afterwards does not show the file and thus would not allow you to reverse that step (in principle this means that users with no administrative accesses whatsoever will never be able to hide resources).
    Regards, /-/ans-Juergen

  • Complex Tree Structure Query

    Hi,
    I have a table which contains the hierarchial data upto 4 levels. I needed to have the information of all the four levels in a row, so I created 3 tree structured views and one another view using the tree structured views as below
    --To get the great grand parent id for the children*
    CREATE OR REPLACE VIEW VR_PO_TREE AS
    SELECT LEVEL pathlength,
    connect_by_root partner_organization_id root_po,
    partner_organization_id,
    partner_common_name,
    partner_organization_type
    FROM partner_organization po
    START WITH po.org_entity_above_id IS NULL
    CONNECT BY PRIOR po.partner_organization_id = po.org_entity_above_id
    ORDER BY po.partner_organization_id;
    -- level 2 (grant parent) id
    CREATE OR REPLACE VIEW VR_PO_AREA_TR AS
    SELECT LEVEL pathlength,
    connect_by_root partner_organization_id root_po,
    partner_organization_id,
    partner_common_name,
    partner_organization_type
    FROM partner_organization vcpo
    START WITH vco.partner_organization_type = 'AREA'
    CONNECT BY PRIOR vcpo.partner_organization_id = vcpo.org_entity_above_id
    ORDER BY vcpo.partner_organization_id;
    --level 3 (parent) id*
    CREATE OR REPLACE VIEW VR_PO_REGION_TREE AS
    SELECT LEVEL pathlength,
    connect_by_root partner_organization_id root_po,
    vcpo.partner_organization_id,
    vcpo.partner_common_name,
    vcpo.partner_type
    FROM partner_organization vcpo
    START WITH vcpo.partner_organization_type = 'REGION'
    CONNECT BY PRIOR vcpo.partner_organization_id = vcpo.org_entity_above_id
    ORDER BY vcpo.partner_organization_id;
    ---and finally created a view to have all the levels in a single row
    CREATE OR REPLACE VIEW VR_PO_ALL_TREE AS
    SELECT pot.pathlength,
    po.partner_organization_id,
    po.partner_common_name,
    pot.root_po int_partner_org_id,
    pot.intl_po_name int_partner_common_name,
    vpat.root_po area_partner_org_id,
    vpat.area_po_name area_partner_common_name,
    vprt.root_po region_partner_org_id,
    vprt.region_po_name region_partner_common_name
    FROM partner_organization po
    JOIN vr_po_tree pot
    ON pot.partner_organization_id = po.partner_organization_id
    LEFT outer JOIN vr_po_area_tr vpat
    ON vpat.partner_organization_id = po.partner_organization_id
    LEFT OUTER JOIN vr_po_region_tree vprt
    ON vprt.partner_organization_id = po.partner_organization_id;
    All the views are working fine, very fast, giving the expected output.
    if we make a join to the view vr_po_all_tree in a query that also works fine. However, if we make an outer join to a query that has the join to vr_po_all_tree, Oracle throws an internal error - Ora-00600 internal error codes, arguments [qrctce1], [0],[0],.....
    Is the view vr_po_all_tree is cause for this problem?, in such a case can any one help me to rewrite the view with a simple query to give the same results?
    Thanks in advance.
    Nattu
    Edited by: Nattu on Nov 26, 2009 8:25 PM
    Edited by: Nattu on Nov 27, 2009 11:48 AM
    Edited by: Nattu on Nov 27, 2009 11:55 AM

    Hi,
    if we make a join to the view vr_po_all_tree in a query that also works fine. However, if we make an outer join to a query that has the join to vr_po_all_tree, Oracle throws an internal error - Ora-00600 internal error codes, arguments [qrctce1], [0],[0],.....
    Is the view vr_po_all_tree is cause for this problem?As Sven said, ORA-00600 is the sign of some low-level problem, and you should seek a solution from Oracle support. Your views are not the cause of this problem; most likely, the views trigger something that would not be a problem except for a installatin problem or maybe a bug.
    We can try to find a work-around for you, but don't ignore the problem.
    in such a case can any one help me to rewrite the view with a simple query to give the same results?It seems very likely that you could do something that didn't involve so many CONNECT BYs and outer joins.
    Post some sample data (CREATE TABLE and INSERT statements) and the results you want from that data.
    Simplify as much as possible. For example, in the first view you say:
    CREATE OR REPLACE VIEW VR_PO_TREE AS
    SELECT LEVEL pathlength,
    connect_by_root partner_organization_id root_po,
    connect_by_root partner_common_name intl_po_name,
    connect_by_root is_wbti is_wbti,
    connect_by_root is_sil_int is_sil_int,
    connect_by_root organization_entity_code int_org_entity_code,
    org_entity_above_id, partner_organization_id,
    partner_organization_type,
    sys_connect_by_path(partner_organization_id, '\') po_path_id,
    sys_connect_by_path(partner_common_name, '\') po_path_name
    FROM ...That is, you're selecting 1 pseudo-column (LEVEL), 4 CONNECT_BY_ROOTs, 3 plain columns, and 2 SYS_CONNECT_BY_PATHs.
    Can you post a problem with just one of each: 1 pseudo-column, 1 CONNECT_BY_ROOT, 1 plain column, and 1 SYS_CONNECT_BY_PATH?  Adding the others later should be easy.
    Any information you can give about the data would be helpful.
    In particular,
    (a) Can org_entity_above be NULL on the same row where partner_organization_type is 'AREA' or 'REGION'?
    (b) How many ancestors with partner_organization_type = 'AREA' Can a node have? 1? No more than 1?  1 or more? 0 or more?
    (c) Same for 'REGION'.  How many ancestors with partner_organization_type = 'REGION' Can a node have? 1? No more than 1?  1 or more? 0 or more?
    (d) Can a node with partner_organization_type = 'REGION' be the ancestor of a row with partner_organization_type = 'AREA'?
    (e) Other way around: can a node with partner_organization_type = 'AREA' be the ancestor of a row with partner_organization_type = 'REGION'?
    Some of these questions may seem silly to you, because you know the table and the data so well.  I don't, so you'll have to explain things.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           

  • Tree Structure in JSP

    Hi,
    I have an xml file , my requirement needs me to display the xml file as a tree structure in jsp. The user should be able to make changes to tree. he can drag and drop the nodes and save the changes.
    I parsed the xml file and created a method that returns an arrayList of the immediate children given a node.I'am not getting how to proceed from there on.
    Can anyone provide me with any useful tips or code. I can use javascript css java(not swing).Please reply ASAP as I have to complete it soon.
    Thanks,
    Sabi

    Hi why dont you try the link below,
    basically its for menu u can change it,
    http://demo.raibledesigns.com/struts-menu/
    in the above link see the following hyperlink
    Expandable DHTML List Example - Shows Expandable DHTML list

Maybe you are looking for

  • Round float to 2 decimal place in the table

    Hi, One field in a table in my DB has float datatype. I insert some data into this table. The value read from a textbox I input as 0.02 for example. after insertion, I select the table and the field of the table shows the number as 0.0199999995529652

  • Ipod video not showing up in itunes video playlist

    simple question, but couldn't find the answer anywhere. there is a video on my ipod that i didn't put there (i'm guessing it came with the ipod) that i would like to delete. HOWEVER it doesn't show up in itunes as being on my ipod. i can't find the v

  • Storage location not getting determine in Sales order

    Hello All, Storage location not getting determined in SO, every time when i update picking i have to manually enter the storage location. I saw few of the response in the SCN but one thing i noticed in my system was, when i enter OVLQ i don't see OR

  • Purge a process Instance

    Hi, I want to use the ProcessManager API to purge some specific long lived process Instances like this : pm.purgeProcessInstance(invocationID); But i didn't find a way to get the invocation ID of my process instance. I use the TaskManagerQueryService

  • Fireworks CS6 won't create editable PSD

    My version of Fireworks CS6 installed through the Creative Cloud will not save PNG files as PSD files that are editable in previous versions of Photoshop or other software that supports PSDs.  My new PS CC 2014 will open the file with layers and elem