KM Folders with Tree structure

Hi Experts,
I found 1 blog in SDN. It is tells how to create tree view with KM Folders using KM API.
https://www.sdn.sap.com/irj/sdn/weblogs?blog=/pub/wlg/1424. [original link is broken]
I am developing a custom application for uploading a file in multiple folders with single button click. Here I need tree structure and a check box option for selecting multiple folders. As default in tree view, I couldnot select multiple items. Is there any possible to achive this?.
Thanks in Advance,
Venkatesh

answered by thread "Modifiers in Collection List Renderer to display word wrapping"

Similar Messages

ALV with tree structure

hi gurus,
i want your help in developing alv, my requirement is output is
c1      c2      c3
r2c1   r2c2    r2c3
when user click on c1 which has a button to expand, it should expand like
c1       c2      c3
c11     c21     c31
c22     c22     c32
r2c1    r2c2    r2c3
can any body give me some sample
rewards for sure
Mandy

Hi Mittal and all,
thanks for reply, but i got solution
here is the modified code
*&                                            REPORT ZDEMO_TREE_LIST_ALV                     .
TABLES vbak.
TYPE-POOLS slis.
Data Declaration
TYPES: BEGIN OF t_vbak,
vbeln TYPE vbak-vbeln,
erdat TYPE vbak-erdat,
ernam TYPE vbak-ernam,
audat TYPE vbak-audat,
vbtyp TYPE vbak-vbtyp,
netwr TYPE vbak-netwr,
vkorg TYPE vbak-vkorg,
vkgrp TYPE vbak-vkgrp,
line_color(4) TYPE c,
END OF t_vbak.
DATA: it_vbak TYPE STANDARD TABLE OF t_vbak INITIAL SIZE 0,
wa_vbak TYPE t_vbak.
ALV Data Declaration
DATA: fldcat TYPE slis_t_fieldcat_alv WITH HEADER LINE,
gd_layout TYPE slis_layout_alv,
gd_repid TYPE sy-repid,
i_events TYPE slis_t_event,
it_sortinfo type slis_t_sortinfo_alv with header line,
w_events LIKE LINE OF i_events.
DATA: i_comment TYPE slis_t_listheader,
wa_comment TYPE slis_listheader.
START-OF-SELECTION.
PERFORM data_retrieval.
PERFORM bld_fldcat.
PERFORM it_sortinfo.
PERFORM bld_layout.
PERFORM call_events.
PERFORM display_alv_report.
Build Field Catalog for ALV Report
FORM bld_fldcat.
fldcat-fieldname = 'VBELN'.
fldcat-seltext_m = 'Sales Document'.
fldcat-col_pos = 0.
*FLDCAT-EMPHASIZE = 'C411'.
fldcat-outputlen = 20.
fldcat-key = 'X'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'ERDAT'.
fldcat-seltext_l = 'Record Date created'.
fldcat-col_pos = 1.
fldcat-key = 'X'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'ERNAM'.
fldcat-seltext_l = 'Cteated Object Person Name'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'AUDAT'.
fldcat-seltext_m = 'Document Date'.
fldcat-col_pos = 3.
fldcat-emphasize = 'C110'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'VBTYP'.
fldcat-seltext_l = 'SD Document category'.
fldcat-col_pos = 4.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'NETWR'.
fldcat-seltext_l = 'Net Value of the SO in Document Currency'.
fldcat-col_pos = 5.
fldcat-outputlen = 60.
fldcat-do_sum = 'X'.
fldcat-datatype = 'CURR'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'VKORG'.
fldcat-seltext_l = 'Sales Organization'.
fldcat-col_pos = 6.
APPEND fldcat TO fldcat.
CLEAR fldcat.
fldcat-fieldname = 'VKGRP'.
fldcat-seltext_m = 'Sales Group'.
fldcat-col_pos = 7.
fldcat-emphasize = 'C801'.
APPEND fldcat TO fldcat.
CLEAR fldcat.
ENDFORM. "BLD_FLDCAT
Build Layout for ALV Grid Report
FORM bld_layout.
gd_layout-no_input = 'X'.
gd_layout-colwidth_optimize = 'X'.
gd_layout-info_fieldname = 'LINE_COLOR'.
ENDFORM. "BLD_LAYOUT
Display report using ALV grid
FORM display_alv_report.
DATA t_event TYPE slis_t_event.
CALL FUNCTION 'REUSE_ALV_EVENTS_GET'
    EXPORTING
      i_list_type = 0
    IMPORTING
      et_events   = t_event.
IF sy-subrc <> 0.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
gd_repid = sy-repid.
PERFORM z_alv_grid_display TABLES it_vbak..
CALL FUNCTION 'REUSE_ALV_GRID_DISPLAY'
   EXPORTING
    i_callback_program = gd_repid
    is_layout = gd_layout
    it_events = i_events
    it_fieldcat = fldcat[]
I_INTERFACE_CHECK                 = ' '
I_BYPASSING_BUFFER                = ' '
I_BUFFER_ACTIVE                   = ' '
I_CALLBACK_PF_STATUS_SET          = ' '
I_CALLBACK_USER_COMMAND           = ' '
I_CALLBACK_TOP_OF_PAGE            = ' '
I_CALLBACK_HTML_TOP_OF_PAGE       = ' '
I_CALLBACK_HTML_END_OF_LIST       = ' '
I_STRUCTURE_NAME                  =
I_BACKGROUND_ID                   = ' '
I_GRID_TITLE                      =
I_GRID_SETTINGS                   =
IT_EXCLUDING                      =
IT_SPECIAL_GROUPS                 =
   IT_SORT                           = it_sortinfo[]
IT_FILTER                         =
IS_SEL_HIDE                       =
I_DEFAULT                         = 'X'
     I_SAVE                            = 'X'
IS_VARIANT                        =
IT_EVENT_EXIT                     =
IS_PRINT                          =
IS_REPREP_ID                      =
I_SCREEN_START_COLUMN             = 0
I_SCREEN_START_LINE               = 0
I_SCREEN_END_COLUMN               = 0
I_SCREEN_END_LINE                 = 0
IT_ALV_GRAPHICS                   =
IT_HYPERLINK                      =
IT_ADD_FIELDCAT                   =
IT_EXCEPT_QINFO                   =
I_HTML_HEIGHT_TOP                 =
I_HTML_HEIGHT_END                 =
    TABLES
      T_OUTTAB                          = IT_VBAK
EXCEPTIONS
PROGRAM_ERROR                     = 1
OTHERS                            = 2
IF SY-SUBRC <> 0.
    EXIT.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
        WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
ENDFORM. "DISPLAY_ALV_REPORT
Retrieve data from VBAK table and populate itab IT_VBAK
FORM data_retrieval.
DATA ld_color(1) TYPE c.
SELECT vbeln erdat ernam audat vbtyp netwr vkorg
UP TO 100 ROWS
FROM vbak
INTO TABLE it_vbak.
LOOP AT it_vbak INTO wa_vbak.
    ld_color = ld_color + 1.
    IF ld_color = 8.
      ld_color = 1.
    ENDIF.
    CONCATENATE 'C' ld_color '10' INTO wa_vbak-line_color.
    MODIFY it_vbak FROM wa_vbak.
ENDLOOP.
ENDFORM. "DATA_RETRIEVAL
*& Form CALL_EVENTS
text
FORM call_events.
CALL FUNCTION 'REUSE_ALV_EVENTS_GET'
EXPORTING
i_list_type = 0
IMPORTING
et_events = i_events
EXCEPTIONS
LIST_TYPE_WRONG = 1
OTHERS = 2
IF sy-subrc <> 0.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
IF NOT i_events[] IS INITIAL.
    READ TABLE i_events INTO w_events WITH KEY name = 'END_OF_LIST'.
    w_events-form = 'GENERATE_USERCOMMAND_FOOTER'.
    MODIFY i_events FROM w_events INDEX sy-tabix.
ENDIF.
ENDFORM. "CALL_EVENTS
*& Form GENERATE_USERCOMMAND_FOOTER
text
FORM generate_usercommand_footer.
CLEAR i_comment[].
wa_comment-typ = 'S'.
wa_comment-info = sy-pagno.
APPEND wa_comment TO i_comment.
CALL FUNCTION 'REUSE_ALV_COMMENTARY_WRITE'
EXPORTING
it_list_commentary = i_comment
I_LOGO = ''
i_end_of_list_grid = 'X'.
ENDFORM. "GENERATE_USERCOMMAND_FOOTER
*&      Form it_sortinfo
      text
--> p1        text
<-- p2        text
FORM it_sortinfo .
it_sortinfo-fieldname = 'ERNAM'.
it_sortinfo-tabname = 'IT_VBAK'.
it_sortinfo-subtot = 'X'.
it_sortinfo-obligatory = 'X'.
it_sortinfo-up = 'X'.
it_sortinfo-spos = '1'.
it_sortinfo-expa = 'X'.
append it_sortinfo.
ENDFORM.                    " it_sortinfo
reward point if u can.

How to draw a graph of tree structure (using shapes and lines)?

Hello,
I tried to search this solution in the forum, and I see people asking and replying with solutions to similar situation, but I don't get what I am looking for. Also because I have never tried with graphs before.
So, my problem is, I need a function that takes a string with tree structure, as in automata or tree graph, and displays the nodes in tree form. "Tree" is not important, but important is that each object should be displayed as a node and lines connecting them. Please see the image below (with three possible options):
So, basically, the tree structure could be like X(a, X(a,b), c) where X(a,b) is a sub-tree of higher level X. The program knows the parent-child relationship, so this function only needs to display those elements in a graphical fashion.
I pass the string in the form of a 2D array showing the hierarchy (to simplify).
In the image, I am showing three possible options for showing the tree. The third option eliminates those circles and rectangles, if that simplifies.
I hope I explained clearly.
Thanks ahead!
Vaibhav

I would start drawing from the top. The nodes will be the easy part.
Begin with the root node centered in the drawing area horizontally and against the top of the drawing area. The second row of nodes would be located vertically (as in my example) 1.5x pixels below the first one, and either distributed horizontally across the available drawing area or at a fixed distance - like 1.5x again, or someother distance you define.
The tricky part will be drawing the lines since they need run between the edges of nodes. This is where the high-school geometry might come in.
Keep us posted on what you come up with. Extra points for coming up with a solution that will automatically resize itself to fit the available drawing area! (I've already given you all the clues for how to do that too.)
Mike...
Certified Professional Instructor
Certified LabVIEW Architect
LabVIEW Champion
"... after all, He's not a tame lion..."
Be thinking ahead and mark your dance card for NI Week 2015 now: TS 6139 - Object Oriented First Steps

How to create a tree structure with check boxs using Windows Activex Control?

Hi,
I am very new to LabVIEW. I am trying to create a tree structure with Check Boxes like the below. It would be great if someone would show me a right direction to go forward.
The aim is to select the item and one by one i have to get the Path and give as an input to by application VI.
Thanks and Best Regards
Prathap

Hi Andy,
Sorry i pasted the Picture.. Pls find the attached picture.
Following are my requirement:
1) I need to populate a tree given a root directory, listing all the Folders and file of cetain pattern(*.pjt... ther will be only one *.pjt in every subfolders).
2) I need a check box for every *.pjt to select the its path. The list of pjt files selected are used for my automation test suit.
Pls let me know if you need more info.
Best Regards
Prathap
Attachments:
tree.JPG ‏73 KB

Tree Structure with Location & Designation

hi,
i need to populate a tree structure with Department & Job,
so that first level will show the department, 2nd level the designation and 3rd the employees(sorted)
select b.dname, a.job, a.empno, a.ename
from emp a, dept b
where a.deptno = b.deptno
order by 1,2,3
DNAME          JOB          EMPNO     ENAME
ACCOUNTING     CLERK          7934     MILLER
ACCOUNTING     MANAGER          7782     CLARK
ACCOUNTING     PRESIDENT     7839     KING
RESEARCH     ANALYST          7788     SCOTT
RESEARCH     ANALYST          7902     FORD
RESEARCH     CLERK          7369     SMITH
RESEARCH     CLERK          7876     ADAMS
RESEARCH     MANAGER          7566     JONES
SALES          CLERK          7900     JAMES
SALES          MANAGER          7698     BLAKE
SALES          SALESMAN     7499     ALLEN
SALES          SALESMAN     7521     WARD
SALES          SALESMAN     7654     MARTIN
SALES          SALESMAN     7844     TURNERThanks,
Noushad
Edited by: user517294 on Feb 27, 2010 7:01 PM

Or
SQL> with deptnos as (
select distinct dname, e.deptno from emp e, dept d where e.deptno=d.deptno order by e.deptno
jobs as (
select dname ||'/'|| max(job) over (partition by deptno order by job) hierarchy, deptno, job from (select distinct dname, e.deptno, job from emp e, deptnos d where e.deptno = d.deptno)
enames as
select e.deptno, j.hierarchy || '/' || max(ename) over (partition by e.job, e.deptno, ename order by hierarchy) hierarchy, ename from emp e, jobs j where e.job = j.job and e.deptno = j.deptno
select regexp_replace(hierarchy, '.*/', lpad('-',length(regexp_substr(hierarchy, '.*/')),'-')) hierarchy
from (select dname hierarchy from deptnos
        union all
        select hierarchy from jobs
        union all
        select hierarchy from enames
        order by 1)
HIERARCHY
ACCOUNTING
-----------CLERK
-----------------MILLER
-----------MANAGER
-------------------CLARK
-----------PRESIDENT
---------------------KING
RESEARCH
---------ANALYST
-----------------FORD
-----------------SCOTT
---------CLERK
---------------ADAMS
---------------SMITH
---------MANAGER
-----------------JONES
SALES
------CLERK
------------JAMES
------MANAGER
--------------BLAKE
------SALESMAN
---------------ALLEN
---------------MARTIN
---------------TURNER
---------------WARD
26 rows selected.

JPA - tree structure mapping    with toplink essential

I'll try to explain it correctly.
I store a tree structure in a database. I have just two tables:
Node which contain a id , and some other info.
Tree which contain a parent and child
parent and child are ids from node.
Since each node can have several childs, and each node can have several parents, I had try a @ManyToMany relationship without sucess.
Here one small example of my tries :
@Entity
@Table(name="node")
public class Node {
@Id private int id;
private List<Node> childs;
private List<Node> parents;
@ManyToMany
@JoinTable(name="Tree")
public List<Node> getParents(){
     return parents;
@ManyToMany(mappedBy="parents")
public List<Node> getChilds(){
     return childs;
}But I always got several error.
Anyone have a working example that look like mine ?
Even after googling for several hours I still find nothing.
If it helps, I use toplink essential for my persistance layer.

Please see http://www.oracle.com/technetwork/middleware/toplink/index-085257.html for information on TopLink JPA support.
So as of TopLink 11, you will need to use EclipseLink's org.eclipse.persistence.jpa.PersistenceProvider as the provider class for JPA support, which is in the eclipselink.jar.
Best Regards,
Chris

Tree structure with checkboxes and radio buttons

Hi,
I am using SNODETEXT as tree structure. On the child node, I need to have checkboxes and radio buttons. Is this possible?

Hi
Muse does not currently have dropdown lists, radio buttons, or checkboxes as part of the forms. You may want to check out using Adobe FormsCentral, Jotform, or Wufoo and inserting them via Object > Insert HTML as an alternative from the Muse forms, as those forms will have the lists, buttons, and checkboxes you're looking for.
Another way if you are publishing your site to Business Catalyst, then you can create forms in BC admin section and copy the form html in Muse page which will render the from that you have created in BC in your Muse site page.
More details :
http://helpx.adobe.com/business-catalyst/using/create-insert-form.html
Thanks,
Sanjit

I would like to know where the forum tree structure is so I can see what I'm doing and not be led around to irrelevant information.

I'm having trouble '''Finding''' the forum where I can look for the information I need. I keep ending up in '''endless menus of non-helpful information. '''
I got a popup message, I needed to upgrade to 3.6.17. After allowing it and rebooting, I couldn't start FF anymore, just got a crash report. I tried going to the restore point I had set with no luck and I tried creating a new profile. I lost all my bookmarks (only the Cache remained). And I sat in live chat for an hour waiting for help. German live chat had one helper and English live chat was closed.
So I gave up on help, uninstalled FF 3.6.17 and downloaded FF 3.6.15 and installed it. It loads but all bookmarks are gone. More importantly, now when I load the bookmarks, I can't '''retrieve''' them except by storing a new one. '''Only''' when I create a new bookmark can I see the folders I've created. I can't get to the organizer so I can't use the bookmarks to retrieve websites.
I'm disturbed that I can't get to the tree-structure forum where I can get the help I need. This "lead me around" labyrinth from one question to another, without being able to look through the forum for the information I need, is not helpful.
Thank you.
Foxhunt

I believe you just are able to delete them from iTunes.
Hope it will be helpful

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>

Tree Structure in Active Directory

Hi,
I am trying ot come up with a design of some sort if generic LDAP connector different LDAP servers. So far I have been just testing against Active Directory and OpenLDAP.
I know there are numerous implementations out there but the difference in features between these two itself have made the design difficult.
I had a question in regards to the way the data is organized in Active Directory as opposed to OpenLDAP.
In active directory you can have an
OU
CN {person}
CN{group}
Now users under different OU's can have access to other OU's I figure by belonging to the CN{group } under that OU . But the same user can't exists under two different OU's with the exact same attribute values. Is my understanding right??
Now when I used this OpenLDAP Windows version I could very easily create the same user under two different OU's.
Further on in Active Directory you have something called the objectGUID to get to the entry even if it is moved around in the tree casue at one point it can exists in only one place. Is this understanding right??
What happens in case of an OpenLDAP how do we get the unique id?
Please help

tigerkumar wrote:
HI
I am using swing on that JPanel
and
i got the drives of system in my combo box
can u tell me how to show selected drive`s folders in a tree structure
using JTree
how i can show the the directories(folder`s) of a drive into the JTree box
directory to be selected from ComboBox showing driveswhat is wrong with you?
why keep on multi-posting, I give you a solution and you ignore it.
http://forum.java.sun.com/thread.jspa?threadID=5217925&tstart=0
no one will help you if you keep on doing that.

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

OS Finder Tree Structure

I currently use the OS Finder structure that Peter Krogh of the DAM book suggests. Also use iView for cataloging. When you import digital files into iView it gives you a view of your Finder folder tree structure. You can manage the files in your local disks from the app. From this base you then create your virtual groupings (a al Aperture's albums, etc) For me, it is a very intuitive and functional design.
Just started using Aperture. I don't believe Aperture has any facility that offers view of your Finder tree structure when referencing files. Do you know of any discussions that talk about how plausible it is to expect this from Aperture? I really want to like Aperture, however, this is bordering on deal breaker for me. Lightroom has all but confirmed that this functionality will be part of their B5 or V1. I
I know it's speculation because no one will know for sure. However, I'm just trying to get up to speed on the topic if indeed it has come up before.
Thanks!

Thanks, Richard. The problem with this is after you import the folder as a project, it has no link to the original folder in your OS. So there will be no way to sync your Aperture folders with that of your OS (ie, no watched folders, etc). Moreover, I don't believe there is an easy way (or at all) to manage your OS tree structure via Aperture.

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

How to create HTML with tree stucture representation of xml

hi....in my application i have a xml and xslt ..i have to generate one html
that will display the xml which will have 2 display area one is for navigator and one view area
there will be a navigator which is display all the nodes with its hierrerchy
and when we click a node its all attribute value will be shown in a table
the look and feel will be same as below html where left display area denotes the nodes and the table represents the attributes of the node
http://www.free-dev.com/demo_invoice_9i.htm
can any body help me on that how i will do it?? any similar help link to proceed.....pls give me the suggesstion how i will proceed

You can do that in Java iteself. Using the logic of creating a tree structure dynamically. (If you dont want to make it as complex, check out web for creating tree structure )
In the below link an articles talks about creating tree structure using DOM in JAVASCRIPT.
http://www.google.co.in/search?hl=en&q=HTML+parser+in+vb6&meta=
If you want to enhance tree struc. try in dynamicdrive.com...

How to build a BIG TREE with Tree-Form layout

Hi,
I do have a self-referenced table with our org structure - 15 000 positions.
I do want to create a tree with this structure.
Requirements :
a, to have a tree-form layout
b, to have search capabilities
I have tried to use several combinations (maybe all)
- from using only one View object and create recursive tree - doesn't even run
- to use two View objects, first as top level nodes, the other as the rest - it runs
but I can search only top level, and what is worse, by clicking on the node for showing additional information (tree-form layout) I'm waiting for ages for seeing the info
(it seems that all records are loaded one by one into AS)
Could you provide some ideas how to deal with this ?
Thanks.

I am sorry, this is beyond the scope of this forum.
As with any functionality not directly provided by JHeadstart, you can build it yourself using the ADF design time tools in JDeveloper. Please use the JDeveloper forum for help on this first step.
Then, to keep your pages generatable you can move these customizations to custom templates. We are happy to help you with this last step, should you have problems there.
Steven Davelaar,
JHeadstart Team.

KM Folders with Tree structure

Similar Messages

Maybe you are looking for