Search help as tree

Dear all,
I need to develop a search help that shows all entries for a table in a tree. The user should be able to choose the disired value out of the tree presented.
Does anybody knew a FM that I can use as Search help EXIT in order to present the possible values in a tree?
Thanks all.
Regards,
MPM

Hi,
Please study this search help, there is a search help exit in which the hierarchy part it written,
Search Help: PRCTH
Search help exit: K_F4IF_SHLP_STANDARD_HIERARCHY
Hope this helps you,
Regards,
Abhijit G. Borkar

Similar Messages

Search help like tree structure.

Hi All,
I have a requirement to display the F4 search help like a tree structure , with different
Node(category fields ), under each node(category fields ) different work centers will exist.
Please suggest how I can achieve the tree format categories in search help.
Thanks for your cooperation.
Thanks,
Sri.

Hi Sri,
U can have a look at the search help PRCTH in se11, which has an search help exit K_F4IF_SHLP_STANDARD_HIERARCHY
just execute this and try to debugg it...
Hope this solves your problem...
please ack if helpful .
Best of luck !
Thanks,
Ravi Aswani
Edited by: Ravi Aswani on Mar 15, 2010 8:45 AM

F4 search help as tree structure in a module for one field

hi experts,
i have created a z module by copying standard module SAPMV23N of vbg1/2/3 transaction and i have added one tab in vbg1/2/3. the 5th tab is working. i am calling a subscreen using 5 tabstrip. there are one field MAKTL i want to use a F4 search as tree structure for that MAKTL field.
in code for displaying tree structure i am using function module RS_TREE***
please help me

Hi,
Please study this search help, there is a search help exit in which the hierarchy part it written,
Search Help: PRCTH
Search help exit: K_F4IF_SHLP_STANDARD_HIERARCHY
Hope this helps you,
Regards,
Abhijit G. Borkar

TREE NODE IN F4 SEARCH HELP

Hi All,
Can anyone help me to implement Tree node in F4 Search help?
Thanks
E Karthikeyan

SAP has provided a lot of sample programs for developing tree structures. Just go to SE38, type BCALVTREE and hit F4. You'll get different sample programs with a range of operations on trees
Go through the link,
http://www.sapdevelopment.co.uk/reporting/alv/alvtree.htm
Slowly check this code..you will get idea of how to develop tree structure.
REPORT y_hierarchies_in_tables
NO STANDARD PAGE HEADING.
PARAMETER: g_group TYPE grpname. " DEFAULT 'Z_GLAB0000'.
DATA:
g_setid TYPE setid,
g_class TYPE setclass.
DATA: lt_hier TYPE STANDARD TABLE OF sethier,
lt_val TYPE STANDARD TABLE OF setvalues.
DATA: hier LIKE sethier OCCURS 0 WITH HEADER LINE,
val LIKE setvalues OCCURS 0 WITH HEADER LINE,
setinfo LIKE setinfo OCCURS 0 WITH HEADER LINE.
DATA: zaccbas(20) TYPE c OCCURS 0 WITH HEADER LINE.
DATA: miss_val LIKE setvalues-from OCCURS 0 WITH HEADER LINE.
DATA: table_name TYPE tabname,
field_name TYPE setfld.
DATA: ambiguity_flag TYPE c.
Ambiguity check
PERFORM ambiguity_check.
Display Records
PERFORM display_records.
*& Form AMBIGUITY_CHECK
Ambiguity check
FORM ambiguity_check .
DATA: it_abaplist LIKE abaplist OCCURS 0 WITH HEADER LINE.
DATA: BEGIN OF it_ascilist OCCURS 0,
zeile(256) TYPE c,
END OF it_ascilist.
DATA: flag.
SUBMIT rgsovl00 "VIA SELECTION-SCREEN
WITH p_shrtn = g_group
WITH path = 'X'
EXPORTING LIST TO MEMORY
AND RETURN.
CALL FUNCTION 'LIST_FROM_MEMORY'
TABLES
listobject = it_abaplist
EXCEPTIONS
not_found = 1
OTHERS = 2.
CALL FUNCTION 'LIST_TO_ASCI'
TABLES
listasci = it_ascilist
listobject = it_abaplist
EXCEPTIONS
empty_list = 1
list_index_invalid = 2
OTHERS = 3 .
LOOP AT it_ascilist.
IF it_ascilist-zeile = text-001.
flag = 'X'.
ENDIF.
IF flag = 'X' AND
it_ascilist-zeile = text-002.
ambiguity_flag = 'X'.
CLEAR flag.
ENDIF.
ENDLOOP.
FREE MEMORY.
ENDFORM. " AMBIGUITY_CHECK
*& Form DISPLAY_RECORDS
Display the Records
FORM display_records .
PERFORM get_records.
PERFORM header_data.
PERFORM item_data.
ENDFORM. " DISPLAY_RECORDS
*& Form GET_RECORDS
Get all the Node values
FORM get_records .
Get the ID name for the Hierarchy
CALL FUNCTION 'G_SET_GET_ID_FROM_NAME'
EXPORTING
shortname = g_group
setclass = g_class
old_setid = g_setid
IMPORTING
new_setid = g_setid.
Get the Table and Field name for the Top Node
CALL FUNCTION 'G_SET_GET_INFO'
EXPORTING
setname = g_setid
no_set_title = 'X'
use_table_buffer = 'X'
IMPORTING
info = setinfo.
table_name = setinfo-tabname.
field_name = setinfo-fld.
Get all the Nodes for the Hierarchy
CALL FUNCTION 'G_SET_TREE_IMPORT'
EXPORTING
no_descriptions = ' '
no_rw_info = 'X'
setid = g_setid
TABLES
set_hierarchy = lt_hier
set_values = lt_val.
hier[] = lt_hier.
val[] = lt_val.
SELECT (field_name) FROM (table_name) INTO TABLE zaccbas.
LOOP AT zaccbas.
READ TABLE val WITH KEY FROM = zaccbas.
IF sy-subrc = 0.
DELETE zaccbas.
CLEAR zaccbas.
DELETE val INDEX sy-tabix.
CLEAR val.
ENDIF.
ENDLOOP.
ENDFORM. " GET_RECORDS
*& Form HEADER_DATA
Header Data
FORM header_data .
DATA: desc TYPE settext.
READ TABLE hier WITH KEY fieldname = field_name
shortname = g_group.
IF sy-subrc = 0.
desc = hier-descript.
ENDIF.
SKIP.
WRITE: 'Node :',g_group.
WRITE:75 'User name :', sy-uname.
WRITE:/ 'Description :', desc.
WRITE:75 'Date:', sy-datum.
WRITE:/ 'Table Name :' , table_name.
WRITE:75 'Time:', sy-timlo.
WRITE:/ 'Field Name :', field_name.
write:75 'Client:', SY-MANDT.
skip.
IF ambiguity_flag = 'X'.
WRITE:/ 'Ambiguity Check :'. WRITE: 'Success' COLOR 5.
ELSE.
WRITE:/ 'Ambiguity Check :'. WRITE: 'Failed' COLOR 6 .
ENDIF.
WRITE:/ sy-uline.
WRITE:/37 'Validation for Hierarchy'.
WRITE:/ sy-uline.
ENDFORM. " HEADER_DATA
*& Form ITEM_DATA
Output Report for Nodes
FORM item_data .
IF NOT zaccbas[] IS INITIAL.
WRITE:/ 'Missing Records from Hierarchy' COLOR 3.
LOOP AT zaccbas.
WRITE:/ zaccbas.
ENDLOOP.
ENDIF.
IF NOT val[] IS INITIAL.
SKIP 1.
WRITE:/ 'Additional Records in Hierarchy' COLOR 3.
LOOP AT val.
WRITE:/ val-from. ", 28 val-DESCRIPT.
ENDLOOP.
ELSEIF ZACCBAS[] IS INITIAL.
WRITE:/ 'No Missing Records Found' COLOR 3.
ENDIF.
ENDFORM. " ITEM_DATA
Thanks,
Sakthi C
*Rewards if useful*

Search Help with Structure Display

Hi,
I want to create a search help which should display my output in the structure format base on the different levels.
I have already written a test program which display all the values in proper structure format. But I wanna do the same in the search help. It has to display the output in the structure format.
Please guide me how to achieve this.
Thanks,
Karthik

hello,
you could write additional report based on ALV tree. So you would have the stucture which you want to have and on value request call your custom program. i doubt that there is FM or class which could generate search help tree. So basically you have to write your own logic. Or you could use GuiXt tool. Example and tutorial.
http://www.synactive.com/tutor_e/lessonco00.html
br,
dez_

Organizational Structure Search Help in Webdynpro ABAP

Hi,
I need an organizational structure search help in webdynpro abap.
It should list the organizational structure in tree view like RH_OBJID_REQUEST lists.
I tried to use RH_OBJID_REQUEST function in webdynpro but I got " A RAISE statement in the program
"CL_GUI_CUSTOM_CONTAINER=======CP" raised theexception condition "CNTL_ERROR" short dump.
Is there such a function for webdynpro abap and how can I achive this with select options?
Thanks in advance..
MERAL

Great article. I also had this probelm a year ago. My problems questions are:
Is it possible to select more then one entry in the tree?
What about selecting all childrens with one click?
In my solution I inserted this tree, into a table and the table had a checkbox, row, so the user can check the required org units, (more then one) and there was a separate button, for "select all children"

Problem in including search help exit for MM03 transaction.

Hi,
i am trying to include search help for MM03 trasaction based on MATKL(material group) WGBEZ (description) in the form of alv tree display.
Fuctionality i want to achive is :
1. after pressing F4 on MM03, it prompts to select material group screen, on pressing F4 on material group, now i am able to get the ALV tree display of all the materials and description based on the selection screen criterion.
2. now, after selecting one material group from ALV screen, i am able to map the corresponding value on the material group on the previous(intermediate) screen, but after pressing enter on this screen, i need to get the corresponding material to be mapped on the MM03 transaction, which i am unable to get.
when i press enter, it is again going to ALV tree display only and values arent getting refreshed.
Please help me in solving this.

Hi joydeep mazumder ,
This is the work of the ABAPer, pls ask them to do it.
Anyway here is the way ...
You can use append search help to add a new search help to an existing standard sap search help..
Pls have a look at this....
http://help.sap.com/saphelp_nw70/helpdata/en/4c/ab0d79e5ce11d295f900a0c929b3c3/content.htm
Regards,
Vvieks

Error in search help AEN_TREX_SIMPLE and AEN_TREX_ADVANCED

Hi.
i've created and activated the index for business object ECM in SES_ADMIN.
It was fully indexed.
When i search on TREX side it seems that the index is okay.
But when i try to search in CC03 with the TREX search help i get no results from TREX.
The report COM_SE_SEARCH_TEST shows me results, but the report COM_SE_SEARCH_TEST
show me nothing.
Am i missing something ?
Thanks.
Sebastian

The difference is that the test program COM_SE_SEARCH_IIF_TEST uses the official SES search interface method CL_COM_SE_SEARCH_IIF=>SEARCH_OBJECTS, whereas the test program COM_SE_SEARCH_TEST directly accesses the native TREX search interface, function module TREX_EXT_SEARCH_DOCUMENTS (which you are not allowed to use in customer development).
Therefore COM_SE_SEARCH_TEST does not include the authorization check, whereas
CL_COM_SE_SEARCH_IIF=>SEARCH_OBJECTS passes the raw search result from TREX to the object-specific authorization check routine. This check routine has to be implemented by the responsible application using interface method IF_COM_SE_BUSOBJ~CHECK_AUTHORIZATION.
The implementing class can be found/set in customizing:
Transaction SES_ADMIN, menu path: Goto -> Customizing -> Business Objects and Indexes
On the screen "Display View ..." double-click in the tree to the left on: Settings for Business Objects
So I guess:
- either the obect-specific implementation of ~CHECK_AUTHORIZATION is erroneous
- or the logon user is just not authorized
For more and general information you should check the SAP notes
1254901 - SES for customer projects on TREX search
1345777 - FAQs Search Engine Service (SES)
Enjoy! - Klaus

How to display Hierarchy in WDA Search help

Hello Experts,
Please let me know if i can display hierarchy (tree like structure) in WD ABAP search help,i am quite new to WD ABAP.
Any suggestions and inputs would be very helpful.
Thanks & Regards,
Siddharth

I think tree UI element will be useful to you. Pls refer following links for more help:
[Link1|http://help.sap.com/saphelp_nw70/helpdata/en/21/ad884118aa1709e10000000a155106/content.htm]
[Link2|http://help.sap.com/saphelp_nw70/helpdata/en/59/a98b411fb4b05fe10000000a1550b0/frameset.htm]
[Link3|http://help.sap.com/saphelp_nw70/helpdata/en/5a/088b41b4b3b25fe10000000a1550b0/frameset.htm]
I had similar requirement of search help in my project. I had created component with tree ui element and called it using component usage in another component on click of button. I hope this will help you.
Regards,
Saket.

Search Help Implementation in Webdynpro

Hello
In my project there is a situation where a table is present which will be populated with data coming from different BAPI.
If I need to add a new row for this table , For the First column I need to have a search help capability . The search help capability should be in such a way that I need to show the Search help in a Table format which has one Master Column ( I.e. tree inside a table ) .
Please can any one suggest me how to go about it.
Thanks,
V Vinay

Vinay,
There is no way to alter OVS (Search Help) functionality in WebDynpro for Java.
Instead you may use pair of InputField + (Button|LinkToAction) and navigate to your own custom view. Here you may use Table with Master column.
VS

Enhance search help MAT1_TREX_SIMPLE

Hello.
i want to enhance the SES F4 standard search help MAT1_TREX_SIMPLE by MARA-MSTAE and MARC -MMSTA.
These 2 fields should show up in the result list of F4 help MAT1_TREX_SIMPLE.
I had read the sap ses documentation and several blogs and tutorials.
But i don't know where to start and if this requirement is possible.
Do you have any ideas ?
Thanks in advance.
Sebastian

The difference is that the test program COM_SE_SEARCH_IIF_TEST uses the official SES search interface method CL_COM_SE_SEARCH_IIF=>SEARCH_OBJECTS, whereas the test program COM_SE_SEARCH_TEST directly accesses the native TREX search interface, function module TREX_EXT_SEARCH_DOCUMENTS (which you are not allowed to use in customer development).
Therefore COM_SE_SEARCH_TEST does not include the authorization check, whereas
CL_COM_SE_SEARCH_IIF=>SEARCH_OBJECTS passes the raw search result from TREX to the object-specific authorization check routine. This check routine has to be implemented by the responsible application using interface method IF_COM_SE_BUSOBJ~CHECK_AUTHORIZATION.
The implementing class can be found/set in customizing:
Transaction SES_ADMIN, menu path: Goto -> Customizing -> Business Objects and Indexes
On the screen "Display View ..." double-click in the tree to the left on: Settings for Business Objects
So I guess:
- either the obect-specific implementation of ~CHECK_AUTHORIZATION is erroneous
- or the logon user is just not authorized
For more and general information you should check the SAP notes
1254901 - SES for customer projects on TREX search
1345777 - FAQs Search Engine Service (SES)
Enjoy! - Klaus

How to extend breadth first Search for Binary Tree to any kind of Tree??

Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ie each node has more than 2 leaves such as 1, 2,3,4 or any,
I have following code to successfully apply for breadth first Search in Binary Tree as follows,
package a.border;
import java.util.ArrayList;
import java.util.LinkedList;
public class Tree
    int root;
    Tree left;
    Tree right;
    static ArrayList<Integer> list = new ArrayList<Integer>();
    static ArrayList<Tree> treeList = new ArrayList<Tree>();
    private static LinkedList<Tree> queue = new LinkedList<Tree>();
     * @param root root value
     * @param left left node
     * @param right right node
    public Tree(int root, Tree left, Tree right)
        this.root = root;
        this.left = left;
        this.right = right;
    /** Creates a new instance of Tree
     * You really should know what this does...
     * @param root
    public Tree(int root)
        this.root = root;
        this.left = null;
        this.right = null;
     * Simply runs a basic left then right traversal.
    public void basicTraversal()
        //Check if we can go left
        if (left != null)
            left.basicTraversal();
        //Add the root
        list.add(root);
        //Check if we can go right
        if (right != null)
            right.basicTraversal();
    public ArrayList<Integer> getBreadthTraversal(ArrayList<Integer> list)
        //Add the root to the arraylist, we know it is always the first entry.
        list.add(root);
        //Basically we add the first set of nodes into the queue for
        //traversing.
        //Query if left exists
        if (left != null)
            //Then add the node into the tree for traversing later
            queue.add(left);
        //Same for right
        if (right != null)
            queue.add(right);
        //Then we call the traverse method to do the rest of the work
        return traverse(list);
    private ArrayList<Integer> traverse(ArrayList<Integer> list)
        //Keep traversing until we run out of people
        while (!queue.isEmpty())
            Tree p = queue.remove();
            //Check if it has any subnodes
            if (p.left != null)
                //Add the subnode to the back of the queue
                queue.add(p.left);
            //Same for left
            if (p.right != null)
                //Same here, no queue jumping!
                queue.add(p.right);
            //Append to the ArrayList
            list.add(p.root);
        //And return
        return list;
     * Makes a tree and runs some operations
     * @param args
    public static void main(String[] args)
         *                             4
         *          t =           2       6
         *                      1   3    5   7
        Tree leaf6 = new Tree(1);
        Tree leaf7 = new Tree(3);
        Tree leaf8 = new Tree(5);
        Tree leaf9 = new Tree(7);
        Tree t4 = new Tree(2, leaf6, leaf7);
        Tree t5 = new Tree(6, leaf8, leaf9);
        Tree t = new Tree(4, t4, t5);
        t.basicTraversal();
        System.out.println("Here is basicTraversal ="+list.toString());
        list.clear();
        t.getBreadthTraversal(list);
        System.out.println("getBreadthTraversal= " +list.toString());
        list.clear();
    }Can Guru help how to update to any kind of tree??
here this code is for the tree like:
         *                             4
         *          t =           2       6
         *                      1   3    5   7
         */But i hope the new code can handle tree like:
         *                             4
         *                           /   | \
         *                          /     |   \
         *          t =            2     8   6
         *                        / | \    |    /| \
         *                      1 11 3 9   5 10 7
         */Thanks

sunnymanman wrote:
Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ...The answer is interfaces.
What do all trees have in common? And what do all nodes in trees have in common?
At least these things:
interface Tree<T> {
    Node<T> getRoot();
interface Node<T> {
    T getData();
    List<Node<T>> getChildren();
}Now write concrete classes implementing these interfaces. Let's start with a binary tree (nodes should have comparable items) and an n-tree:
class BinaryTree<T extends Comparable<T>> implements Tree<T> {
    protected BTNode<T> root;
    public Node<T> getRoot() {
        return root;
class BTNode<T> implements Node<T> {
    private T data;
    private Node<T> left, right;
    public List<Node<T>> getChildren() {
        List<Node<T>> children = new ArrayList<Node<T>>();
        children.add(left);
        children.add(right);
        return children;
    public T getData() {
        return data;
class NTree<T> implements Tree<T> {
    private NTNode<T> root;
    public Node<T> getRoot() {
        return root;
class NTNode<T> implements Node<T> {
    private T data;
    private List<Node<T>> children;
    public List<Node<T>> getChildren() {
        return children;
    public T getData() {
        return data;
}Now with these classes, you can wite a more generic traversal class. Of course, every traversal class (breath first, depth first) will also have something in common: they return a "path" of nodes (if the 'goal' node/data is found). So, you can write an interface like this:
interface Traverser<T> {
    List<Node<T>> traverse(T goal, Tree<T> tree);
}And finally write an implementation for it:
class BreathFirst<T> implements Traverser<T> {
    public List<Node<T>> traverse(T goal, Tree<T> tree) {
        Node<T> start = tree.getRoot();
        List<Node<T>> children = start.getChildren();
        // your algorithm here
        return null; // return your traversal
}... which can be used to traverse any tree! Here's a small demo of how to use it:
public class Test {
    public static void main(String[] args) {
        Tree<Integer> binTree = new BinaryTree<Integer>();
        // populate your binTree
        Tree<Integer> nTree = new NTree<Integer>();
        // populate your nTree
        Traverser<Integer> bfTraverser = new BreathFirst<Integer>();
        // Look for integer 6 in binTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, binTree));
        // Look for integer 6 in nTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, nTree));
}Good luck!

Search Help Exfit for Material

Hi,
Scenario:
in the F4 dropdown for material, I have added a new elementary search help which will search a laterial based on material description(makt-maktx)/basic material(mara-wrkst)/size & dimension(mara-groes).
Requirement:
I need to add one more field in my search help "Global Search". In this field whatever has been entered has to be searched in all the tree fields mentioned above. For eg.
If i enter "valve" in my global search field, then 'valve' should be searched in makt-maktx & mara-wrkst & mara-groes and should give me the total result.
Solution Lead:
I created a search help exit and inside that I found out that I have to write my code under:
IF CALLCONTROL-STEP = 'SELECT'.
Now Im not able to figure out how to write the code inside IF CALLCONTROL-STEP = 'SELECT'.
Please help.
Regards,
Shobhit

Hi!
Say you've define input parameter PARAM for your search help. Then you should proceed as follows:
IF callcontrol-step = 'SELECT'.
    DATA:
      param_val TYPE ddshiface-value.
    CALL FUNCTION 'F4UT_PARAMETER_VALUE_GET'
      EXPORTING
        parameter               = 'PARAM'
      OFF_RESULT              = 0
      LEN_RESULT              = 0
      FIELDNAME               = ' '
     IMPORTING
       value                   = param_val
      TABLES
        shlp_tab                = shlp_tab
        record_tab              = record_tab
      SELOPT_TAB              =
      RESULTS_TAB             =
      CHANGING
        shlp                    = shlp
        callcontrol             = callcontrol
     EXCEPTIONS
       parameter_unknown       = 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.
    DATA:
      it_hitlist TYPE STANDARD TABLE OF z_your_hitlist_structure.
    IF param_val IS INITIAL.
*TODO: fill it_hitlist correspondingly
    ELSE.
*TODO: fill it_hitlist correspondingly too
    ENDIF.
    IF sy-subrc = 0.
      callcontrol-step = 'DISP'.
    ELSE.
      callcontrol-step = 'EXIT'.
    ENDIF.
    CALL FUNCTION 'F4UT_RESULTS_MAP'
    EXPORTING
      SOURCE_STRUCTURE         =
      APPLY_RESTRICTIONS       = ' '
      TABLES
        shlp_tab                 = shlp_tab
        record_tab               = record_tab
        source_tab               = it_hitlist
      CHANGING
        shlp                     = shlp
        callcontrol              = callcontrol
     EXCEPTIONS
       illegal_structure        = 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.
ENDIF.
Regards,
Maxim.

Search help for org units

Hi,
I'm looking for a tree search help for org units without organisational controls.
Actually I'm using the search help 'RH_TYPE_STRUC_HELP' but the units are only the units directed by the user. For one of the specific infotype, I need to let the user select an unit that is not in his own structure... to save an information like "I don't want to work here".
Have you got some function that can help me ??
Thanks,
Christophe.

Hi
I want to know only the parent org units existed at company code level or Personnel area level for the position search hlep and not the org units and positions relationship

F4 search help is not getting displayed in WAD

Hi all,
For a certain InfoObject we want to add an attribute in the F4-search help. The additional attribute does appear when executing the query in the Bex Analyzer but not on the Web. Can anyone tell me how to achieve this in WAD?
Thanks in Advance

Hi all,
For a certain InfoObject we want to add an attribute in the F4-search help. The additional attribute does appear when executing the query in the Bex Analyzer but not on the Web. Can anyone tell me how to achieve this in WAD?
Thanks in Advance

Search help as tree

Similar Messages

Maybe you are looking for