Extended search for contracts

When I select a purchasing organisation in the extended search criteria, the search results returned are those that are expected. However if I change the purchasing org the old value is retained. If I delete the old value and search again it is put back into the search field by the system. Also, when I choose a product category sometimes the results give me all the contracts when I am expecting no results.
We have applied notes 1088749 and 1067327...still the issue persists....
Is there a new note for this issue?
Regards
Vinay Sridhar

to go into details:
I am facing the following issue when trying to search for contracts or global outline agreement:
When I try to search for a contract after clicking the Extended search...I enter a purch. organisation and some results are displayed.
However if I change the purchasing org the old value is retained. If I delete the old value and search again it is put back into the search field by the system.
Also, when I choose a product category sometimes the results give me all the contracts when I am expecting no results.
We have applied notes 1088749 and 1067327...still the issue persists....
Is there a new note for this issue?

Similar Messages

FM to search for Contracts related to Ibase (CRM)

Hi there,
Is there any FM that can be used to search for contracts that are attached to the Ibase? I can't seem to find any suitable way to get this data...
Thanks,
Josh

Hi Joshua,
Try this FM IB_CONTRACTS_TO_COMPONENT and also refer to function group IBREP_CONTRACTS.
Regards,
Karthik.

Search for contracts with "ship to party"

Hi,
I am trying to search for contracts with a ship to party. We had a number of contracts input to SAP under one sold to party, now i I am trying to match sites to the contracts. I cannot seem to get a function to be able to search for them with just the "ship to party".
Any help will be usefull.
Thanks in advance
Dom

Hi Dom,
Are you searching for Contracts in CRM Web UI or in CS??
If it is in CRM Web UI - you can use the standard search with below search parameters.
Thanks,
Siraj

Searching for contracts

I'm trying to search for a signed contract (out of MANY that were sent). I'll use the search bar on both the Home and Manage pages and i'll try it with the person's name as well as their business name, and nothing will show up. Their signed contract (which they say they've signed) nor a copy of a blank contract showing it was even sent.
Besides going through the list of Signed Contracts, the Our for Signature tabs, and the ones listed in the Multiple Signatures what about all the other ones?

Hi renegadecraft,
This sounds like you may not have server-side searching turned on for your account. What that means is that if the contract is a certain age in the server AND you reach a certain threshold number of contracts sent / signed, the contract you're looking for may be truncated out of the initial search and you'll need to access the archival search tool. This isn't turned on for all users right now (it will be soon); in the meantime, I will contact you via PM for additional information so I can assist further in getting this resolved for you.
ODG.

TREX search for contracts

We have installed SRM5.0. TREX is running on a separate server. A RFC connection between the two servers has been established. Is any other config needed to be able to search in SRM via TREX?

Hi
You need to execute program SAP_BC_TREX_ADMIN to create contract index. Do read the documentation for this program.
Check also note : 766516
Best regards
Ramki

Extend campaign for Contract data

Hi Experts,
Campaign screen already have assignment block for 'Purchase Goods / Services'. Requirement is to Add two custom fields Contract ID, Contract line item# to this list. after input of two fields, on pressing <Enter> call should go to ERP to validate Contract ID (to EKPO-SRM_CONTRACT_ID ) and line item# (EKPO-SRM_CONTRACT_ITM) . If invalid, raise message, else fetch the related data for other standard fields from ERP and show it on UI.
Z fields are added to BOL model by enhancing item related node.
Which BAPI/ BADI can I use to fetch ERP data on <Enter> or refresh event?
Regards,

Hi Ratna,
The actual use case is to "Validate and fetch data from ERP, and populate on CRM UI".
Do you suggest to use DO_VALIDATE for both validation and also to set other context attributes ?
basically, if the input is valid in ECC, I need to get related data from ECC and populate related attributes on CRM UI.
Regards,

What are the config steps for contract mass change and quota arrangement?

Hi friends
what are the config steps for contract mass change and quota arrangement?
Regards
Raj Kumar

Process Flow
The mass change process consists of four steps. You navigate between these steps by choosing the Next and Back buttons located at the bottom right-hand corner of the screens.
       1.      Search for contracts
You search for and select the contracts or the contract hierarchy that you want to change.
Contracts that have the status Closed cannot be changed.
       2.      Define mass changes
You specify the changes you want to make.
You make changes at header data level and at item data level by choosing the relevant change methods. A green tick appears next to each change parameter so that you can see where changes are already active.
Once you enter this step, the documents you have selected to be changed are locked so that other users cannot make changes to them until you are finished with this process.
       3.      Simulate mass changes
Here you can perform a trial run of your mass changes. This simulation step is optional.
We recommend that you perform this step so that you can check how the change methods you have chosen will be processed by the system.
You receive status messages about the change methods for each contract and can quickly see whether any errors arise in connection with the proposed changes at this stage. From this step, it is easier for you to go back and correct the error than after applying the changes.
Background processing
The system processes the changes in the background.
If there are a large number of contracts to be processed, this step could take some time to complete. In this case, you can leave the transaction so that you can, for example, carry out other tasks in the meantime.
The system sends you an e-mail once the simulation step is complete. The e-mail contains a link to the relevant screen in the application so that you can return to it when it is convenient for you to do so. If you have left the SRM application, you can only return via this link.
Here you can see the status of the changes and, if necessary, you can correct any errors by going back to the Define mass changes step.
The messages that you receive in the simulation step are not confirmation that a change has been performed. They simulate the messages you get after you apply the changes. You must complete the final step of the mass change process and apply the changes before they take effect.
       4.      Carry out mass changes
Here you apply the changes to the contracts.
You cannot reverse this step, which is why we advise you to perform the simulation step beforehand.

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 for Contract in F-47

Hi,
How to provide search help for Contract in transaction F-47.
Regards,
Sriram

Hi
F-47 is for Down payment request.
What do you need information on contract - your question is not clear
SKS

Phone Upgrade Date Extended in Mid-Contract

OK, I know I'm searching for an answer I'll never have answered, I get it. Verizon can and will do whatever they want. There is latitude when you're the big dog. Woof on the little guys. Or customers, because there are always more of them.
We're four months away from our contract renewal date. We're smartphone users, and are adding our two kids to the account in the coming months. Once we add the kids, we're probably worth a total of $220 - $230 per month to Verizon, so we're not important at all. Again, I get it.
For the first 16 months of our current contract, like those of you who renewed at about the same time, we're were dangled a November 2013 phone upgrade date. 20 months, as has always been the Verizon customer retention strategy. As you all know, that got changed. In mid contract period.
Again, I get it. You changed it because legally you could. But, why? Don't give me the standard line I've heard a thousand times, that to bring the phone upgrade date in line with the contract renewal date makes sense. I don't care if it makes sense. It's wrong to change what you've been offering contracted long-term clients for over a year simply because you can. Go ahead and change it if/when we renew again, of make it clear to new clients as they sign up for another two years. But to change it mid-contract on customers you've had for more than 10 years, like us, is slapping us in the face. Ha ha, we did this because we could, we made a little extra money off of you, and you can't do anything about it.
Marketing retention strategy discussions, like the one that had to be held before Verizon made this call, are fascinating events. You know someone in that room was saying, "uh, guys, this may not be a wise idea"... but then again, maybe not.
I guess time will tell. In our geographic region, ATT and T-Mobile have just expanded their 4G coverage to cover what Verizon used to have all by themselves. In March we'll decide who to go with.
But then again, we're just little guys. Who up until now have been at the mercy of the big dog. Woof.
There. I feel better now.

Nice responses, all, and thank you. I guess it's good to know you're not entirely alone, even if for something as hopefully-far-down-the-list-of-important-stuff as a cell phone contract.
OK, I work in marketing. Which is why this whole scenario is so interesting to me. I have an attorney next to me who was laughing at me for taking time to vent, even though he admits - and this is for you, Ann154 - companies do get successfully sued all the time for extending offers in writing (on the web, or in print, as does apply in this case) that go beyond the scope of the original written contract. Verizon is simply betting that no one will care enough to do so. And I guess they've been right, and soon, it will all be irrelevant. Again, the big dog woofs.
And to Jonathan at Verizon - thanks for reaffirming the most fundamental and age-old marketing rule - when you know you can't really respond, always fall back to the company boilerplate statement. It will work more times than not for most. I tell my clients the same thing all the time.
But all of this is still bugging me. Which means as a marketer I'm probably developing a conscious. Which means I better find a new career soon.

Short dump "Time limit exceeded" when searching for Business Transactions

Hello Experts,
We migrated from SAP CRM 5.2 to SAP CRM 7.0. After migration, our business transaction search (quotation, sales order, service order, contract etc) ends with the short dump "Time limit exceeded" in class CL_CRM_REPORT_ACC_DYNAMIC, method DATABASE_ACCESS. The select query is triggered from line 5 of this method.
Number of Records:
CRMD_ORDERADM_H: 5,115,675
CRMD_ORDER_INDEX: 74,615,914
We have done these so far, but the performance is still either poor or times out.
1. DB team checked the ORACLE parameters and confirmed they are fine. They also checked the health of indices in table CRMD_ORDER_INDEX and indices are healthy
2. Created additional indices on CRMD_ORDERADM_H and CRMD_ORDER_INDEX. After the creation of indices, some of the searches(without any criteria) work. But it takes more than a minute to fetch 1 or 2 records
3. An ST05 trace confirmed that the selection on CRMD_ORDER_INDEX takes the most time. It takes about 103 seconds to fetch 2 records (max hits + 1)
4. If we specify search parameters, say for example a date or status, then again we get a short dump with the message "Time limit exceeded".
5. Observed that only if a matching index is available for the WHERE clause, the results are returned (albeit slowly). In the absence of an index, we get the dump.
6. Searched for notes and there are no notes that could help us.
Any idea what is causing this issue and what we can do to resolve this?
Regards,
Bala

Hi Michael,
Thanks. Yes we considered the note 1527039. None of the three scenarios mentioned in the note helped us. But we ran CRM_INDEX_REBUILD to check if the table CRMD_ORDER_INDEX had a problem. That did not help us either.
The business users told us that they mostly search using the date fields or Object ID. We did not have any problem with search by Object ID. So we created additional indices to support search using the date fields.
Regards,
Bala

How to use a standard library binary search if I'm not searching for a key?

Hi all,
I'm looking for the tidiest way to code something with maximum use of the standard libraries. I have a sorted set of ints that represent quality levels (let's call the set qualSet ). I want to find the maximum quality level (choosing only from those within qualSet ) for a limited budget. I have a method isAffordable(int) that returns boolean. So one way to find the highest affordable quality is to start at the lowest quality level, iterate through qualSet (it is sorted), and wait until the first time that isAffordable returns false. eg.
int i=-1;
for (int qual : qualSet) {
     if !(isAffordable(qual))
          return i;
     i++;
}However isAffordable is a slightly complicated fn, so I'd like to use a binary search to make the process more efficient. I don't want to write the code for a binary search as that is something that should be reused, ideally from the standard libraries. So my question is what's the best way of reusing standard library code in this situation so as to not write my own binary search?
I have a solution, but I don't find it very elegant. Here are the important classes and objects.
//simple wrapper for an int representing quality level
class QualityElement implements Comparable<QualityElement>
//element to use to search for highest quality
class HiQualFinderEl extends QualityElement {
     HiQualFinderEl(ComponentList cl) {...}
//class that contains fair amount of data and isAffordable method
class ComponentList {
     boolean isAffordable(int qual) {...}
//sorted set of QualityElements
TreeSet<QualityElement> qualSet When you create an instance of HiQualFinderEl, you pass it a reference to a ComponentList (because it has the isAffordable() method). The HiQualFinderEl.compareTo() function returns 1 or -1 depending on whether the QualityElement being compared to is affordable or not. This approach means that the binary search returns an appropriate insertion point within the list (it will never act as if it found the key).
I don't like this because semantically the HiQualFinderEl is not really an element of the list, it's certainly not a QualityElement (but it inherits from it), and it just feels ugly! Any clever suggestions? Btw, I'm new to Java, old to C++.
If this is unclear pls ask,
Andy

Thanks Peter for the reply
Peter__Lawrey wrote:
you are not looking for a standard binary searchI'm not using a binary search in the very common I'm searching for a particular key sense, which is the Collections.binarySearch sense. But binary searches are used in other situations as well. In this case I'm finding a local maximum of a function, I could also be solving f(x)=0... is there a nice generic way to handle other uses of binary search that anyone knows of?
I would just copy the code from Collections.binarySearch and modify itI have this thing about reusing; just can't bring myself to do that :)
It would be quicker and more efficient than trying to shoe horn a solution which expects a trinary result.Not sure I understand the last bit. Are you referring to my bastardised compareTo method with only two results? If so, I know, it is ugly! I don't see how it could be less efficient though???
Thanks,
Andy

Labview developer-search for remote work

I have 3 year experience as Labview developer. I have good skils in controling devices using different interfaces and automated tests.
I'm searching for some small projects which can be resolved using remote work. If necessary I can travel several time (in Europe).
Also I can aproach any specific project if initial data & rquirement are very clear defined and is no time presure.
If interresed e-mail to [email protected] .
Thank you!

Hi there,
Sorry but I have already taken on a new contract. If you send me your email address I can pass your request to some people who could help you.
Best regards
Neil
nrp
CLA

Error while searching for Business Partner in Web UI

Hi,
While searching for the Business Partner in Web UI either by First Name, last name or Account ID, we are getting following error:
Cannot display view BSPWD_BASICS/ErrorView2 of Component CRM_UI_Frame
An exception has occured
Exception class: CX_BOL_EXCEPTION - Access previously deleted Entity
Method: CL_CRM_BOL_ENTITY=>GET_ROOT
Source Text Row: 12
When the business partner blind search is given (i.e. by entering *), all the business partners get displayed without any problem.
Also, this problem occurs only for some business partners and NOT ALL.
This problem, has also been observed sometimes when an IBase entry is created in the background.
We are not quite sure whether notes, 135814 & 1515327 will help us in this regard, as the root cause is still unknown.
Could anyone suggest possible causes and solution for the same. We are on CRM 7, using the standard business role.
Thank you in advance.
Regards,
Chhaya

Hi Shiromani,
We have observed that this problem is peculiar with the data records attached to IBase ONLY. It means, if we process them further e.g. create a contract for the Business Partner after attaching the IBase, this problem doesnt occur. Then we are able to search the BP without any error.
In short, when an IBase is created for a BP, and if a search is given for such BP, the error given in the first thread occurs, But when an IBase is created and immediately after that a contract is attached to the BP, and if a search is given for such BP, then there is no error.
We are still further investigating the root cause. But any suggestion/inputs are welcome.
Thank you.
Regards,
Chhaya

Help needed in Inbox search for Custom attribute

Hi,
We have a requirement where in we are having a custom attribute on Service request to store the ECC Order number.
We have enhanced the Inbox search to retreive all the service requests havig the ECC order number.
Here we are encountering a problem. i just created a new crm service request and entered order number 1234. and now when i search for the same in Inbox search giving the criteria order number as 1234. I get no results found. But when i extend the max list to 2000, then i see the service request appearing in the result list. not sure about the algorithm that is designed for inbox search.
Any pointers on how to resolve this issue would be of great help.
Thanks,
Udaya

Hi,
I do not have the time to research this completely, but I had a short look into the class you posted.
In the GET_DYNAMIC_QUERY_RESULT there is a call to CL_CRM_QCOD_HELPER->PREPROCESS( )
A little bit lower there are blocks marked by comments for the single searches that are handled by this class. I had a look into the campaign_serach() method. There if you scroll a little bit down (around line 123) they set all search parameters to SIGN = 'I' OPTION = 'EQ'. This is done several times below as well.
Set a breakpoint in the proprocess() method and check which of the blocks is called and how they handle your search criteria.
Hope it helps.
cheers Carsten

Extended search for contracts

Similar Messages

Maybe you are looking for