Searc help in entry help/Check tab vs Search help in Further Char-Data elem

Folks,
I have a screen field which is linked to a structure.When I look at that structure's entry help/check tab in se11 this field is having a collective search help.Now I want this to be replaced by a Z search help.
If my understanding is right I need access key for this structure so that I can link the z search help in entry help/check tab against this field.
My query is whic is the right way
1.Linking the z search help in the entry help/check tab against that field in the structure at SE11 level
    or
    Linking the Z search help in Further Characterisitics tab of the data element used by this field.
Either way the search help will be reflected at all the places wherever this field is available in the screen.Am I right ?
or
2. Linking the search help to a data element is different from linking the seach help to the field in that structure in entry help/check tab ? If they differ how do they differ.Kindly let me know
Thanks,
K.Kiran.

Not true.
Search help assigned at data element level is independent of that assigned at structure level, and the latter has higher priority. Please read "Input Help Hierarchy in the ABAP Dictionary":
http://help.sap.com/saphelp_470/helpdata/en/9f/dbaa5435c111d1829f0000e829fbfe/content.htm
The structure level assignment can (and generally is) linked to more than one field, not only the one that triggers the search help. That depends on the search help importing and exporting parameters. The data element assignment can only affect the field in which it is used.
Nevertheless, even the search help defined at structure level could be overriden in the program (e.g. PARAMETERS...MATCHCODE OBJECT, AT SELECTION-SCREEN ON VALUE-REQUEST, PROCESS ON VALUE-REQUEST, etc). If that is not your case, it's the structure assignment that you want to change (have into account that it will affect any other dynpros which use that structure).

Similar Messages

  • Check box in search help

    Hi Experts,
    I have created one custom table. there is one field called zflag ( TYPE C - length 1). This field will contains values either 'R' or ' '.
    I have one module pool program. In that I have field called doc number. As soon ad user press F4 on doc number field, search help will displayed.
    field zflag is added to that serach help and it is working fine.
    But user wants show this field as check box in search help.
    Could you pls help me how to place check box in place of text field.
    Thanks in advance
    Regards
    Raghu
    Edited by: r badveli on Feb 17, 2009 10:38 PM

    Anyone has any idea about this?
    As soon as I press F4 on document no field, It will display one pop-up window with search help restrictions.
    In the search help restrictions ... I have added one flag field . But we nedd that text field as check box.
    How can we acheive this?
    Thanks.

  • Sorry - Could you please help me how can I achieve this Search help ?

    I am creating search help for the profit_center field,
    For the search help :
    The scenario is I have three Z-tables.
    Example: The Data in tables are as shown below ( where F1, F2 are the fields ).
    Ztable1
    F1
    A
    B
    C
    D
    Ztable2
    F1 F2
    A 1
    A 2
    B 112
    B 113
    C 34
    D 43
    D 55
    D 87
    Ztable3
    PRCTR F1 F2
    123 A 1
    124 A 2
    123 B 112
    124 B 113
    125 C 34
    123 D 43
    124 D 43
    125 D 43
    I need to create search help (Search Help is similar to Collective Search Help) for the field PRCTR of table Ztable3 like as below.
    By pressing F4 on the field, a pop up should appear which should contains text labels& text fields on TAB-Screen ( A, B, C , D as shown below as text lables )against which text fields should appear.
    TAB-Screen :
    A ____________
    B ____________
    C ____________
    D ____________
    If F4 is pressed on I/O field (text fields) against A in the above TAB-Screen, Corresponding values ztable2-F2 of A from ztable2 ( = 1, 2 ) should appear as F4 help.
    so that user can select ...
    Is it possible to acieve this ? It would be a great help ....How can I achieve this ?
    Finally based on above user selections say
    A ____________
    B ____________
    C ____________
    D ____________
    corresponding prctr values should be collected.

    <b>You can acheive   this .... first by creating the search help exit    ... by  creating the maintaince  view   then   using it in the   Creation of the search help </b> ...
    see the link for attaching the view   to the serach help .
    <a href="http://">http://www.sapdevelopment.co.uk/dictionary/shelp/shelp_elementary.htm</a>
    reward  points if it is usefull...
    Girish

  • Search help for Web Dynpro using the SAP-search help

    Hi,
    I’m trying to create a generic search help for Web Dynpro using the SAP-search help. It should working so, that I construct a Web Dynpro-component, that gets the data of the search help from the SAP-system, interpreted it and creates the ui-elements and the needed context generic.
    The mapping between the Input field of the customerview and the right search help is to be made with an xml-file, which contains the information: name of the view, the input field, the search-help-name and the name of the field that will be returned.
    The xml-file is reading from a helper-class. That helper-class contains any information, witch need the search help-component as well as the customer-component.
    The initialization takes place in the method wdDoModify of the customer. The call of the search help from the customer should be implement with an Action, witch is bound to a Button(create dynamic in the helper-class behind the input field).
    In a second foot should be create a plugin for eclipse, witch insert the used files (search help component, helper class, …) in the project. In addition it should create the call in the customer generic.
    It would be great if someone can give me a feedback!

    Hi Mike,
    The BlanketAgreement.exe is a reference to the executable that will be created when you compile the solution you created in Part II - Part III. I think there is a mistake in the tutorial because it asks you to name the project 'Blanket' which means that by default the executable will be called Blanket.exe and not BlanketAgreement.exe. The tutorial also misses the step asking you to compile the Blanket project before you go on to create an installer. You should compile your Blanket project in Release mode before creating an installer. By compiling the project you'll get a Blanket.exe file in the bin folder of your Blanket project which you then need to add to the installer per the instructions.
    SAP do offer development courses in some areas and there is training material here on the SDN and on the SAP partner portal (and maybe the customer portal as well). Try searching this forum for 'training' or 'tutorial' and you should get a few links. There's also a development certification.
    Personally I'd recommend you give yourself a little project to work on and just get stuck in
    Kind Regards,
    Owen

  • Qtn: I have 10 standard elementary search helps in collective standard search help, how to deactivate the 10th elementary search help?

    Qtn: I have 10 standard elementary search helps in collective standard search help, how to deactivate the 10th elementary search help?

    Hello,
    this topic is still a problem for me, does anybody have an idea.
    Just to show what's my problem:
    Collective Search help KRED does include a SAP append-search help ASH_KRED which holds the elementary search helps KREDC, KREDE, KREDM, KREDW.
    The search helps KREDE, KREDM, KREDW should not be displayed, so I added another Serach-Help-Append ZKRED_CUST at the end of CSH KRED which holds these 3 SH's with the hidden flag.
    That works, the SH's are not shown anymore.
    I also added some other of the Original SAP SH's (e.g. KREDA) with the hidden flag and added changed copies of these (e.g ZKREDA) there to be shown instead.
    All this can be done modification free by appends.
    The folders of the elementary search helps are shown in the order as they are found included in the KRED SH and the append to this SH.
    This means that the not hidden Sh KREDC from ASH_KRED is shown before all the "custimized" ZKREDx -SH's. But we need this SH not very often, so that I want it to displayed al the right-most position of the folders of SH's or at the most down postition of the drop-down-selection of SH's.
    But I have not found any way to do this modification free.
    The only way to archive this is to modify ASH_KRED by setting the Hidden-Flag for KREDC and add this SH at the end of append-SH ZKRED_CUST again.
    But I want avoid this modification.
    So, is there any way to do this without modifing any of the original SAP SH's ?
    Helmut Fischer

  • How to add check tables or search helps to search help parameters?

    Hello Forum!
    I have made a Z-Search help, and I have a problem with some of my parameters.
    The field (MARC)-EKGRP (Purchasing Group) has a check Table (T024) and the matching search help (H_T024).
    I seem to find no possibility to add this check Table search help to my EKGRP parameter in my Z-Searc Help.
    (Therefore, the End-User has to type it in Manually, there is no F4 funktionality...)
    Is there a way to do this?
    Thanx for replying!
    Kind Regards,
    Pieter
    PS: I´m experiencing the same problems with other fields as well: to parameter (MARA-)MFRNR I would like to add the seach Help 'KRED', for it appears on my Z-Search Help. And so on....

    Thanks, Archna Raja!
    This is certainly the right direction to look for a solution.
    However, i can not get it to work.
    In debugger Mode I have populated the SHLP-FIELDDESCR field 4AVAILABL  with X.
    Result: The button for the search help appears. But when I click on it, nothing happens.
    I than also tried this in combination with populating the fields:
    REFTABLE
    CHECKTABLE
    No search Help window opened..
    I did not find a fileld  where I can indicate the Search help in the SHLP Structure.
    Am I missing out on something?
    Kind Regards,
    Pieter
    PS: I´m trying to get a search help for The filed EKGRP.
          Check Table:  T024          Serach Help: H_T024
    Edited by: Pieter De Fré on Nov 30, 2010 11:38 AM

  • Tab in search help MM03 and VA03

    Hi experts,
    I added a new tab in matrn search help MAT1 (MM01/02/03) and it shows ok. But in VA01/02/03 item grid, the search help for matnr does not show the new tab.
    VAs tcode use S_MAT1 search help, but MAT1 is in S_MAT1 as collective search help. Are there anythings to do?
    How I add a new tab in VAs tcode search help in items grid for material???
    Thanks in advance.

    The item grid uses SD_MAT1 not S_MAT1 so there isn't a common collective search help where you can append your search help.  Just append your search help to SD_MAT1 as well.

  • Creating a tab in Search Help.

    Hi everyone,
    I have created a search help field for 'Vendor by category'.
    How to create this tab/option screen for all search help when they are searching for Vendor number.
    For example when i press the F4. An extra tab has to come for Vendors by Category with some input fields, like vendors by country/company code, vendors by personnel number.
    Help me
    Thanks,
    Mohanraj

    Hi,
    You can get this tab by creating a elementary search help and attach it to the collective search helkp which is already used by your application
    see the below links for creating search help exit
    https://www.sdn.sap.com/irj/sdn/wiki?path=/display/snippets/implementing%2bsearch%2bhelp%2bexits
    Re: Search Help Exit
    Regards,
    Siva chalasani.
    <b>Reward points if usefull</b>

  • Dropdown help on textbox just like Google textbox search help dropdown

    Hi,
    I am on a requirement to show dropdown help while typing a text in textbox in ABAP webdynpro
    For ex: If I type "P"  in textbox, dropdown help show all related coustomers name whose names starts with "P" . Similarly, If I type " Bang" then dropdown help shows all words whose name starts with Bang.
    Is this dropdown possible? or what else you think might be best suitable for such kind of search help just like in Google TextBox (Where you type and it shows all related words in tghe dropdown)
    Please help if anyone worked/aware in such reqmt?
    Thanks
    Praveen

    Hi,
    Try with OVS (ObjectValueSelector)in web dynpro ,in this we search with  employee name like P*   , it gives all employee names started with P.
    >>Remove reference to external website
    Excuse if it is not related to your requirement.
    Edited by: Lavanya YH1504 on Aug 19, 2010 3:39 PM
    Edited by: Thomas Jung on Aug 19, 2010 10:11 AM

  • Search help Enhancement for the Material Number (MAT1 - Search help name)

    Hi ,
    In my Requirement if the user clicks on the Material Number Search help(eg in ME51N - T.code: Material )
    It will shown a additional Search help along with the existing one.
    That search help would have input parameter fields as Material Number , Material Group , Material description , Plant and storage location.
    The output screen has to display the Available Quantity for the input  material, plant and  storage location.
    The available quantity has to calculated from various Tables like mard , mssq etc.
    My question is how to display the available quantity in the search help screen, i tried with search help exit but not successful.
    I am displaying the remaining fields(except available quantity)  using database view from different tables like Mara , Mard ,Makt.
    where to write the Logic for the Available Quantity to display it in search help.
    Thanks and Regards,
    Prakash K

    Hello,
    if this search help is collective then you could delete standard single (SAP allows maintain collective search help with out object key registration) one and insert custom search help which has the same structure plus additional field.
    best regards,

  • Need help with some code ... Searching a tree and inserting data

    I'm trying to write code for the addIterative method below.
    My problem is that I also need to search the list or node to see if the word exists.
    The method add(word,line,position,iterative) validates the parameters; and, in order to update the tree and/or any relevant linked-list, calls either the incomplete method addIterative(word,line,position) or the incomplete method addRecursive(word,line,position). Note the following: if the word is not contained currently in the tree, then all of the (word,line,position) triplet needs to be added to the data structure; otherwise, only the (line,position) pair needs to be added to the data structure. The result must be the same regardless of the algorithmic strategy employed.
    any suggestions would be greatly appreciated, new to java, and very lost.
    regards,
    Jimmy
    * Write a description of class Tree091 here.
    * @author (your name)
    * @version (a version number or a date)
    class Tree091 /*(i.e., WordTree)*/
    { private char[] word=null;
    private List091 list=null;
    private Tree091 precursor=null; /*(i.e., leftSubTree)*/
    private Tree091 successor=null; /*(i.e., rightSubTree)*/
    public Tree091(char[] word,
    List091 list,
    Tree091 precursor, /*(i.e., lexicographically < word)*/
    Tree091 successor) /*(i.e., lexicographically > word)*/
    { if (word==null) return;
    if (word.length<1) return;
    if (list==null) return;
    this.word=word;
    this.list=list;
    this.precursor=precursor;
    this.successor=successor;
    public void add(char[] word,
    int line,
    int position,
    boolean iterative)
    { if (word==null) return;
    if (word.length<1) return;
    if (line<0) return;
    if (position<0) return;
    if (iterative)
    this.addIterative(word,line,position);
    else
    this.addRecursive(word,line,position);
    private void addIterative(char[] word,
    int line,
    int position)
    /* something goes here*/
    private void addRecursive(char[] word,
    int line,
    int position)
    /* something goes here*/
    private int compare(char[] array1,
    char[] array2)
    { if (array1==null) return -2;
    if (array2==null) return -2;
    int length1=array1.length;
    if (length1==0) return -2;
    int length2=array2.length;
    if (length2==0) return -2;
    int minLength=length1<length2?length1:length2;
    for (int i=0; i<minLength; i++)
    { if (array1[i]<array2) return -1;
    if (array1[i]>array2[i]) return 1;
    return length1==length2 ? 0 : length1<length2 ? -1 : 1;
    public boolean contained(char[] word)
    { int compare=compare(this.word,word);
    if (compare==1&&this.precursor!=null)
    return this.precursor.contained(word);
    if (compare==0) return true;
    if (compare==-1&&this.successor!=null)
    return this.successor.contained(word);
    return false;
    public int listNodeCount(boolean iterative)
    /* something goes here*/
    return 24;
    public int maximumWordLength(int currentLength)
    /* something goes here*/
    return 25;
    public String toString()
    { String string="";
    if (this.precursor!=null) string+=this.precursor;
    string+="\""+(new String(this.word))+"\""+this.list;
    if (this.successor!=null) string+=this.successor;
    return string;
    public int treeNodeCount()
    /* something goes here*/
    return 26;
    public String wordArray(int length)
    /* something goes here*/
    return "hey hey wordarray";

    hey,
    ok, wow, that was intense, my brain hurts!!!!
    And now I've got to go do a graduate program test, argh!!!
    A problem I keep getting is trying to figure out what my lecturer is doing in the start of the Tree091 class,
    that is, I can see that he is constructing the list and tree but it appears that he is doing it all at the same time, and I'm getting confused with what actually gets inserted into the list, and do we insert the word, line and position, or just the line and position?
    Also, I didnt use a 'while loop', I'm not sure how, but I found a 'for loop' in the text book, what do you think of it? Is it ok for now?
    And I'm getting an error at this line:
    Tree091 ins = new Tree091(char[] word); // getting error '.class' expected here
    any ideas?
    heres what I've got so far:
    private void addIterative(Comparable char[] word,int line, int position){
    // Insert char[] word into the this BST     
         int direction = 0;     
         Tree091 parent = null, curr = root;
         for (;;) {     
              if (curr == null) {
                   Tree091 ins = new Tree091(char[] word); // getting error '.class' expected here
                   // word found so we call insertList method
                   insertList091(line, position, List091 precursor);
                   if (root) == null)
                        root = ins;
                   else if (direction < 0)     
                        parent.left = ins;
                   else // direction > 0
                        parent.right = ins;
                   return;
              direction = elem.compareTo(curr.element);
              if (direction == 0)
                   return;
              parent = curr;
              if (direction < 0)
                   curr = curr.left;
              else // direction > 0
                   curr = curr.right;
    }And heres an attempt at the insertList method
    private void insertList(char[] word, int line, int position, List091 precursor){
    // Insert line and position at a given point in this List091, either after the node
    // precursor, or before the first node if precursor is null
    // Looking at assignment question we may need a double linked list
         List091 ins = new List091 (char[] word, line, position, null);
         if precursor == null) { //insert before first node (if any).
              ins.successor = first;
              first = ins;
         } else {
              ins.successor = precursor.successor;
              precursor.successor = ins;
    }How far off am I Joachim?
    cheers,
    Jimmy
    ps. heres the tree091 class again:
    class Tree091 /*(i.e., WordTree)*/
    { private char[] word=null;
      private List091 list=null;
      private Tree091 precursor=null; /*(i.e., leftSubTree)*/
      private Tree091 successor=null; /*(i.e., rightSubTree)*/
      public Tree091(char[] word,
                     List091 list,
                     Tree091 precursor, /*(i.e., lexicographically < word)*/
                     Tree091 successor) /*(i.e., lexicographically > word)*/
      { if (word==null) return;
        if (word.length<1) return;
        if (list==null) return;
        this.word=word;
        this.list=list;
        this.precursor=precursor;
        this.successor=successor;
      public void add(char[] word,
                      int line,
                      int position,
                      boolean iterative)
      { if (word==null) return;
        if (word.length<1) return;
        if (line<0) return;
        if (position<0) return;
        if (iterative)
          this.addIterative(word,line,position);
        else
          this.addRecursive(word,line,position);
      private void addIterative(char[] word,
                                int line,
                                int position)
        /* students to complete */
      private void addRecursive(char[] word,
                                int line,
                                int position)
         /* students to complete */
      private int compare(char[] array1,
                          char[] array2)
      { if (array1==null) return -2;
        if (array2==null) return -2;
        int length1=array1.length;
        if (length1==0) return -2;
        int length2=array2.length;
        if (length2==0) return -2;
        int minLength=length1<length2?length1:length2;
        for (int i=0; i<minLength; i++)
        { if (array1<array2[i]) return -1;
    if (array1[i]>array2[i]) return 1;
    return length1==length2 ? 0 : length1<length2 ? -1 : 1;
    public boolean contained(char[] word)
    { int compare=compare(this.word,word);
    if (compare==1&&this.precursor!=null)
    return this.precursor.contained(word);
    if (compare==0) return true;
    if (compare==-1&&this.successor!=null)
    return this.successor.contained(word);
    return false;
    public int listNodeCount(boolean iterative)
    /* students to complete */
    public int maximumWordLength(int currentLength)
    /* students to complete */
    public String toString()
    { String string="";
    if (this.precursor!=null) string+=this.precursor;
    string+="\""+(new String(this.word))+"\""+this.list;
    if (this.successor!=null) string+=this.successor;
    return string;
    public int treeNodeCount()
    /* students to complete */
    public String wordArray(int length)
    /* students to complete */
    Edited by: allergy01 on Apr 25, 2009 9:19 PM
    Edited by: allergy01 on Apr 25, 2009 9:20 PM                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

  • Search help for cost center does not work after SP upgrade

    Hi,
    Create a shopping cart in SRM and go to the cost assignment tab. When click on the search help to enter a costcenter, we don't get any search help screen.
    Thanks

    Kindly check note: 1259735 Search help of generic account does not work
    Additionally Check the 5th question/answer of note 815849.

  • Search help PREM end parameter

    Dearu2026
    Since few days ago we noticed that search help PREM (for example from transaction PA30) has changed, although we didnu2019t implement any change or system modification. Can someone explain me why this could have happened Is there any other system parameter than MOL influencing the match code Which one Thanks in advance

    You may check the following IMG path from SPRO:
    Personnel Management > Personnel Administration > Basic Settings > Maintain search helps
    And then look into tab 'Included search helps'. Maybe some of the check-boxes have been checked / unchecked here.
    Hope this helps.
    Regards,

  • Search Help 'PREM' Related

    Dear Friends,
    I have modified the screen SAPLKACB 0002. I HAVE APPLIED SEARCH HELP "PREM" ON COBL-PERNR(Personnel No).Now if u go to F-02 Transaction.We have a Company Code entered Say : 2200.
    Now if we fill in the mandatory fields we go 2 next screen there we have personnel no field where i have
    attached F4(Search Help).
    Now i need 2 restrict the search help according to the company code.
    if the Company Code i enter say 2100 and hIt enter.it should give me some king of msg that
    the company code 2100 does not match the (F-02 Transaction Company Code:2200).
    Please Guide as 2 how 2 Accomplish this.
    Regards,
    Essam

    You may check the following IMG path from SPRO:
    Personnel Management > Personnel Administration > Basic Settings > Maintain search helps
    And then look into tab 'Included search helps'. Maybe some of the check-boxes have been checked / unchecked here.
    Hope this helps.
    Regards,

  • Modify SAP Search Help

    Hi All,
            I have a requirement to modify the exisitng search Help 'PREM' ,which is a collective search help.
    In this I have added my Serach help 'Z1PNAlT'.This z- search HELP HAS 'PNALT' as export parameter.
    How ever when I include this Z search help in 'PREM' it gives me a warning at the time of activaion as :'No parameter assignment has been done for Z1PNAlT'.
    Can anybody please help me with this?
    Thanks

    Hi,
    You have done the parameter assignment at 'collective search help' level as well (check the 'Param Assignment' Button at collective search help change screen on the tab 'Included search help')?
    cheers,

Maybe you are looking for