Naviagation using woodstock tree

I am developing a jsf application and I am using netbeans with woodstock components. I used tabs for top most navigation. I want a left-right navigation using tree. The tab component works fine for navigation since it displays different views on click. But it is not possible to do the same thing using tree component. I want to develop content pages individually and integrate them in my application when a node on the tree is clicked. Is that possible? If not what is the best way to handle a left right naviagation using the visual jsf framework?

The problem seems to be the Application Item that lives on the Tree page. The help for this attribute is as follows:
"This attribute identifies an application or page item which specifies the starting point of the tree (the first node). The query which defines the tree identifies a starting position. The value of this item should equal the primary key of the tree.
The parent of the first node is typically zero or null. If it is another value then an up link displays to facilitate drilling up."
When I created the tree I used an item on the page for this attribute, P74_TICKET_ID. Now when I try to use this tree on another page, it still points to the original Application Item from the original page. If I change this item to point to a value on the new page, P80_TICKET_ID, the tree works fine on the new page, but now the original page no longer works because it is now points to the new page Application Item.
I would basically like the tree to use P74_TICKET_ID as the starting point on one page and P80_TICKET_ID on another page, but the tree will ony point to one or the other.

Similar Messages

How do I enable the button to use the tree list in excel? (Enable the list type: Tree enabled in Office 2013 - VSTF 2013)

Hi, I was looking to see if anyone knows how I can troubleshoot my connection problem with TFS view in excel. I'm trying to produce a tree view in Office 2013 as described in the following KB -
https://msdn.microsoft.com/en-us/library/dd286627.aspx
I have followed the instructions on the KB all the way up to : 'Add backlog items and tasks and their parent-child links using a tree list' and at this point I can't seem to get it to work as the button is greyed out.
Note that I have completed steps 1-6 for the previous procedure... all 6 steps work just fine. However on step 2 of the second procedure - the instructions state I should be able to 'Add Tree Level' - However the button is greyed out.
Anyone know what I need to do to enable the button to use the tree list in excel?
Frank

Frank,
I believe your issue is that you have opened a Flat query and are trying to add tree levels. A flat query is just that and you cannot change the query type from Excel.
The second process is managing a backlog (which is a tree). TFS web access has a link on the backlog view to create a query. That query will be a "tree of work items" query that returns the items in the backlog including their parent-child relationships.
This type of query supports the Add Tree Level and Add Child functionality as does a new Input List (not bound to an existing query).
"You will find a fortune, though it will not be the one you seek." -
Blind Seer, O Brother Where Art Thou
Please Mark posts as answers or helpful so that others may find the fortune they seek.

Is timesten still using T-tree as data structure?

I just come across this paper - http://www.memdb.com/paper.pdf , this researcher do some experiments and showing that using concurrent B-tree algorithm is actually faster than T-tree operation. How do you think about this paper? Do you think actually he is using a inefficient algorithm to access T-tree? Or, Timesten already know the limitation of T-tree and have changed the internal data-structure?

Yes, we are aware of the comparisons between T-Trees, concurrent B-trees etc. At the moment TimesTen still uses T-trees but this may change in the future :-)
Chris

Can I use Hierarchical Tree from Forms6.0 in Forms5.0

Hello
The Oracle Custumer Support tell me that it should be possible to
use Hierarchical Trees also in Forms5.0
I look for a possibility to build a Navigator in Forms5.0
with Symbols. (look and feel like the Navigator in Forms6.0 if I
use Symbols in the Record Group).
I Description should be on
http://developer.us.oracle.com
but either i have no access to this side or
the URL is false.
Sure is that there is a description over this Problem.
And i have to get this description ;-)))
Thanks for Help
JK
null

That is not recommended. The new code editing features do not play well with an old workspace.
Please create a new workspace and import your projects into that.
-Anirudh

Cannot expand tree nodes using t:tree tag

Hi, I have a question.
I am a beginner of JSF. I am trying to deploy a very simple tree using <t:tree> in my local tomcat server, similar to the following one:
http://www.irian.at/myfaces/tree.jsf
The result is that the tree is properly displayed, but I cannot expand the nodes when I click on the "+" icon of the nodes.
Can someone help me? Thanks a lot!

Take a look at Lilya Jsf Widgets and Ajax Capabilities at http://qlogic.ma/lilya
the new era of technology

Using hierarchical tree in developer 10g

Hi all
how can we use hierarchical tree in developer 10g any white paper will be helpfull
thanks

Hello
<p>Here is a first sample<br>You could probably find others on this forum or by Googling<p>
Francois

How to call forms using Hierarchical Tree in Forms 10g?

I know how to call forms from menu that attached to a top form.
I would like to call forms using Hierarchical Tree. Does any one know how where I can find some instructions on using Hierarcical Tree to call other forms? Any discussion is welcome. Thanks.

Thanks to Francois.
The exampe with clear instructions and I can build tree that calls forms now.
I add a OPEN_FORM statement in WHEN-TREE-NODE-ACTIVATED trigger
Declare
     LN$I Pls_integer ;
Begin
:Ctrl.Node_Activated := Ftree.Get_Tree_Node_Property('BL_TREE.MENU', :SYSTEM.TRIGGER_NODE, Ftree.NODE_VALUE) ;
If :Ctrl.Node_Activated IS NOT NULL Then
     Set_Alert_Property( 'AL_CALL_FORM', ALERT_MESSAGE_TEXT, 'Calling module : ' || :Ctrl.Node_Activated ) ;
     LN$I := Show_Alert( 'AL_CALL_FORM' ) ;
     open_form(:Ctrl.Node_Activated);
End if ;
End ;
Or call physical form path by:
     open_form('c:\tree\'||:Ctrl.Node_Activated ||'.fmx');
I enter the VALUE of MENU as the Form fmx name and it works very well.
Thanks so much.

Using the tree table ui pdf has this problem

hai all,when i used the tree table UI(pdf in sdn) my checkboxes are not enabled at runtime
Thanks n Regards
Sharanya.R

hai all,
how to make the checkbox enabled at runtime when i use this tree in table UI.
Thanks n Regards
Sharanya.R
Edited by: Shivani on Mar 3, 2008 1:12 PM
Edited by: Shivani on Mar 3, 2008 1:15 PM

Develop MDM Heirarchy table using Webdynpro Tree

Hi
Can anyone let me know how i can build a MDM Heirarchy table using webdynpro tree.
Thanks

Can you be more specific? Is your problem with MDM or Web Dynpro? And what do you mean by "build an MDM Hierarchy Table"?
Walter

Why i cannot use Fenêtres des disponibiltés on iCal ?

I'm not able to use "Fenêtre des disponibiltés" fonction in iCal

Because they do not belong to you and you have no legal right to them.
Apps are tied to the itunes account from which they are purchased.

Trying to use netui:tree

          Hi,
          I am trying to use netui:tree tag.The help/documentation provided does not specify
          what kind of value should be provided to datasource? Is there a good example where
          I can find how use the tag effectively?
          Thanks,
          Preeti Joshi


If you log in at www.verizon.net and go to my services and manage all - you can see if it's on your account.
if it's giving a busy like that - then I am pretty sure it's not on your account, and you can add it there, or call into -800 VERIZON

Folder Chooser reference (which uses a tree for selection)

is there a recommendation for a folder chooser which uses a tree for selection? all i've found so far are either:
* 3rd party folder choosers
* the file open dialog box of java where you use setFileSelectionMode( JFileChooser.DIRECTORIES_ONLY);
i can't believe there is currently no folder chooser which uses a tree for selection in standard java. so probably i didn't find it. before i write my own, i thought i'd ask.
thanks for the help!

No, it doesn't exist in the standard Java API. What's wrong with third party solutions, especially when some of them are open source? Google found quite a few.
db

Use a tree or a list or something else?

Hello all...I need to create a sort of "family tree". I'm given a String[] where each entry will either be of the form "child parent" or "person gender". If its in the form "child parent" I know that the family tree has child as a child of parent. If its in the form "person gender", I know what that persons gender is. I need to go through this array of strings making sure that each child has at most two parents which must be of the opposite sex, and that no child is its own descendant (eg. If Bob is a child of Sue who is a child of Joe, Joe better not be a child of Bob). What I need to report is the index of the String[] where this fails.
Hopefully that's a clear explanation.
Here's an example:
{"BOB JOHN","BOB MARY","MARY JOHN","JOHN f","MARY f","AL f"}
Returns: 4
The first 4 elements are considered consistent. They describe that BOB's 2 parents are JOHN and MARY and that (unconventionally) MARY is JOHN's child. JOHN is female. But "MARY f" is inconsistent with this since that makes both of BOB's parents female.My first thought was to store this as a Tree but since a parent can have lots of children and a child can have two parents and I may be adding parents before I know their genders and then having to go through and modify things. It seems too complex. Then I thought to store it as an arraylist. But I still run into problems where if I modify things I have to search through many different places to make sure I reflect it everywhere and everything still holds true.
What do you guys think? I can post some other examples if its still unclear

You should probably approach this problem by breaking it down into some general processing steps. As an example, you probably can't check for required conditions - like gender, parentage, etc - until you have processed the whole set of input. That suggests you will have at least two stages:
Build up structures.
Do the condition checking.
What kinds of structures would you use to do the condition checking?
Hint: Just one structure probably isn't going to hack it.
Hint: For starters, yoou probably need a list of persons.
Hint: Each person should have a gender.
Hint: You need to be able to check for parents of each person.
Hint: You need to check for circles in the parenting.

Right way to build / use quad tree?

Hi, the quadtree data stucture seems so simple, and fits alot of problems, but coding it properly is a problem.
The purpose of the tree is to find which objects are with in a visible area.
So each node has dimensions x,y,width, height. And child a,b,c,d. Plus a object list.
The main method to build the tree is the nodeSplit(), which needs to find the mid points on each edge and the center point, and create the child nodes, continuing to split until a min size is reached.
Sounds simple, its just not working for me!
The other part of the question is how should each node hold the objects in its bounds. Should an object be only in the smallest node that contains it. Or should the root node contain all objects, with each level having less and less objects?
Objects will move around, so should each node contain a int[] of object indexes, instead of the actual objects?
Id really appreciate any help!
Thanks, Harley.

Sounds simple, its just not working for me!Can you post your code?
The other part of the question is how should each node hold the objects in its boundsI wouldn't use either of your suggestions. Instead, I'd have separate rules for a leaf node and a branch node. A leaf node holds any object it overlaps. A branch node holds objects which contain it but don't contain its parent.
Objects will move around, so should each node contain a int[] of object indexes, instead of the actual objects?Of course not. You're storing a reference to the object, which takes up the same amount of memory as an int. And I'd use a Set rather than an array.

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>

Naviagation using woodstock tree

Similar Messages

Maybe you are looking for