Search logic

Hi,
I have to write a RFC for searching order number based on text, order type or order number.
There can be an instance any of the fields can be empty and search engin should get results based on input.
I guess I will have to write so many combinations to achieve this search. Can any one suggest if they know any other logic to write such kind of search.
Regards
Ria

parameters : po_type.
parameters : po_num.
ranges : ro_type for ORDER_TYPE?.
ranges : ro_num for ORDER_NUMBER?.
if po_type ne space.
move 'I'     to ro_type-sign.
move 'EQ'    to ro_type-option.
move po_type to ro_type-low.
append ro_type.
endif.
if po_num ne space.
move 'I'    to ro_num-sign.
move 'EQ'   to ro_num-option.
move po_num to ro_num-low.
append ro_num.
endif.
select * from TABLE where order_type IN ro_type
                      and order_num IN ro_num.
ibrahim

Similar Messages

Search logic absent in RFAVIS40??

Hi,
We use the normal lockbox program RFEBLB30 to post the lockbox transmission from customers who send us EDI 820. However, we have some customers on ACH for which we only receive an excel file and using this information , we create the payment advices manually (using a z program). And in order to post these payment advices, we use the standard program RFAVIS40.
However, we realized that RFAVIS40 does not perform any search to find the documents that it needs to clear. For instance, when a reference number, assignment number are provided in the payment advice, the normal lockbox program will use the reference number first (depending on the config) and look for that number in the reference, document number and then assignment number of AR documents to find a match. If it is unsuccessful , then it will use the next available field.
Looks like this logic is completely absent in RFAVIS40. If any of you guys used this program before, can you please advise a workaround or solution to incorporate the search logic.
Also, our developer tells us that it is not possible to incorporate that logic in this program as the way RFEBLB30 and RFAVIS40 work are completely different. RFAVIS40 just submits the existing payment advice to FB05, where as the standard lockbox program modifies the payment advice and fills the document number field whenever it finds the match.
I am not good at debugging and finding a programming solution. Can you guys please advice if this can be done ??
Points will be awarded.

any ideas??

Search logic in servlete programming

Hi
i hae a search text box in jsp.. in the servlet i need write logic for retrieving the values n diaplsyiing...could ne1 tell me how to do it?thank yu

PROCESS AFTER INPUT.
PROCESS ON VALUE-REQUEST.
FIELD ZSDRBT_INELG_INV-ZAPPR1_STA MODULE DLIST.
DATA: BEGIN OF ITAB OCCURS 0,
       HL LIKE ZSDRBT_INELG_INV-ZAPPR1_STA,
      END OF ITAB.
data: it_ret like ddshretval occurs 0 with header line.
*&      Module DLIST INPUT
      text
MODULE DLIST INPUT.
DATA: l_input(1).
clear l_input.
if g_auth <> 'BM'.
    l_input = 'X'.
endif.
if bm_app1 = 'C'.
    l_input = 'X'.
endif.
CALL FUNCTION 'F4IF_INT_TABLE_VALUE_REQUEST'
    EXPORTING
DDIC_STRUCTURE         = ' '
      RETFIELD               = 'HL'
PVALKEY                = ' '
     DYNPPROG               = 'ZSD_RBT_DEVIATION_PRS'
     DYNPNR                 = '0200'
     DYNPROFIELD            = 'ZSDRBT_INELG_INV-ZAPPR1_STA'
STEPL                  = 0
   WINDOW_TITLE           = 'Input'
VALUE                  = ' '
   VALUE_ORG              = 'S'
MULTIPLE_CHOICE        = ' '
   DISPLAY                = l_input
CALLBACK_PROGRAM       = ' '
CALLBACK_FORM          = ' '
MARK_TAB               =
IMPORTING
USER_RESET             =
    TABLES
      VALUE_TAB              = ITAB
FIELD_TAB              =
     RETURN_TAB             = IT_RET
DYNPFLD_MAPPING        =
EXCEPTIONS
PARAMETER_ERROR        = 1
NO_VALUES_FOUND        = 2
OTHERS                 = 3
if sy-subrc = 0.
    read table it_ret index 1.
    move it_ret-fieldval to ZSDRBT_INELG_INV-ZAPPR1_STA.
endif.
*IF SY-SUBRC <> 0.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
        WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
*ENDIF.
ENDMODULE.                 " DLIST INPUT

How change Storage bin search logic in WM ?

Hi All,
Standard process to find bin during putaway in WM is as follow :
First find storage type, then storage section and finally storage bin type.
Is it possible to change slightly this logic as follow :
Find storage type first, then with first storage bin type find a bin in storage section sequence, if not found try to found with second storage bin type within storage section sequence and so on.
It's a kind of mix bewtween storage bin type search and storage section search.
Thanks for advice !
Patrice

OK, so you want it to check all storage sections for available bin type "A" and only then loop back around and check for bin type "B" from the first storage section again.
Storage bin type check is relative to the allowed Storage unit types per bin based on my understanding. During put away the system will check the allowed SUT in sequence based on your entries in your storage bin type search so it would loop within first storage section until it sees no available bin type that fits the allowed bin types (sequential) and only check second storage section (again sequential) when none of the allowed bin types are found available, so if I understand the available config options what you want is not possible without customization....check exit MWMTO003 - Customer-defined putaway strategy to create your own strategy

AStar Search Logic (Bug)

I have been working on a simple implementation of the A* Search Algorithm. I thought it was working, but apparently I didn't test it enough with different terrain movement costs (grass is easier to pass through than mountains, etc.). And now I'm wondering if my logic is even correct:
loop through each waypoint:
    do until next waypoint is found:
        do for each adjacent node:
            if checked node is on the closed list:
                if checked node is not on the open list:
                    make the checked node's parent = the current node
                    put the checked node on the open list
                    checked node g cost = parent node g cost + 1 (straight) or sqrt of 2 (diagonal)
                if checked node is on the open list:
                    if the checked node's g cost < the parent node's g cost:
                        --------Should I do this next line?--------
                        switch the two nodes (in terms of parent)
                        checked node g cost = parent node g cost + 1 (straight) or sqrt of 2 (diagonal)
    let h cost = distance between current node and next waypoint
    let f cost = g cost + h cost
    make the current node the node with the lowest f cost
    put it on the closed list and remove it from the openI think that just about covers it.
I can't seem to find good documentation on A*, so I tried several similar ways (particularly regarding the parent values), but none seem to work. The full source code can be found at http://students.hightechhigh.org/~dturnbull/11thGradeDP/Programming/AStar/AStar.zip (along with the Jar itself). A screenshot of the bug and the corresponding debug log can be found at http://students.hightechhigh.org/~dturnbull/11thGradeDP/Programming/AStar/Debug/.
(In the screenshot, the other two paths should have the same f cost as going through the middle disregarding terrain cost. Why then, would it choose to go through the high movement cost terrain?)
Can someone please point me in the right direction?

First I'd like to say that, considering you're an 11th grade student, you really did a nice job! Your aplication looks nice and you have even commented your code with Javadoc standards.
But now the criticism. ; )
You have one big problem: your AStar class. It's far too big (almost 2000 lines!) and has far too much responsibility: it's handling events, the GUI, game logic, etc. Some of the methods are over 100 lines long(!), making them very hard to follow.
It's best to create a non-GUI application first and when your game logic is done (and works), build a GUI around it [1].
When creating a larger application, it can be helpfull to underline all nouns and verbs in the problem description: the nouns are your classes and the verbs are the methods from those classes.
You could end up with these five classes:
|                                                                      |
| + TerrainType: enum                                                  |
|______________________________________________________________________|
|                                                                      |
| - cost: int                                                          |
| - passable: boolean                                                  |
| - label: char                                                        |
|______________________________________________________________________|
|                                                                      |
| -TerrainType(cost: int, passable: boolean, label: char) << constr >> |
| + getCost(): int                                                     |
| + isPassable(): boolean                                              |
| + getLabel(): char                                                   |
| + toString(): String                                                 |
|______________________________________________________________________|
|                                            |
| + Coordinate                               |
|____________________________________________|
|                                            |
| x: int                                     |
| y: int                                     |
| Direction: enum                            |
|____________________________________________|
|                                            |
| + Coordinate(x: int, y: int): << constr >> |
| + distance(that: Coordinate): int          |
| + equals(o: Object): boolean               |
| + get(direction: Direction): Coordinate    |
| + toString(): String                       |
|____________________________________________|
|                                                  |
| + Tile                                           |
|__________________________________________________|
|                                                  |
| - coordinate: Coordinate                         |
| - terrainType: TerrainType                       |
|__________________________________________________|
|                                                  |
| + Tile(x: int, y: int, type: char): << constr >> |
| + equals(o: Object): boolean                     |
| + getCoordinate(): Coordinate                    |
| + getTerrainType(): TerrainType                  |
| + hashCode(): int                                |
| + toString(): String                             |
|__________________________________________________|
|                                       |
| + Path                                |
|_______________________________________|
|                                       |
| - tiles: List<Tile>                   |
| - end: Coordinate                     |
| - cost: int                           |
| - estimate: int                       |
|_______________________________________|
|                                       |
| + Path(end: Coordinate): << constr >> |
| + Path(that: Path): << constr >>      |
| + add(tile: Tile): void               |
| + compareTo(that: Path): int          |
| + contains(tile: Tile): boolean       |
| + getLastTile(): Tile                 |
| + reachedEndCoordinate(): boolean     |
| + toString(): String                  |
|_______________________________________|
|                                                               |
| + Grid                                                        |
|_______________________________________________________________|
|                                                               |
| - grid: Tile[][]                                              |
| - width: int                                                  |
| - height: int                                                 |
|_______________________________________________________________|
|                                                               |
| + Grid(width: int, height: int, data: String[]): << constr >> |
| + findPath(start: Coordinate, end: Coordinate): Path          |
| + getNeighbours(tile: Tile): List<Tile>                       |
| + getTile(c: Coordinate): Tile                                |
| - processData(data: String[]): void                           |
| + toString(): String                                          |
|_______________________________________________________________|Note that the TerrainType is an enum [2].
I used the following data for the grid:// 'b'=brick, 'X'=building, 'm'=mud, '.'=dummy
String[] data = {
    "bbbbbbbbbbbbbbbb",
    "bXXXXbXXXXXXXXXb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XmX.......Xb",
    "bX..XmX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bX..XbX.......Xb",
    "bXXXXbXXXXXXXXXb",
    "bbbbbbbbbbbbbbbb"
}And the algorithm in the Grid class for finding a 'cheapest' path between two points (the A* algorithm) could be written as:public Path findPath(Coordinate start, Coordinate end) {
Queue<Path> allPaths = new PriorityQueue<Path>();
Set<Tile> visited = new HashSet<Tile>();
Path firstPath = new Path(end);
firstPath.add(getTile(start));
allPaths.offer(firstPath);
visited.add(getTile(start));
while(!allPaths.isEmpty()) {
    Path cheapestPath = allPaths.poll();
    Tile lastTile = cheapestPath.getLastTile();
    List<Tile> neighbours = getNeighbours(lastTile);
    for(Tile tile : neighbours) {
      if(visited.add(tile)) {
        Path copy = new Path(cheapestPath);
        copy.add(tile);
        allPaths.add(copy);
        if(copy.reachedEndCoordinate()) return copy;
return null;
}Due to the fact that all paths are stored in a PriorityQueue, I always get the cheapest path. Of course the Path class needs to implement the Comparable interface in order to let the PriorityQueue order the paths correctly [3].
So, I'm sorry I cannot help you with the bug in your code, but perhaps this is of help to you.
Good luck.
[1] Google for "MVC pattern".
[2] If you're new to enum's, read this tutorial: http://java.sun.com/docs/books/tutorial/java/javaOO/enum.html
[3] This tutorial explain how to do that: http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html

Search Logic in Knowledge Search ?

Hi Experts,
I log in with IC_AGENT business role. In knowledge Search workcentre link, I passed the text as a* in search term on "Text Search" tab, then on "Attribute Search" tab i selected knowledge base as solution database, category as validation category and selected the attribute. Now i have some conditions where i want to refine the search result that is coming.
I did some investigation and found that it is related to knowledge base configuration in the system, but not sure how to do it and where to do it ?
Regards,
Raman

And one more suggestion to the <b>Search Engine</b> would be, it should not be fetching all the replies to a particular post as separate search results.
For eg: Lets say User A has posted a topic say "Issues with RFC", all replies to this need not be fetched, just the starting topic would be great and an icon indicating whether the question has been answered(or relevant status).
Thanks Gregor for pointing that out, got psyched out, at first, but nevertheless, learnt something new.
Regards,
Subramanian V.

Search Engine Logic using beans & JSP's design needed.

I am developing a web app (using JSP, tags, beans, and SQL) that stores Electric utility customers info / data (like Account, meter read info & payments etc.) for retrieval based on search criteria input by the user(by acct, meter , meter location etc..). I need some kind of search engine to search the Customer information(data nearly 3 million records) that takes less than a minute.
Right now I have developed the search engine using JSP's, The JSP's will get the info from resultset query of beans and formatting stuff is done in JSP's. But its very slow....some times it takes 5 to 10 minutes to fetch the results. So, now we have planned to move the "search logic" from JSP's to beans, hoping this will speed up the search engine performance.
Does anyone know where I can get search engine logic using JSP, JavaBeans? , Please let me know is there discussion on this topic / sample code / links / books anywhere ?.
I will really appreciate the help.
Thanks,
Donthy

Hi,
I think to export the logic to the beans will not help a lot, because the .jsp and the beans are compiled together to a servlet anyway. And so, it doesn`t really matter, where the logic has been befor, after compilation it will be in the servlet.. But to have java code logic in the bean and not in the jsp is a good idea anyway. It is always nice to have as few scriptlet code as possible, makes the application more readable..
I think you should better have a closer look to the search logic, and the database. For such huge data amount, the Oracle database would be the best. And then let the database do as many of the search work as possible, because java is a little slow, and the database will be allways faster for this things of work..
lexip

How can we search data in flat files

I need to search for a particular list of account numbers whose data is stored in a flat file. Each line represents data for one account number. I also need to put all data for the searched account number into a new flat file.
Can anyone help me on this??
Thanks in advance....

I m very new to java programming and dont know what
to write in the code i.e are there any available
methods to do so..or do we need to write a search
logic..That's correct you have to implemetn the logic, but it's pretty easy. Just a loop which reads each line from the file, and looks for the information.
Kaj

Sharepoint Fast Search vs SQL server fulltext index

HI ,
I want to kow what is the different between Sharepoint fast search service and Sql server fulltext search?
Or Can I abstract the Sharepoint fast search from the Sharepoint platform as a isolate component?
Thank you.
James

Please have a look at these links:
SharePoint Search and FAST Search for SharePoint
Architecture Diagrams – Fault Tolerance and Performance
Understand
FAST Search Logical Architecture for SharePoint 2010
Full-Text
Search Architecture
sqldevelop.wordpress.com

How to Enhance search help for product groups. Currently no ability to add multiple lines from result list

Hi All,
In CRM Web UI, there is no multi selection option for product group id f4 help for Custmer event creation or edit screen under “Product” tab=> Product Group ID field.
Web UI Component Details -
UI component : TPMOE
View : TPMOE/ProductEOL
Context: PRODUCT Attribute : -PRODUCT_GRUOP
Click on Product Group ID field then below F4 Help screen appears.
In the product group results list, user can select only one row and Then all the product will be queried for selected product group, transferred to product list tab.
Current technical design for Product Group F4:
a) SE11 Data Dictionary search help “CRM_MKTPL_PGRP1” is used and data is fetched displayed based it( Refer method GET_V_PRODUCT_GROUP of context node class CL_TPMOE_PRODUCTEOL_CN00)
b) In UI, F4 pop up is handled by UI Framework in SAP generic manner so no multi selection is allowed.
c) A round trip event is triggered after selection of row from results which reload view with queried product result based group selected.
Requirement :-
In the product group F4 results list View, user should be able to select multiple row .As SAP GUI has the option of multiple entry selection from search help window with the help of field called MULTISEL.
System should query for products with all selected product group, transferred to product list tab.
Note: - The multi select options works fine for GUI, but for UI standard SAP code ignores this or never is this structure taken into consideration. Standard class to display F4 help on UI is CL_THTMLB_F4HELP.
Can we enforce same behavior like DDIC search help in Web UI too Or suggest how we can achieve this requirement?
Thanks in advance
Regards,
Arjun

Hello All,
We have achieved this requirement by Custom development and approach followed as -
Define UI object model zprgrp & zprgrpquery and object relationship in table ZCRM_OBJTAB
Query Strcuture : ZCRMST_PRGRP_SEARCH & Result List structure : ZCRMST_PRGRP_RESULT
Created Custom component : ZPRGRP with Search /Result view and with GENIL Class, search logic
Defined custom ComponentUsage “ProductGroup1SearchHelp” for ZPRGRP in Standard Component TPMOE
e. Called F4 application for field product _group with help component usage created in step d.
Regards,
Arjun

Search on basis of start date and end date

Hi,
I have added two fields 'Start Date' and 'End Date' on a search page.
I have done the VO extension also.
Now, I have to implement search logic to get all the records created in between 'Start Date' and 'End Date' after pressing the 'GO' button on that page.
Can anyone please provide guidance to extend the controller.
Thanks in advance.
Gaurav.

Hi Anil,
Thanks for ur reply.
As per the link, I have written following code in the controller :
package oracle.apps.irc.vacancy.webui;
import oracle.apps.fnd.framework.OAApplicationModule;
import oracle.apps.fnd.framework.OAViewObject;
import oracle.apps.fnd.framework.webui.OAPageContext;
import oracle.apps.fnd.framework.webui.beans.OAWebBean;
import oracle.apps.fnd.framework.webui.beans.table.OAAdvancedTableBean;
public class xxVacancyCriteriaCO extends VacancyCriteriaCO
public xxVacancyCriteriaCO() {}
public void processFormRequest(OAPageContext pageContext, OAWebBean webBean)
super.processFormRequest(pageContext, webBean);
// Pressing the Go button causes the search to be executed.
OAApplicationModule am = (OAApplicationModule)pageContext.getApplicationModule(webBean);
OAViewObject oaviewobject = (OAViewObject)am.findViewObject("XXIrcVacancySearchCriteriaVO");
if (pageContext.getParameter("Go") != null)
String created = pageContext.getParameter("ViewDate");
oaviewobject.setWhereClauseParam(0, created);
oaviewobject.executeQuery();
OAAdvancedTableBean table = (OAAdvancedTableBean)webBean.findChildRecursive("ResultsTable");
table.queryData(pageContext, false);
But while compiling it, I am getting the error as :
"Error(14,42): PerTransactionTopCOImpl not found in class oracle.apps.irc.common.webui.IrcOAControllerImpl in class oracle.apps.irc.vacancy.webui.VacancyCriteriaCO in class oracle.apps.irc.vacancy.webui.xxVacancyCriteriaCO"
Can u please suggest where the mistake is?
Thanks again.
Gaurav.
Edited by: Gaurav on Jan 14, 2011 12:51 AM

Search on a BLOB and not finding certain STRINGS...

I copied a search that Denes uses on his APEX How To Site (God I love that site) and customized it a little bit for my needs. Here's the interesting problem...
if I have a string of text within the attachment like
cgext.nfc_pacs1
the search returns with no records found. But if I only use
cgext.nfc
then I get a slew of returns. Most of them with _pacs1 and some with other extensions...
So I'm wondering, why is the search not finding the complete string that I enter into the search field when I've copied the string and pasted it into the field from a record that I know is in the Uploaded_Files table...
Any ideas?
First the Search:
SELECT ID, score (1) relevance,
SUBSTR (UPLOADED_FILE_NAME, INSTR (UPLOADED_FILE_NAME, '/') + 1) file_name
FROM UPLOADED_FILES
WHERE contains
(blob_content,
CASE
WHEN :p500_search_on_blob IS NULL
THEN 'this_text_doesnt_exist'
ELSE '%'
|| :p500_search_on_blob
|| '%'
END,
1
) > 0
Second, I made sure that I ran an index on UPLOADED_FILES
Third, I made sure that I ran a DBMS stats on the table / blob_content...
I'm at a loss as to why full text searches on strings that I know are on documents inside of the table are not finding them. Only when I cut down the search phrase does it kinda work...
Message was edited by:
mikedlong
Message was edited by:
mikedlong

I think I know what is happenening but I'm not sure why it is happening...
If I take the underscores out of the search then it will find the complete string, but why is this only happening with Underscores? Is there something that I'm missing with search logic that I should know?
I ran another search on the BLOB with the following text string that I know should have found 1 record:
CBS_USB_ACCOUNTING_LINES_TEMP
It didn't... now when I ran the search string with CBS USB ACCOUNTING LINES TEMP it found the one record.
I guess the problem is going to happen when I'm long gone from here and the person in my job is asked to run a search against cgext.po_t16_vendor_association and they forget to pull out the underscores...
Again, thanks to anyone with some information on how (if I even can) I can get the search to work as a litteral search against the blob content...
And thanks Denes... you've been credited on my work here in the application I'm building for the features you've taught me in your web page...
Mike Long

Need to ID G4 part:socket came off logic board (blue & white power cable

In the course of disassembling a G4 iBook the socket for the blue & white power cable wiring harness broke off the logic board.
I am trying to learn the correct desciption of this part so I can find a replacement. The wires on the bottom which were soldered to the board broke off.
Even after it was broken off, and I had leverage, I had to use two pairs of pliers to get the plug out of this socket. It should never have been assembled so tightly.

Spud-- I'm going to use conductive epoxy; I don't have access to anyone with micro soldering skills.
re previous posts -- unfortunately the Search logic is not precise enough to ask about this particular connector. Any search containing "logic board" gets swamped with the famous failure issue.
I went to an electronics specialty store and they didn't have any connectors of that style, let alone size. I'd like to replace the socket so I can use the existing plug on the blue & white wire.
Last night I spend some hours surfing "connector" etc and didn't see any photos that matched it on any distributor/manufacturer sites. So I'm still wondering what the correct descriptive word is, as used in the trade.
My "backup" iBook G3/Panther is taking about 30 seconds to load an average web page though. Spinner locks it up while loading one at a time. Wonder if installing Tiger and a newer Safari would help? I just got a chip to max out the memory, still have to install it.
For those who haven't seen it, the plug is a solid rectangle with two holes; the socket has a rectangular single cavity with two prongs sticking up from the bottom. TINY, THIN prongs.
The socket bottom has no leads on it (anymore). They are broken off flush with the plastic on the bottom. I was thinking of using a dental burr to grind into them, creating a small cavity, and then using conductive epoxy. I don't know if the bottom plastic is thick enough; if I go too far then it would ruin the prongs sticking up in the cavity.
But I could epoxy a wire stub, as long as possible to still fit into the space above the board & below the top of the shield/case. Then epoxy each wire to the pad on the board. The pads are about 1 mm x 2 mm or less, and worse, the gap between them is under 1mm wide. I'll have to goop some insulating silicone putty in that gap before putting tiny dabs of epoxy on the pads.
I bought some larger socket/plugs at the store, the socket part has no leads in it though. These sockets are they type that use the wire lead of the style shown in your photo of the repaired plug. I also got some different ones with flat prongs.
I'd like to move the connection point from the board to under the case top -- the blue & white wire runs all the way from the other side of the case. I just need a thin enough connector. Worst case -- leave as much slack wire length as possible and solder a Western Union splice.
If I can epoxy leads to the board without shorting between the pads I can figure something out. Need to carefully estimate the space available. Or as you say, just make some prongs.
You say #26 is the right wire gauge -- that's vital data. I don't want to undersize the power leads !
I'm also going to paint non-conductive coating on the board around the pad area, so I can slop the epoxy without worrying about shorting a trace. I've had to do some scraping to remove the gummy gluey stuff -- I presume its silicone adhesive of some kind.
There is some sort of test connection right above this area, with two little prongs sticking up. Marked "J1." The traces look like they go to the socket. I wonder if they use that to use alligator clips to power up the board during assembly testing? That location is much, much larger than the pads for the socket.

Search and Document History in Mountain Lion

Anyone out there figured out what Apple is doing with the Search and Document History in Mountain Lion? Here's my beef:
Missing History in Finder. Finder used to have a "History" button in the sidebar that would track docs by when you last used them--yeterday, this week, this month, etc. This was SUPER helpful--but it seems to have disappeared. Anyone know how to make it reappear, or has Apple decided that I don't really need it?
Really Hard to Search by Filename. In the old version, there was a button that would allow me to search by filename, but the new version makes you click through several very janky layers to do that. Anyone have a shortcut? Or advice on how to reorient my brain to the new search logic?
Thanks!

FileVault is one option, as etresoft points out. But you should note that e-mail is an inherently insecure medium. You should never transmit confidential information about patients via e-mail. That's like writing it on a postcard and mailing it... You're trusting everyone between you and the recipient not to read it. You need to either discuss cases only using something like a unique ID number that cannot be linked to the patient without access to your records, or you need to use encrypted e-mail (which is a pain to get set up, because everyone involved needs to participate).

ITAB_ILLEGAL_SORT_ORDER dump in CIC searching for Opportunities

Hi All,
We currently have a strange problem when trying to search for opportunities in the CIC. We go in, enter a partner number and select it as the main partner. Then, we chose Opportunity as the object to find, enter a date range and click on start (all in the interaction info navigator area.) We then get a short dump of :-
ITAB_ILLEGAL_SORT_ORDER
A line is to be inserted or changed at position 1 in the sorted
internal table (type SORTED_TABLE)
"FUNCTION-POOL=CRM_LOCATOR_UICLASS=LCL_ONE_ORDER_HITLISTMETHOD=SEARCH_RESUL
T_DISPLAY_DYNAMICDATA=LT_HEADER_GUID".
In doing so, the sorting sequence - determined by the table key - was
destroyed.
Program                                 SAPLCRM_LOCATOR_UI
Include                                 LCRM_LOCATOR_UIL01
Row                                     174
Module type                             (METHOD)
Module Name                             SEARCH_RESULT_DISPLAY_DYNAMIC
The problem only occurs if a given partner has more than 1 oppotunity created - obviously, if the search logic only finds 1 opportunity document then when it appends the guid to the search results it doesn't cause a problem. As soon as more than one document is found the code fails:-
*     get result list
      LOOP AT iv_search->gt_search_result INTO ls_search_result.
        ls_header_guid-guid = ls_search_result-fieldval.
        APPEND ls_header_guid TO lt_header_guid.
      ENDLOOP.
I've search on here and throughout OSS but can't find any solution and to be honest, I can't see why the problem is occuring. Has anyone else ever had this problem and if, is there a solution?
Thanks in advance,
Gareth.

Hi Patrick,
Yes, I know what the problem with the code is - but its standard SAP code!
I'm trying to understand what is actually causing it (I'm assuming it will be an OSS note somewhere but I can't find it!)
Thanks,
Gareth.

Search logic

Similar Messages

Maybe you are looking for