Function of the users in Oracle10g !

Dear Friends ,
Would any body plz tell me in Oracle10g , what is the function of each user ?
For example , OUTLN user uses for the Stored Procedure , like this , what are the
other users function ?
SQL> select username from dba_users;
USERNAME
MGMT_VIEW
SYS
SYSTEM
DBSNMP
SYSMAN
OUTLN
MDSYS
ORDSYS
CTXSYS
ANONYMOUS
EXFSYS
DMSYS
WMSYS
XDB
ORDPLUGINS
SI_INFORMTN_SCHEMA
OLAPSYS
MDDATA
DIP
SCOTT
TSMSYS
21 rows selected.
Give me some helping doc source ....Thx .

http://space.itpub.net/304518/viewspace-629916

Similar Messages

How to debug a RFC function when the user is non-dialog type? Please help!

hi Experts,
I am calling a RFC FM residing in B from R/3 system A.
R/3 A -
Call FM residing in B----
> R/3 B
The user attached to the remote destination is a non-dialog type.
I cannot change the user type of this user.
Therefore how to debug the RFC FM in System A?
Are there any alternatives?
Please help
Thanks
Gopal

in your RFC FM, code an endlees loop.
something like:
data: gv_x type xfeld value 'X'.
do.
if gv_x = space.
exit.
endif.
enddo.
now you can catch the mode in TA SM50, go in it, change gv_x to space and debug what is coming further.

Filter data in function of the logged user

Hi,
I don't and I can't use ADF security for my current project but I need an authentication system.
So I created a simple managed bean (session scope) with current user information (username, roles, ...).
The problem is that displayed data must be filtered in function of the user (and his roles).
How can I do to access my user information in my application module?
I think that the easiest solution would be to access directly my managed bean in my application module but I don't know how to do that.
As I said I can't use ADF security so I don't have access to getUserData() & getUserRoles()...
Do you have any idea?
Thanks in advance!

There is one possibility of which I can think of.
1 Create a package in your database: e.g.
create or replace package PCK_LOGIN
as
c_user_id varchar2(50);
procedure set_user_id(pi_user_id in varchar2(50)
as
begin
c_user_id := pi_user_id;
end;
function get_user_id
as
begin
return c_user_id;
end;
end;Then create a method in your application module to call set_user_id.
After you have the user id in your bean you need to call this method.
Now the user id is known in the database (this is session dependent!)
and you can user M_LOGIN.get_user_id in your views and view objects.
To access the application module in your bean you can use the code
    private AppModule getAppModule(String dataControl) {
        // 1. Access the FacesContext
        FacesContext fc = FacesContext.getCurrentInstance();
        // 2. Create value binding for the #{data} EL expression
        ValueBinding vb = fc.getApplication().createValueBinding("#{data}");
        // 3. Evaluate the value binding, casting the result to BindingContext
        BindingContext bc = (BindingContext)vb.getValue(fc);
        // 4. Find the data control by name from the binding context
        DCDataControl dc = bc.findDataControl(dataControl);
        // 5. Access the application module data provider
        ApplicationModule am = (ApplicationModule)dc.getDataProvider();
        // 6. Cast the ApplicationModule to its client interface
        AppModule appMod = (AppModule)am;
        return appMod;
    }You can also do a variation without the database. You can also just set a private variable in your application module in the same way as described above.

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.

EDMS: 'Missing authorization for this functionality' when searching user

Hi,
I've activated ALC authorization for DMS. In EDMS, when trying to add an user to a DIR with search function an error occurres as below.
'Missing authorization for this functionality'
BTW, the user has contains SAP_ALL profile. It can't be any authorization reasons.
Regards,
Yemi

Hi,
authorization checks will not happen if the search help from sap-gui.I
think the problem is releted to missing implementation of "check
function module" from your side. If the search help is linked to a
"master data table" (type A) a check function must be implemented to
check the permission of the user.
This function module is read from table BAPIF4T. Please
check the following link: http://help.sa
p.com/saphelp_nw04/helpdata/en/a5/3eca044ac011d189
4e0000e829fbbd/content.htm
http://wiki.sdn.sap.com/wiki/display/PLM/Object+Link+search+in+EasyDMS
Regards,
Hari

I have downloaded IOS7 on my iPhone and all calendar events have disappeared. The general functions of the calendar have changed and are definitely not 'user friendly'. How can I retrieve my calendar events. Will Apple improve the calendar function

I have downloaded IOS7 on my iPhone and all calendar events have disappeared. The general functions of the calendar have changed and are definitely not 'user friendly'. How can I retrieve my calendar events. Will Apple improve the calendar function or revert to the previous system. Even the typing function on IOS 7 is faulty - very slow to respond to the keyboard. I no longer enjoy using my iPhone. Can anyone assist. Thank you

Very strange! All of my calendar events have reappeared. This has happened one week after downloading iOS 7
The calendar however, is not easy to use.
The typing function on the phone has become even slower. Have to wait for each letter to show on screen.

I want to check all functions of PCI 6534.I have read the user manual..I have some memory related questions.Please help me for that.

I want to check all functions of PCI 6534.I have read the user manual..I have some memory related questions.Please help me for that.
1.)If i am using the continuous output mode.and the size of generated data is less than 32 MB.If i want to preload the memory,what should i do?I want that first of all i load all my data to onboard memory & then i want to make start the transfer between 6534 & peripheral.Is it possible?As per me it should be.Plz tell me how should i do this?I think that in normal procedure the transfer between 6534-peripheral & outputting data from pc buffer to onboard memory works parallely.But i don't want this.Is it poss
ible?
(2).Similarly in finite input operation(pattern I/O) is it possible to preload the memory and then i read it?Because i think that the PC memory will be loaded automatically when 6534 acquires the data and then when we use DIO read vi the pc buffer data will be transferred to application buffer.If this is true,i do not want this.Is it possible?
(3) One more question is there if i am using normal operation onboard memory will be used bydefault right?Now if i want to use DMA and if i have data of 512 bytes to acquire.How will it work and how should i do it?Please tell me the sequence of operations.As per my knowledge in normal DMA operation we have 32 Bytes FIFO is there so after acquisition of 32 bytes only i can read it.How it will known to me that 32 bytes acquisition is complete?Next,If i want to acquire each byte separately using DMA interrupts what should i do?Provide me the name of sourse from which i can get details about onboard memory & DMA process of 6534 specifically
(4).In 6534 pattern Input mode,if i want to but only 10 bits of data.and i don't want to waste any data line what should i do?

Hi Vishal,
I'll try to answer your questions as best I can.
1) It is definitely possible to preload data to the 32MB memory (per group) and start the acquisition after you have preloaded the memory. There are example programs on ni.com/support under Example Code for pattern generation and the 6534 that demonstrate which functions to use for this. Also, if your PC memory buffer is less than 32MB, it will automatically be loaded to the card. If you are in continuous mode however, you can choose to loop using the on-board memory or you can constantly be reading the PC memory buffer as you update it with your application environment.
2) Yes, your data will automatically be loaded into the card's onboard memory. It will however be transferred as quickly as possible to the DMA FIFO on the card and then transferred to the PC memory buffer through DMA. It is not going to wait until the whole onboard memory is filled before it transfers. It will transfer throughout the acquisition process.
3) Vishal, searching the example programs will give you many of the details of programming this type of application. I don't know you application software so I can't give you the exact functions but it is easiest to look at the examples on the net (or the shipping examples with your software). Now if you are acquiring 512 bytes of data, you will start to fill your onboard memory and at the same time, data will be sent to the DMA FIFO. When the FIFO is ready to send data to the PC memory buffer, it will (the exact algorithm is dependent on many things regarding how large the DMA packet is etc.).
4) If I understand you correctly, you want to know if you waste the other 6 bits if you only need to acquire on 10 lines. The answer to this is Yes. Although you are only acquiring 10 bits, it is acquired as a complete word (16bits) and packed and sent using DMA. You application software (NI-DAQ driver) will filter out the last 6 bits of non-data.
Hope that answers your questions. Once again, the example code on the NI site is a great place to start this type of project. Have a good day.
Ron

USER DEFINED FUNCTION in the formula editor

How do you create a USER DEFINED FUNCTION in the formula editor using BADI

<a href="http://help.sap.com/saphelp_nw04/helpdata/en/04/f3683c05ea4464e10000000a114084/frameset.htm">This</a> may help.

How to distinguish the User-Defined-Function from Oracle Build-In function

Hi Friends,
I could get the function list form all_objects table by the SQL:
select * from all_objects where object_type = 'FUNCTION'
but there is no column in all_objects specify the function is build-in or user-defined.
But I found in SQL Server there is a column "is_ms_shipped" in the sys.all_objects table. This column will specify the object is build-in or user-defined. I want to get the equivalent column in Oracle but failed.
Could anyone tell me how to solve this problem?
Thanks,
Ricky

Thanks Pavan.
But if an user connects to database using "conn /as sysdba" syntax and creates a function. This user-defined funtion goes into the "SYS" schema also. I know it is not the best practise to create objects using sys user so I think your solution is right.
Regards,
Ricky

How to capture the User input value to user exist function module.

Hi,
How can i capture user input value.Here i am using User exist in BPS variable.
Calculating days using user exist functin module and my input is another variable i.e user defined value.
How can i capture user defined vaule into my function module.
This is very urgent can you help me..
Thanks....

Hi!
You can get the instance using the method get_instance of the class cl_sem_variable, and call the method get_value with the return. Check the example:
      CALL METHOD cl_sem_variable=>get_instance
        EXPORTING
          i_area       = (planning area)
          i_variable   = (variable name)
        RECEIVING
          rr_variable = lr_var
        EXCEPTIONS
          not_existing = 1
          OTHERS       = 2.
      CHECK sy-subrc IS INITIAL.
      CALL METHOD lr_var->get_value
        RECEIVING
          rto_value = et_value
        EXCEPTIONS
          error     = 1.
After this, read the first line of the table et_value (it should be the value that the user choose on the screen).
seeya!
Robson

Accessing container element in the User Defined Function

Hi All,
I am accessing a container element in the user defined function.
But it is not working. Actually i want to split a message(1800 records) into a batch of 200.
But it goes in a infinite loop.
Please can you tell me where i am wrong.
Smita
The code is :
public void SplitMsg(String[] a,ResultList result,Container container){
Object container1;
String counter;
int i,j=0;
container1 = container.getParameter("value");
if( container1 == null){
counter = "0";
else {
 counter = container.toString();
 j = Integer.valueOf(counter).intValue();
for ( i = j ; i <= j + 199 ; i++){
 if ( i >= a.length){
 container.setParameter("value","9999999");
 break;
 result.addValue(a);
 j += 200;
 counter = Integer.toString(j);
 container.setParameter("value", counter);

Here is another way to accomplish what you wanted.
For the target mapping, use this sequence for mapping
Source element -> removeContext -> Your User-defined Function -> Target Element
When defining User-Defined Function, select "Cache Queue" option.
Since you are using removeContext before calling the UserDefined function, your input to the user defined function will be a String array without ResultList.CC.
Now manipulate the array the way you want it, and build the ResultList result.
After every 200 records, use method
void addContextChange().
This will insert the ResultList.CC at the appropriate places.
Use Display Queue in the Mapping Editor to see the debug values.

What is the functional difference between the /Shared Items and the /Users/Shared folders?

Can someone shed some light on the difference, intended functionality between the /Shared Items and the /Users/Shared folders?

do any/all network services use the Shared Items folder?
Not all services use it. Time Machine Server does, and I'm not sure which others. FTP is not controlled by Server.app.

BW User Exit - Code in function of the query name

Hi,
I would like to create an user exit code which execute a algorithm different in function of the query executed. do you know in which variable is store the technical name of the query.
CASE query
    WHEN 'Z_ZAPO_001'.
       V1 = 1
    WHEN 'Z_ZAPO_002'.
      V1 = 2    WHEN '10' OR '11' OR '12'.
ENDCASE.

Yaroslav,
I_S_RKB1D-COMPID will never be filled for authorization user-exits (I_STEP = 0). Don't ask my why, I once raised this question to OSS and they replied it was never foreseen to work with authorization user-exits. God knows why, it's very unlogical and it wouldn't cost them a lot of work to get it working...
I could solve this problem by applying a little trick. In our queries we included a user-exit keydate variable. This will push the user-exit first in I_STEP = 1 mode where I_S_RKB1D-COMPID is filled. Then save the query name by exporting it to the ABAP-memory. Afterwards, the user exit with code for I_STEP = 0 will be processed and then you can import the query name from the ABAP memory.
I agree it sounds a little bit tricky but there is no better option I'm affraid.

Function Module to change the user status of a business transaction

Hi,
I want to change the user status of a business transaction. Plz let me know if there is a function module to change the user status.I found some FMs.
- CRM_STATUS_MAINTAIN_OW
- BBP_PROCDOC_STATUS_CHANGE_DIRE
- CRM_ORDER_CHANGE_STATUS
But these FM says that it has to be used for changing system status.
Thanx,
Sivagami.R

hi Siva,
here is some sample code :
data :
ip_guid type crmt_object_guid,
ls_status type crmt_status_com,
lt_status type crmt_status_comt,
ls_input_field type crmt_input_field,
ls_input_field_names type crmt_input_field_names,
lt_input_fields type crmt_input_field_tab,
lt_obj_guids type crmt_object_guid_tab,
ip_guid = <your guid>.
ls_status-ref_guid = IP_GUID.
ls_status-ref_kind = 'A'.
ls_status-status = lv_newstat.
ls_status-user_stat_proc = 'ZCRMCOM1'.
ls_status-activate = 'X'.
INSERT ls_status INTO TABLE lt_status.
ls_input_field-ref_guid = IP_GUID.
ls_input_field-ref_kind = 'A'.
ls_input_field-objectname = 'STATUS'.
ls_input_field_names-fieldname = 'ACTIVATE'.
INSERT ls_input_field_names INTO TABLE ls_input_field-field_names.
INSERT ls_input_field INTO TABLE lt_input_fields.
ls_input_field_names-fieldname = 'STATUS'.
INSERT ls_input_field_names INTO TABLE ls_input_field-field_names.
INSERT ls_input_field INTO TABLE lt_input_fields.
insert IP_GUID into table lt_obj_guids.
CALL FUNCTION 'CRM_ORDER_MAINTAIN'
EXPORTING
 it_status = lt_status
CHANGING
 ct_input_fields = lt_input_fields.
CALL FUNCTION 'CRM_ORDER_SAVE'
EXPORTING
 it_objects_to_save = lt_obj_guids
EXCEPTIONS
 OTHERS = 2.
COMMIT WORK.
please award points if helps
cheers

Function module to Delimit the roles assigned to the user

Hi All,
I am working on security role automation process abap report.My requirement is to delimit the roles assigned to the user on account of employee termination or retirement. I have used the function module "BAPI_USER_ACTGROUPS_ASSIGN" to delimit the role assigned to the user.
Passing the importing parameter "username" and in the Tables parameter"ACTIVITYGROUPS" passing the respective parameters AGR_NAME(Role), FROM_DAT(Start Date),TO_DAT(termination date - 1). When I passing the parameters as mentioned above,the role assigned to the user is getting deleted,instead of delimitation of the role assigned to the user.
Is there any other function module we can use to delmit the roles assigned to the user? Please help.
Regards,
Krishnan

hai,
please try this.
/VIRSA/RE_BAPI_CREATE_ROLE- Create Roles
/VIRSA/ROLE_ASSIGN_CUA_NH
/VIRSA/RE_BAPI_ROLE_TO_USERS
ASSIGN_USERS_HIERARCHY - User Assignment to Role - this is a Normal FM
try this bapis this may work
BAPI_USER_LOCK
- BAPI_USER_PROFILES_ASSIGN
- BAPI_USER_LOCPROFILES_ASSIGN
- BAPI_USER_LOCACTGROUPS_ASSIGN
- BAPI_USER_CHANGE
- BAPI_USER_UNLOCK

Function of the users in Oracle10g !

Similar Messages

Maybe you are looking for