Where in SPRO for assigning Parner Function to Plants??

Hi,
Please let me know where in SPRO could assign the partner function to Plants...
Thank you.

Hi,
We do not assign customer partner functions to plant in SD.
Are you talking about vendor partner functions?
We can assign IMG>Materials Management>Purchasing>Partner Determination>Partner Settings in Vendor Master Record>Define Partner Schemas.
Select schema L3 (Vendor+plant) and assign partner functions.
Regards,
Chandra

Similar Messages

Where to look for the attributes functionality of CL_GUI_ALV_GRID?

I am trying to use mc_style-f4 of CL_GUI_ALV_GRID.
But it is noe getting triggered.
Where can I look for the functionality of the Attributes section of CL_GUI_ALV_GRID?
(help.sap.com discusses about the events and mthods only and not the attributes section..)
Thanks,
Ven

SE24 shows you the methods and attributes.
and help.sap.com shows the functionality / usage of the methods. it does not tell about the attributes part.
I need to know this usage information about the attributes.
Say for example mc_style_disabled - this disables a cell.
MC_STYLE_F4 what does it do etc..

Assignment of function module in spro

Hi All,
We are using the Sabrix external system for tax calucation. They defined the function module for computation of tax. where do we assign the functional module in system.
Thanks and regards,
Ravi Vruddhula.

hi,
u want to specify ur customized FM here :
SPRO (Cross Application Components  SAP Business Partner  Business Partner  Tax Jurisdictions  Using SAP Software  Assign Function Module to Indicator)
thanks...

Where to configure Account Assignment Category for WBS Settlement Rule?

Hi,
I would like to know where is the Account Assignment Category for WBS settlement rule (FXA, CTR, G/L, WBS) being configured. (SPRO Path)
Currently when I go to our settlement rule creation screen I can only see WBS and FXA, I need to add MAT (Material)
Thanks!
Regards,
Vivian

Hi Shrikant,
Do you mean in my CJ02 WBS Settlement Rule creation screen, I cannnot put MAT as account assignment category?
Does it mean that WBS element CANNOT be settled to material? and we can only settle PM order to material?
Thanks!
Regards,
Vivian

Function module for assigning BP Number to the Postion ID in org model

Hi Experts,
Is there any function module for assigning BP Number to the Postion ID in organizational model.
The requirement is:
1)There are some employees which are reporting to a Manager who has a position ID.
2) Each of these employees should be assigned to the given position ID.
This can be done by First Locate the BP Record in SAP via the Vantive Person ID and retrieve the SAP BP Number.
Then assign the SAP BP Number found to the Position ID.
My question is Is there any function module for assigning BP Number to the Postion ID .
Looking forward for reply.
Thanks & Regards,
Renju.

Hi,
Org. management uses API classe objects with static methods as APIs. You may be able to achieve this using
CL_CRM_ORGMAN_SERVICES->MAPPING_ORGUNIT_TO_BP
Reward if helpful!
Regards,
Sudipta.

Function module for assigning a HU to delivery

Function module for assigning a HU in HU managed location to a delivery ??

Hello,
In FuGrp HU_BASIC_BAPIS Basic BAPIs for Hus
with F’tn BAPI_HU_CREATE Create handling unit with items
this creates HU's NOT yet assigned.
After F'tn BAPI_TRANSACTION_COMMIT
You can assign the HU via
F'tn BAPI_HU_CHANGE_HEADER
using the BAPIHUHEADER fields: PACK_MAT_OBJECT & PACK_MAT_OBJ_KEY.
Dirk

Where do i set right click functionality for trackpad?

i just got my macbookpro back from the shop and the right click functionality is not working.
can someone remind me where is set the right click functionality for trackpad?
google is giving me wormholes when i try and search on this.
TIA

ok. found it in one of the little tiny arrow pulldowns for second something or other in trackpad preferences.

Where the documentation is provided for the Standard Function module ?

If there is no documentation provided for the standard function module in SE37 what is the best way to understand the functionality of the function module?Is there any where we can find the documentation?
Please dont say the From coding part its too vast to understand
Ex: HRCM_ORGSTRC_INFO_TABLE_GET
Paint for me ..
Regards
sas
Edited by: Julius Bussche on Mar 18, 2009 1:17 PM

O Really thanks amit !!
Are you able to understand the below code and please provide your valuable inputs what we are understanding is the same.
PERFORM read_infotypes.
*-- ********************************************************** NMP
*-- IF scb frozen then write to itab-scb field. nmp 11/2001.
*-- ********************************************************** NMP
*--Begin of Change by vneld - 01/17/2007
* IF PA0001-ZZBERN NE SPACE.
* FROZEN = PA0001-ZZBERN.
* ENDIF.
* ITAB-SCB = FROZEN.
*-- ********************************************************** NMP
*--end of Change by vneld- 01/17/2007
PERFORM get_date USING '92'
 CHANGING w_hiredate.
PERFORM get_date USING '93'
 CHANGING w_rehire.
PERFORM get_date USING '94'
 CHANGING w_termdate.
IF NOT ( w_rehire IS INITIAL ).
 w_hiredate = w_rehire.
 itab-code = 'R'.
ELSE.
 itab-code = 'H'.
ENDIF.
IF p0001-persg = '3'.
 itab-code = 'T'.
ENDIF.
*Change by Mdukes
** We need HIRE,Rehire & term within 13 month`s window
** But if someone Hire in IT ,change dept and then terminated .
** We need to exclude that person from the list .
** We need to change his Org.Unit by END_DATE 12/31/9999 from Pa0001.
CLEAR:result_tab.REFRESH:result_tab.
CALL FUNCTION 'HRCM_ORGSTRC_INFO_TABLE_GET'
 EXPORTING
 PLVAR = '01'
 ROOT_OTYPE = 'O'
 ROOT_OBJID = P0001-ORGEH
 BEGDA = SY-DATUM
 ENDDA = P0001-ENDDA
 PATH_ID = EVPATH
 PATH_DEPTH = 10
 TABLES
 ORG_INFO_TABLE = result_tab
 EXCEPTIONS
 PATH_ERROR = 1
 ROOT_ERROR = 2
 OTHERS = 3.
* CALL FUNCTION 'RH_STRUC_GET'
* EXPORTING = 'O'
* act_objid = PA0001-ORGEH
* act_wegid = EVPATH
* act_plvar = TYPE
* act_tflag = space
* act_vflag = space
* authority_check = space
* TABLES
* result_tab = result_tab
* EXCEPTIONS
* no_plvar_found = 1
* no_entry_found = 2
* OTHERS = 3.
* reading the Org.Unit based on employee Org.unit (Evaluation Path 'O-O'.
* After that making sure the latest Pa0001 org.unit is part of selection org.unit
* If yes, set the flag to = 1 . Otherwise ignore the rec .
* We want only IT folks hire/rehire/term within 13 monthu2019s window
* if somebody change the dept and get term within 13 monthu2019s .it
* Should show up in hire but not in term report .
CLEAR:REC.
lOOP AT result_tab.
 read table PCHOBJID with key low = result_tab-OBJID.
 if sy-subrc = 0 .
 Rec = 1.
 EXIT.
 Endif.
ENDLOOP.
if rec = 1.
*--begin of change by vneld- 01/17/07
 CHECK ( ( w_hiredate >= w_13th_mnth_date AND w_hiredate <= sy-datum )
 OR
 ( w_termdate >= w_13th_mnth_date AND w_termdate <= sy-datum ) ).
*--end of change by vneld- 01/17/07
**---check for hires or terms in the calendar year.
**---No future terms
* CHECK ( ( W_HIREDATE(4) = SY-DATUM(4) ) OR
* ( W_TERMDATE(4) = SY-DATUM(4) AND W_TERMDATE <= SY-DATUM ) ).
 CONCATENATE p0002-vorna p0002-nachn INTO itab-name SEPARATED BY ' '.
*--Begin of change by vneld 03/29/2007
*--get supervisor name
 data : lname(20),
 fname(20).
 clear: lname,
 fname.
 Select vorna nachn from pa0002 into (fname ,lname)
 where pernr = p0001-zzsuper_no.
 endselect.
 CONCATENATE lname fname INTO itab-supv SEPARATED BY ' '.
* itab-supv = p0001-zzsuper_text.
*--End of change by vneld 03/29/2007
*----get employee group text
 CLEAR t501t.
 SELECT SINGLE * FROM t501t WHERE sprsl = 'EN' AND
 persg = p0001-persg.
 IF sy-subrc EQ 0.
 itab-group = t501t-ptext.
 ENDIF.
 PERFORM get_dept.
 PERFORM get_position.
 PERFORM append_fields.
endif.
ENDFORM. " PROCESS_EMPLOYEE
Edited by: saslove sap on Mar 19, 2009 7:45 AM

Where can i find the theory for alv with function modules

hi
where can i find the theory for alv with function modules

Hi,
Please check this link
http://sap.niraj.tripod.com/id66.html
ALV function module
http://wiki.ittoolbox.com/index.php/How_do_I_insert_a_logo_in_ALV_using_Function_Modules%3F
http://sap.ittoolbox.com/groups/technical-functional/sap-dev/using-function-module-fm-reuse_alv_grid_display-to-display-a-report-in-alv-1472543
reward if helpful
raam

SICF services required for e-mail functionality in Web IC

We are running a web ic in CRM 2007 sp4
I have inbound e-mails coming through our inbox in our web ic. However as soon as i trying to process the e-mails from the inbox i'm getting errors. No mail body text is visible in email component and when i try and forward an e-mail or create a new e-mail i get a JRE error (buttom-left of IE).
Can anyone tell me what services need to be enabled for email functionality to work?
Or can anyone recommend any other soultion to this issue
Thanks in advance
Eddie

You may refer to the URLs below:
Agent Inbox in the Interaction Center WinClient
http://help.sap.com/saphelp_crm50/helpdata/en/fc/dd35a47ffe420da97a105b00c63d74/frameset.htm
Basic Settings for the Agent Inbox
http://help.sap.com/saphelp_crm50/helpdata/en/fc/dd35a47ffe420da97a105b00c63d74/frameset.htm
E-Mail Inbox
http://help.sap.com/saphelp_crm50/helpdata/en/fc/dd35a47ffe420da97a105b00c63d74/frameset.htm
Also please explore the option of "Email Response management system" in SPRO for advance email service settings.
1. assign different agents to different e-mail addresses: It will be configurable.
2. different signatures when writing e-mail need different editor profiles (default signatures)? so also need different IC profile?
Yes you will need different IC profiles and assign it to the group of agents who would comply to it.
3. outbound e-mails -> Told you what i believe shoudl work.
4. how many services (tcode SICF) and how many SAPconnect nodes are needed to be able in ICWin to receive e-mails for 10 email addresses and distribute e-maild to different agents like I wrote in point 1. ?
ONLY one SAPConnect node.
5. incoming e-mails: We really need tyo check the ACTIVITY Type: Incoming email.
6. in ICwin user can search in e-mails with key words? for eg "problem with ht-1000"?
I m really not sure, as we are maintaing an Activity for Incoming or outgoing email, we should be able to search an Activity for BP (that activity can have email details).
7. incoming e-mails can have attachements? attachements will also get to ICWin with email? user will be able to open it?
Yes however for opening attachments you may have internet security concerns of the enterprise where SAP is implemented. It can be easily handled by networking people.
Hope there is some help
thanks,
Veevake

Need help in getting information/training material for SAP CRM (Functional)

Hello,
I am a SD Consultant.
I want to learn SAP CRM (Functional) on my own without going to any training institute or some thing.
Therefore, can anyone help me in forwarding the link(s) or document(s) with which I can learn about SAP CRM (Functional).
I want information/training material regarding SAP CRM 7.0 (on system/software working, not the general information, for example- why CRM, where CRM, etc)
For example, about org data, org structure, possible scenarios, etc.
Thanks in advance for spending your valuable time for me.
Regards,
T. Chaitanya
<<Moderator Message: Sorry, can't do. Search!>>
Message was edited by: kishan P

Hi Chaitanya,
Since You are already a SD Consultant, We assume you are very much familliar with SAP and for you CRM will also be not a big Deal.
Customer Relationships Management (CRM) is a model for managing any Organization's interaction with current and future customers. It involves technology to organize, automate and synchronize SALES, SERVICES(postsales) AND MARKETING(presales).
First of all you need to get SAP CRM installed in your system and then you need to get command over Account and Contact Management (Business Partner). The same can be learned using WebUI or GUI. From GUI the transaction launcher is WUI then web page opens up enter your credentials and select Role - Salespro. Open the Account and Contact section and do some R&D and you can learn. But in GUI you need to go to SPRO -> IMG -> Cross Application Components -> SAP Business Partner -> Business Partner -> Basic Settings -> Number Ranges & Groupings -> Define Number Ranges. Here you have defined number range then you need to assign to some group created from SPRO same way. And Finally maintain Business Partner using Tcode - BP.
Then You Learn Organizational Management which allows us to map our marketing, sales, service structure maintaining company's structure including the position and Employees in an Application and assign specific attributes to the otganizational units.
Path: SPRO -> IMG -> CRM -> Master Data -> Organizational Management -> Organizational Model -> Create Org Model/Change org model.
Just Go ahead and with some more R&D in the system and taking of F1 Help of SAP Documentation I think you can easily learn SAP CRM.
Regards,
Piyush

Assignment Profit Center to Plant on material master for Production Order

Hi Experts
Can you help me !
Now I'm trying to lock a profit center to the plant.I've tried searching on the standard menu and customizing but do not get it ?
How to assignment profit center to plant or plant to profit center.
Regards
Dodo M

Hello Dodo,
1.
You can make an assigment between the profit center and the plant in Customizing (SPRO) in two steps (through the company code), under the following menu path:
Step 1:
Enterprise Structure
Assignment
Financial Accounting
Assign Profit Center to Company Code
Step 2:
Enterprise Structure
Assignment
Logistics - General
Assign plant to company code
So, first you assign the profit center to the company code, then you assign the plant to the company code.
2.
Or you can use the Enhancement MGA00001 for implementing your own check in function module EXIT_SAPLMGMU_001.
You can also check the following help to understand the relationships in details:
Controlling (CO) - SAP Library
http://help.sap.com/saphelp_erp60_sp/helpdata/en/02/30793485231774e10000009b38f83b/frameset.htm
Best Regards,
Dora

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Palm! Where can I find a fully-functional Pre Plus????

Yes, I've posted this in a sub-topic and now I'm creating a new thread because I've had enough! I once considered myself a big time Palm supporter - but I do not know how much more I can keep my head up with this Pre Plus.
I'm spending WAY too much time at the Verizon store and not enough time with my phone at work. I'm very close to returning everything. I love webos but cannot bear to deal with this palm hardware anymore. The shady construction and poor build quality on ALL of the phones I've received over the past 3 weeks has left me with no confidence anymore in the hardware.
I have had my first phone returned with network problems - the phone would not receive data and the camera on the back was in the lower right corner of the opening - as if someone dropped it. I returned this phone, only to get another phone with keyboard problems and sporadic lockups. Today I just went into the Verizon store to replace the last defective one, only to receive yet another defective one. The left side of the display was seriously discolored. I showed the technician at Verizon and he agreed there was an obvious problem. He then took my phone back a 3rd time, replaced it with another one and it still has a light bleeding/discoloring problem on the left side. It's not as bright as the first one, but it's definitely there. I also see some light issues on the bottom of the screen as well (The discoloration is easily seen when going through interactive tests and displaying the "green" color. The Verizon store was just as frustrated as I was but wouldn't let me get yet another device from their store and told me that this was a feature of the phone. The gentlemen I worked with apologized severely, knowing it was definitely a build quality, but also admitting that he couldn't do anything because the store manager was done giving me more phones. His reaked of embarrassment! I was tired of arguing with them, even KNOWING my first two phones did not have this problem and their floor model didn't either. They even tried to convince me that the floor models are different... whatever! I took the phone and left and now I am dealing with even more issues. (Been working on this phone today for over 8 hours) I cannot get it to sync with my google calendar anymore (despite all the forums suggestions), and icons are being thrown all over my launcher (appearing then disappearing, etc)
I'm really upset that now I paid this much for a phone and I can't even get a good quality unit. I've spent well over 30 hours with defective phones, between driving to the stores, waiting in the stores and testing them on the road. I've fallen WAY behind at work dealing with these issues and having to read all the forums online for fixes to problems for a BRAND NEW PHONE.
Palm - you have a SERIOUS manufacturing problem with your hardware. I won't even go near the GPS problems. I've already accepted the fact that GPS doesn't work on any Pre Plus phones (how sad is that?). I've tested it on all 4 devices I've received, not to mention the 2 additonal floor models in the Verizon stores, and NADA. It either doesn't work at all or it's about 1/2 to 1 mile off.
I'm beginning to think the PLUS in PRE means MORE PROBLEMS.
I just can't keep going back to the stores, this is frustrating!!!!! I only have less than a week before 30 days is up.
I'm not one to complain like this, but I've just about had it.
PALM - WHERE CAN I GET A FULLY FUNCTIONAL PRE PLUS?!?!?!

I sure hope you bought to $7.99 protection plan...

Assigning a function code to radio button in 4.5B

Ive a requirement wherein I need to trigger the PAI event in a module pool program when I select a particular radiobutton in a group and do some processing subsequently.
For this I need to assign a function code to the radiobutton group.
But the function code field is disabled for input in the properties screen of the layout. Our client system is SAP 4.5B.
I am able to assign function codes to radio button groups in esuides(4.6C) and other systems.
I want to know whether we can assign a function code at all to a radio button group in version 4.5B.
If so, please tell me how to do this.
With regards,
ramu.

Hi,
we can't assign function codes to radio buttons.
for assigning some code to radio button.check the radio button status.
in PAI.
if RAD1 = 'X'.
xxxxxxxxxxx.
xxxxxxxxx.
elseif RAD2 = 'X'.
xxxxxxxxx.
xxxxxxxxxxxx.
endif.
regards,
bharat.

Where in SPRO for assigning Parner Function to Plants??

Similar Messages

Maybe you are looking for