Ordered Insert in DBAdapter

Hi,
I have developed a SOA 11g composite using BPEL and DBAdapter with native sequencing to generate the PK of an Oracle table.
Sending records in batch works fine, except that DBAdapter executes the insert statements in a different order than the input XML.
For example, if my input was:
<InvokeTargetTableInsert_insert_InputVariable>
<part name="TargetTableCollection">
<TargetTableCollection>
<ns0:TargetTable>
<ns0:messageId>123</ns0:messageId>
</ns0:TargetTable>
<ns0:TargetTable>
<ns0:messageId>456</ns0:messageId>
</ns0:TargetTable>
<ns0:TargetTable>
<ns0:messageId>789</ns0:messageId>
</ns0:TargetTable>
</TargetTableCollection>
</part>
</InvokeTargetTableInsert_insert_InputVariable>
, it may result in something like:
SEQ_NO MESSAGE_ID
100001 456
100002 789
100003 123
, so the order of the records ordered by PK is no longer the same of the original request (which is important in my case).
Is there a way to configure DBAdapter to enforce that records are sent to the database in the same order of the input message?
Thanks,
Sérgio

Hi,
You can still use DB adapter , and pass the primary key in the Header assigning the new element in the inbound/outbound wsdls created while configuring the adapter. This might help you to keep the uniqueness of the PK and abstract it from rest of Data Area.
Hope this helps !!
Reg,
MS

Similar Messages

Selecting data in order inserted

Hi,
What's the best way to guarantee selecting records from a table in the order they were inserted? Should there be a sequence on the table or can I use rowid?
Thanks
Sean

"rowid" will not guarantee:
sqlplus> create table t (
2 x number,
3 y char(2000) default 'x'
4 );
Table created.
sqlplus> insert into t (x) values (1);
1 row created.
sqlplus> insert into t (x) values (2);
1 row created.
sqlplus> insert into t (x) values (3);
1 row created.
sqlplus> insert into t (x) values (4);
1 row created.
sqlplus> insert into t (x) values (5);
1 row created.
sqlplus> insert into t (x) values (6);
1 row created.
sqlplus> insert into t (x) values (7);
1 row created.
sqlplus> insert into t (x) values (8);
1 row created.
sqlplus> select x from t order by rowid;
X
1
2
3
4
5
6
7
8
8 rows selected.
sqlplus> commit;
Commit complete.
sqlplus> delete from t where x in (3,4,5,6);
4 rows deleted.
sqlplus> commit;
Commit complete.
sqlplus> select x from t order by rowid;
X
1
2
7
8
sqlplus> insert into t (x) values (9);
1 row created.
sqlplus> insert into t (x) values (10);
1 row created.
sqlplus> commit;
Commit complete.
sqlplus> select x from t order by rowid;
X
1
2
9
10
7
8
6 rows selected.

How to order inserts ADF .

I need to insert child records before the parent in my ADF-BC code.
I can't use deferred constraints because of the multi Db policy I must follow.
Is there any way to reorder logical ADF insterts before actual inserts occurs in the DB.
Tks
Tullio

Sameera,
That site is illegally hosting "beta" copies of the oracle fusion applications docs, among other things.
Why not post a link to the official documentation (as I did)?
John

Oracle insert problem(records not in the order they are inserted)

hi, all:
I tried to insert a word list into a oracle table, everything is fine except that the words are not in the order they are inserted. For example, the words are inserted in the following sequence:
accreted
accreting
accretion
accretionary
accretive
bladebone
bladed
bladeless
bladelike
When I retrived the resultset from the table and iterate through each of the record, the words are not in the order inserted, i.e., it may look like this,
accreted
accreting
bladebone
bladed
accretion
accretionary
accretive
bladeless
bladelike
This strange phenomenon won't happen when the word list is small, like 500 words or so, but when the number of words reaches around 10,000, it takes place. My coworker also experienced this problem when trying to insert large volume of data into oracle table.
The code I used to insert into the DB table:
BufferedReader reader=new BufferedReader(new FileReader("C:\\Dictionary.txt"));
while( (line=reader.readLine())!=null )
     sql="INSERT INTO DICT " +
     "VALUES ('" + line +"')";
     statement.executeUpdate(sql);
Any advice will be highly appreciated,
thanks

Well, the best thing to do is follows scsi-boy's advice and add the additional column and either put a sequence number in it from the Java side as you insert, or use an Oracle sequence object to put a sequence number in it from the Oracle side (which is sort of like an auto-generated value, but different).
Note that an Oracle sequence generates numbers in sequence, but possibly with gaps (usually if the database is rebooted), unless you do some things that slow sequences down substantially. Sequences can also be something of a bottleneck on RAC clusters. See:
http://www.dizwell.com/oracle/articles/autonumbering.html
However, if your coworker is commiting after each and every insert (which is bad form and slows the database down, -10 points), and if your coworker is also never ever ever updating the columns after they've been inserted, and if your coworker is using Oracle 10g and not some older version such as 9i, then your coworker could use the ORA_ROWSCN pseudo-column to order by. Those are very very severe constraints and you shouldn't begin to consider doing it that way without a very good reason, and right now you and your coworker wouldn't know a good reason if it snuck up and bit you on the butt, you've got a lot of learning the basics first.

Best way to determine insertion order of items in cache for FIFO?

I want to implement a FIFO queue. I plan on one producer placing unprocessed Orders into a cache. Then multiple consumers will each invoke an EntryProcessor which gets the oldest unprocessed order, sets it processed=true and returns it. What's the best way to determine the oldest object based on insertion order? Should I timestamp the objects with a trigger when they're added to the cache and then index by that value? Or is there a better way? maybe something coherence automatically saves when objects are inserted? Also, it's not critical that the processing order be precisely FIFO, close is good enough.
Also, since the consumer won't know the key value for the object it will receive, how could the consumer call something like this so it doesn't violate Constraints on Re-entrant Calls? http://wiki.tangosol.com/display/COH34UG/Constraints+on+Re-entrant+Calls
Thanks,
Andrew

Ok, I think I can see where you are coming from now...
By using a queue for each for each FIX session then you will be experiencing some latency as data is pushed around inside the cluster between the 'owning node' for the order and the location of the queue; but if this is acceptable then great. The number of hops within the cluster and hence the latency will depend on where and how you detect changes to your orders. The advantage of assiging specific orders to each queue is that this will not change should the cluster rebalance; however you should consider what happens if the node controlling a specific FIX session is lost - do you recover from FIX log? If so where is that log kept? Remember to consider what happens if your cluster splits, such that the node with the FIX session is still alive, but is separated from the rest of the cluster. In examining these failure cases you may decide that it is easier to use Coherence's in-built partitioning to assign orders to sessions father than an attribute of order object.
snidely_whiplash wrote:
Only changes to orders which result in a new order or replace needing to be sent cause an action by the FIX session. There are several different mechanisms you could use to detect changes to your orders and hence decide if they need to be enqueued:
1. Use a post trigger that is fired on order insert/update and performs the filtering of changes and if necessary adds the item to the FIX queue
2. Use a cache store that does the same as (1)
3. Use an entry processor to perform updates to the order object (as I believe you previously mentioned) and performs logic in (1)
4. Use a CQC on the order cache
5. A map listener on the order cache
The big difference between 1-3 and 4, 5 is that the CQC is i) a SPOF ii) not likely located in the same place as your order object or the queue (assuming that queue is in fact an object in another cache), iii) asynchronously fired hence introducing latency. Also note that the CQC will store your order objects locally whereas a map listener will not.
(1) and (3) will give you access to both old and new values should that be necessary for your filtering logic.
Note you must be careful not to make any re-entrant calls with any of 1-3. That means if you are adding something to a FIX queue object in another cache (say using an entry processor) then it should be on a different cache service.
snidely_whiplash wrote:
If I move to a CacheStore based setup instead of the CQC based one then any change to an order, including changes made when executions or rejects return on the FIX session will result in the store() method being called which means it will be called unnecessarily a lot. It would be nice if I could specify the CacheStore only store() certain types of changes, ie. those that would result in sending a FIX message. Anything like that possible?There is negligible overhead in Coherence calling your store() method; assuming that your code can decide if anything FIX-related needs to be done based only on the new value of the order object then this should be very fast indeed.
snidely_whiplash wrote:
What's a partitioned "token cache"?This is a technique I have used in the past for running services. You create a new partitioned cache into which you place 'tokens' representing a user-defined service that needs to be run. The insertion/deletion of a token in the backing map fires a backing map listener to start/stop a service +(not there are 2 causes of insert/delete in a backing map - i) a user ii) cluster repartitioning)+. In this case that service might be a fix session. If you need to designate a specific member on which a service needs to run then you could add the member id to the token object; however you must be careful that unless you write your own partitioning strategy the token will likely not live on the same cache member as the token indicates; in which case you would want a ful map listener or CQC to listen for tokens rather than a backing map listener
I hope that's useful rather than confusing!
Paul

RESPAREA? - authorisations on Internal Order groups?

Hi together,
is it possible to restrict on Internal Order Groups in authorisation Object RESPAREA?
I know its possible for Profitcenter groups etc.. with PH / HI / KN..
But what about Internal Order groups?
SIngle Internal Orders I can restrict via OR
Thank you

Hi Nicola,
In your internal order group you might have created so many lower level groups. but any how in any of the group through EDIT- order- insert order option you have insert the order number...
If you assign the order numbers in lower level option ... system will give error message...
If helpful assign points
Cheers
PK

Order Interface Example

Hello,
I need an example on how to insert data into the oe_headers_interface and oe_lines_interface for order insert and cancellation, does anyone has this examples and show them to me so I can use them in a procedure. Do I need to also populate de PO open interface tables? Please advice.
Also does anyone know if there a way that once an order is created in application base tables, be able to updated thru an api or an interface?
Thanks for your quick responses.

-- To cancel Order lines
INSERT INTO OE_LINES_IFACE_ALL
(order_source_id
,ORIG_SYS_DOCUMENT_REF
,orig_sys_line_ref
,CHANGE_SEQUENCE
,operation_code
,created_by
,creation_date
,last_updated_by
,last_update_date)
SELECT orl.order_source_id,orl.orig_sys_document_ref,orl.orig_sys_line_ref,-100,'CANCEL',23583,SYSDATE,23583,SYSDATE
FROM pel_sx_orders a,oe_order_headers_all orh,oe_order_lines_all orl
WHERE SHIPTYPE = 'BN'
AND EXISTS ( SELECT 1 FROM pel_sx_orders b WHERE b.ordernum=a.ordernum AND a.parent=b.line)
AND a.ordernum = orh.orig_sys_document_ref
AND orh.header_id = orl.header_id
AND orl.line_number=a.line
AND orl.cancelled_flag <> 'Y'
INSERT INTO oe_headers_iface_all
(order_source_id
,ORIG_SYS_DOCUMENT_REF
,CHANGE_SEQUENCE
,operation_code
,created_by
,creation_date
,last_updated_by
,last_update_date
,force_apply_flag)
SELECT DISTINCT orl.order_source_id,orl.orig_sys_document_ref,-100,'UPDATE',23583,SYSDATE,23583,SYSDATE,'Y'
FROM pel_sx_orders a,oe_order_headers_all orh,oe_order_lines_all orl
WHERE SHIPTYPE = 'BN'
AND EXISTS ( SELECT 1 FROM pel_sx_orders b WHERE b.ordernum=a.ordernum AND a.parent=b.line)
AND a.ordernum = orh.orig_sys_document_ref
AND orh.header_id = orl.header_id
AND orl.line_number=a.line
AND orl.cancelled_flag <> 'Y'
INSERT INTO oe_actions_iface_all
(order_source_id
,ORIG_SYS_DOCUMENT_REF
,orig_sys_line_ref
,CHANGE_SEQUENCE
,operation_code)
SELECT orl.order_source_id,orl.orig_sys_document_ref,orl.orig_sys_line_ref,-100,'CANCEL'
FROM pel_sx_orders a,oe_order_headers_all orh,oe_order_lines_all orl
WHERE SHIPTYPE = 'BN'
AND EXISTS ( SELECT 1 FROM pel_sx_orders b WHERE b.ordernum=a.ordernum AND a.parent=b.line)
AND a.ordernum = orh.orig_sys_document_ref
AND orh.header_id = orl.header_id
AND orl.line_number=a.line
AND orl.cancelled_flag <> 'Y'
I used these scripts recently you may want to modify them accordingly,after this run the Order Import program

Texts from sales order to invoice

Good morning,
I am a new forum user and I have a question. With SAP I create a sales order inserting in header and in item position some texts; I save the order and when I want to see print preview of yhis order, I see the texts in it. But creating the invoice from the order, SAP doesn't copy the texts into the new invoice; texts aren't copied. WHy? Can you help me in some way? Thanks
Francesco

Dear Fra,
Do these settings to copy the sales order text to the invoice.First you need to copy the sales order text to the delivery document from the delivery document you can copy the text to the billing document.
To copy the sales order text to the delivery document
You do the text determination for the deliveries also,define and maintain same TextId in the delivery header text procedure ,maintain the access sequence ,in the delivery text procedure access sequence you put the Text Object as VBBK for that Text ID.
To copy the delivery text to the invoice.
You do the text determination for the billing document,define and maintain same TextId in the billing document text procedure and maintain the access sequence,after that
Go to VOFA transaction then selct billing document type then go in to the details screen here you do the check in the Delivery Text check Box (Top most bottom of the screen.)
Now you can able to copy the sales order text to the invoice.
Use VOTXN transaction for Text determinetion
I hope this will help you,
Regards,
Murali.

Release budget for internal order

Dear SAP experts,
In our scenario (classic scenario) from an approved SC a PO is created in the backend, with reference to a specific internal order, inserted from the requestor in the SC.
Suppose 10 items are ordered each of value 10 (so PO total value is 100), but only 9 items are delivered. When we create confirmation in SRM, the order will always remain partially confirmed.
My question is: how can we “release” that delta budget (100-90) from the internal order?
Thanks,
Ci

Hi Ajay,
thanks for you answer.
I already checked that if the PO refers to a contract, the value of the PO against a specific position of the contract is correctly updated (in the example above, is set to 90 and not 100, after final invoice is checked), so I think that the behavior is similar for internal order budget.
However, how can I check if the internal order budget has been released? Is there a list of committments related to a specific order? (I'm sorry if these are basic questions, but I am new to FI-CO issues).
Thanks a lot,
Ci

Best Effort Resequening in SOA Mediator

Hello,
I am trying to implementing best effort resequencing in mediator, our set up is
source table: notification_queue, it has these fields
id(possible value: UUID)
priority(possible value: 1 or 2)
uun(possible value: s12, s22, s34 etc. id for an identity)
xml(possible value: it holds our business data as xml)
date_modified(the date/time this row is inserted)
A DBAdapter is created to constantly poll above table, we set as 10 rows per poll, and these 10 rows are passed into mediator then bpel process to process.
We implemented best effort resequencing in mediator, we aim to let the mediator sort the data i.e. 10 rows in correct order, the configuration is
Group by: uun
ID by: priority
For example, if the data in the table are
row 1: uun S12 with priority 1
row 2: uun S32 with priority 2
row 3: uun S12 with priority 2
row 4: uun S32 with priority 1
After DBAdapter picks this up and mediator resequences it according to Group by: uun, ID by: priority, it should have
S12 - 1
S12 - 2
S32 - 1
S32 - 2
or
S32 - 1
S32 - 2
S12 - 1
S12 - 2
so it should group by uun, and order by priority as above(we don't care if S12 comes first or S32 comes first, as long as they are grouped together and the order within the group is correct)
What I've seen the actual results are just random without any resequencing ...
The problem is more than likely is either (1). mediator resequencing doesn't work as advertised or (2). our mediator configuration is incorrect, but again, there isn't much to be configured apart from setting Group and ID.
Does anyone successfully implemented Best Effort Resequencing in Mediator? Any help is much appreciated.
Thank you in advance,
Best Regards,
Michael

Hello S.Ananth,
Thanks for your suggestion!
I tried to set Max Rows to 1 in Best Effort resequencer, and inserted the following rows in order
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('1', 'S12', '2', 'S12-2');
commit;
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('2', 'S12', '3', 'S12-3');
commit;
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('3', 'S12', '1', 'S12-1');
commit;
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('4', 'S23', '1', 'S23-1');
commit;
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('5', 'S23', '3', 'S23-3');
commit;
insert into NOTIFICATION_QUEUE(ROW_ID, UUN, NOTIFICATION_PRIORITY, XML)
values('6', 'S23', '2', 'S23-2');
commit;
I set Group by UUN, ID by notification_prioirty, Max row as 1, I run a few tests, results are random, for example
S12-1
S23-1
S23-3
S23-2
S12-2
S12-3
S23 is not sorted as expected, (1-3-2)...
Regarding of Standard Resequencer option, unfortunately we can not used it, our real real case have prioirty 1 to 10, and and it is not incrementing by 1, for example, 1,3,4,7,8.
Best Regards,
Michael

Oracle 10gR2 WebService Call-In & Call-Out via PL/SQL (Step-by-Step Guide)

Hi Everyone,
This guide is for those of you who tried to Call-In and Call-Out WebService via Oracle 10gR2 using PL/SQL but failed a couple of times, re-installed a couple of times and retry, got it to work but don't know what made it work scenarios.
Hope this helps ;-)
Thanks,
Henry Wu
Instructions on how to use Oracle10gR2 Webservice Call-Out feature (Oracle JAX-RPC DII - Dynamic Invocation (DII) APIs)
PREREQUISITE
=================================================================
1. Download Oracle Database 10g Release 2 (10.2.0.1.0) (ZIP, ~655MB)
http://www.oracle.com/technology/software/products/database/oracle10g/htdocs/10201winsoft.html
http://download.oracle.com/otn/nt/oracle10g/10201/10201_database_win32.zip
1.1 Choose Enterprise Edition
2. Download 10.1.3.1 Callout Utility for 10g (R1 +R2) RDBMS (ZIP, ~13MB)
http://download.oracle.com/technology/sample_code/tech/java/jsp/dbws-callout-utility-10131.zip
2.1 Extract to C:\oracle\product\10.2.0\db_1\dbws_callout_utility_10131
3. Download OC4J Standalone - Oracle Containers for J2EE (OC4J) 10g Release 3 (10.1.3.3) (ZIP, ~93MB; Pure Java—runs on all certified platforms)
http://www.oracle.com/technology/software/products/ias/index.html (Download Site)
http://download.oracle.com/otn/java/oc4j/101330/oc4j_extended_101330.zip
3.1 Extract to C:\oracle\product\10.2.0\db_1\oc4j_extended_101330
STEP-BY-STEP PROCEDURES
=================================================================
1. Prepare the database
1.1 Connect to SYS account (or any account that can connect as SYSDBA)
1.2 alter system set shared_pool_size=96M scope=both
1.3 alter system set java_pool_size=80M scope=both
1.4 ALTER USER SCOTT ACCOUNT UNLOCK;
1.5 ALTER USER SCOTT IDENTIFIED BY "tiger";
1.6 ALTER USER SCOTT QUOTA UNLIMITED ON USERS;
1.7 GRANT PUBLIC TO SCOTT;
1.8 GRANT Create Public Synonym TO SCOTT;
2. Load Oracle SOAP client to SCOTT (for Oracle 10g Release 2 Database)
2.1 Commands
2.1.1 Open command prompt (cmd.exe)
2.1.2 loadjava -u scott/tiger -r -v -f -genmissing -s -grant public C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\webservices\lib\soap.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\lib\dms.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\jlib\javax-ssl-1_1.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\lib\servlet.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\lib\mail.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\lib\activation.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\lib\http_client.jar C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\lib\ejb.jar
2.1.3 It will take around 3 minutes and you will see "something" like the following when it completes (count may not be exact) :
Classes Loaded: 909
Resources Loaded: 75
Sources Loaded: 0
Published Interfaces: 0
Classes generated: 0
Classes skipped: 0
Synonyms Created: 984
Errors: 0
2.1.3 Close this command prompt
3. Load Oracle JAX-RPC client to SYS (for Oracle 10g Release 2 Database)
3.1 Commands
3.1.1 Open command prompt (cmd.exe)
3.1.2 loadjava -u sys/oracle -r -v -f -genmissing -s -grant public C:\oracle\product\10.2.0\db_1\dbws_callout_utility_10131\sqlj\lib\dbwsclientws.jar C:\oracle\product\10.2.0\db_1\dbws_callout_utility_10131\sqlj\lib\dbwsclientdb102.jar
3.1.2.1 It will take around 15 minutes and you will see "something" like following when it completes (count may not be exact) :
Classes Loaded: 4027
Resources Loaded: 81
Sources Loaded: 0
Published Interfaces: 0
Classes generated: 61
Classes skipped: 0
Synonyms Created: 4108
Errors: 0
3.1.3 Close this command prompt
4. Execute UTL_DBWS packages to SYS (for Oracle 10g Release 2 Database)
4.1 Commands
4.1.1 Connect to SYS account only
4.1.2 Execute the following (in TOAD you should execute them as Script, press the "thunder" button)
4.2.1 @"C:\oracle\product\10.2.0\db_1\dbws_callout_utility_10131\sqlj\lib\utl_dbws_decl.sql"
4.2.2 @"C:\oracle\product\10.2.0\db_1\dbws_callout_utility_10131\sqlj\lib\utl_dbws_body.sql"
4.2.3 CREATE PUBLIC SYNONYM utl_dbws FOR sys.utl_dbws;
5. Call-out a free Web Service using SCOTT
5.1 Commands
5.1.1 Connect to user SCOTT with password of TIGER
5.1.2 Copy and Paste the following "Anonymous Block" (sample #1) and execute it :
5.1.2.1 It sould return "PL/SQL DII client return ===> Redwood City"
declare
service_ utl_dbws.SERVICE;
call_ utl_dbws.CALL;
service_qname utl_dbws.QNAME;
port_qname utl_dbws.QNAME;
operation_qname utl_dbws.QNAME;
string_type_qname utl_dbws.QNAME;
retx ANYDATA;
retx_string VARCHAR2(1000);
retx_double number;
retx_len number;
params utl_dbws.ANYDATA_LIST;
l_input_params utl_dbws.anydata_list;
l_result ANYDATA;
l_namespace VARCHAR2(1000);
begin
-- open internet explorer and navigate to http://webservices.imacination.com/distance/Distance.jws?wsdl
-- search for 'targetNamespace' in the wsdl
l_namespace := 'http://webservices.imacination.com/distance/Distance.jws';
-- search for 'service name' in the wsdl
service_qname := utl_dbws.to_qname(l_namespace, 'DistanceService');
-- this is just the actual wsdl url
service_ := utl_dbws.create_service(HTTPURITYPE('http://webservices.imacination.com/distance/Distance.jws?wsdl'), service_qname);
-- search for 'portType name' in the wsdl
port_qname := utl_dbws.to_qname(l_namespace, 'Distance');
-- search for 'operation name' in the wsdl
-- there will be a lot, we will choose 'getCity'
operation_qname := utl_dbws.to_qname(l_namespace, 'getCity');
-- bind things together
call_ := utl_dbws.create_call(service_, port_qname, operation_qname);
-- default is 'FALSE', so we make it 'TRUE'
utl_dbws.set_property(call_, 'SOAPACTION_USE', 'TRUE');
-- search for 'operation soapAction' under <wsdl:operation name="getCity">
-- it is blank, so we make it ''
utl_dbws.set_property(call_, 'SOAPACTION_URI', '');
-- search for 'encodingstyle' under <wsdl:operation name="getCity">
utl_dbws.set_property(call_, 'ENCODINGSTYLE_URI', 'http://schemas.xmlsoap.org/soap/encoding/');
-- search for 'binding style'
utl_dbws.set_property(call_, 'OPERATION_STYLE', 'rpc');
-- search for 'xmlns:xs' to know the value of the first parameter
-- under <wsdl:message name="getCityResponse"> you will see the line <wsdl:part name="getCityReturn" type="xsd:string" />
-- thus the return type is 'string", removing 'xsd:'
string_type_qname := utl_dbws.to_qname('http://www.w3.org/2001/XMLSchema', 'string');
-- in the line <wsdl:operation name="getCity" parameterOrder="zip">
-- the parameterOrder is 'zip', thus we put in 'zip'
-- the 'ParameterMode.IN' is used to specify that we will be passing an "In Parameter" to the web service
-- the 'ParameterMode.IN' is a constant variable in the sys.utl_dbws package
utl_dbws.add_parameter(call_, 'zip', string_type_qname, 'ParameterMode.IN');
utl_dbws.set_return_type(call_, string_type_qname);
-- supply the In Parameter for the web service
params(0) := ANYDATA.convertvarchar('94065');
-- invoke the web service
retx := utl_dbws.invoke(call_, params);
-- access the returned value and output it to the screen
retx_string := retx.accessvarchar2;
dbms_output.put_line('PL/SQL DII client return ===> ' || retx_string);
-- release the web service call
utl_dbws.release_service(service_);
end;
5.1.3 Copy and Paste the following "Anonymous Block" (sample #2) and execute it :
5.1.3.1 It should return "PL/SQL DII client return ===> twelve thousand three hundred and forty five"
declare
service_ utl_dbws.SERVICE;
call_ utl_dbws.CALL;
service_qname utl_dbws.QNAME;
port_qname utl_dbws.QNAME;
operation_qname utl_dbws.QNAME;
string_type_qname utl_dbws.QNAME;
retx ANYDATA;
retx_string VARCHAR2(1000);
retx_double number;
retx_len number;
params utl_dbws.ANYDATA_LIST;
l_input_params utl_dbws.anydata_list;
l_result ANYDATA;
l_namespace VARCHAR2(1000);
begin
-- open internet explorer and navigate to http://www.dataaccess.com/webservicesserver/numberconversion.wso?WSDL
-- search for 'targetNamespace' in the wsdl
l_namespace := 'http://www.dataaccess.com/webservicesserver/';
-- search for 'service name' in the wsdl
service_qname := utl_dbws.to_qname(l_namespace, 'NumberConversion');
-- this is just the actual wsdl url
service_ := utl_dbws.create_service(HTTPURITYPE('http://www.dataaccess.com/webservicesserver/numberconversion.wso?WSDL'), service_qname);
-- search for 'portType name' in the wsdl
port_qname := utl_dbws.to_qname(l_namespace, 'NumberConversionSoap');
-- search for 'operation name' in the wsdl
-- there will be a lot, we will choose 'NumberToWords'
operation_qname := utl_dbws.to_qname(l_namespace, 'NumberToWords');
-- bind things together
call_ := utl_dbws.create_call(service_, port_qname, operation_qname);
-- default is 'FALSE', so we make it 'TRUE'
utl_dbws.set_property(call_, 'SOAPACTION_USE', 'TRUE');
-- search for 'operation soapAction' under <operation name="NumberToWords">
-- it is blank, so we make it ''
utl_dbws.set_property(call_, 'SOAPACTION_URI', '');
-- search for 'encodingstyle'
-- cannot find xml tag 'encodingstyle', so we just use the following as the generic encoding style
utl_dbws.set_property(call_, 'ENCODINGSTYLE_URI', 'http://schemas.xmlsoap.org/soap/encoding/');
-- search for 'binding style'
-- although 'document' was used, it produced an error, thus we will use 'rpc'
-- this value is generally only 'document' or 'rpc'
utl_dbws.set_property(call_, 'OPERATION_STYLE', 'rpc');
-- search for 'xmlns:xs' to know the value of the first parameter
-- under <xs:element name="NumberToWords"> you will see the line <xs:element name="ubiNum" type="xs:unsignedLong" />
-- thus the return type is 'unsignedlong', removing 'xs:'
-- however, upon testing, using 'unsignedlong' produced an error, while 'string' did not, so we will use 'string'
string_type_qname := utl_dbws.to_qname('http://www.w3.org/2001/XMLSchema', 'string');
-- under <xs:element name="NumberToWords"> you will see the line <xs:element name="ubiNum" type="xs:unsignedLong" />
-- the element name is 'ubiNum', thus we put in 'ubiNum'
-- the 'ParameterMode.IN' is used to specify that we will be passing an "In Parameter" to the web service
-- the 'ParameterMode.IN' is a constant variable in the utl_dbws package
utl_dbws.add_parameter(call_, 'ubiNum', string_type_qname, 'ParameterMode.IN');
utl_dbws.set_return_type(call_, string_type_qname);
-- supply the In Parameter for the web service
params(0) := ANYDATA.convertvarchar('12345');
-- invoke the web service
retx := utl_dbws.invoke(call_, params);
-- access the returned value and output it to the screen
retx_string := retx.accessvarchar2;
dbms_output.put_line('PL/SQL DII client return ===> ' || retx_string);
-- release the web service call
utl_dbws.release_service(service_);
end;
NOTES AND REFERENCES
=================================================================
This detailed step-by-step guide was produced with the following guide http://www.oracle.com/technology/sample_code/tech/java/jsp/callout_users_guide.htm
I could still not load Oracle JAX-RPC client to SCOTT (step 4) as it produces an error. See the following for more details :
http://forums.oracle.com/forums/thread.jspa?threadID=633219&tstart=0
Also, I could not consume some of the other free Web Services out there for reasons I don't know, hope someone can help clarify. See the following for more details :
http://forums.oracle.com/forums/thread.jspa?threadID=630733&tstart=0
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
Instructions on how to use Oracle10gR2 Webservice Call-In feature
PREREQUISITE
=================================================================
1. Download Oracle Database 10g Release 2 (10.2.0.1.0) (ZIP, ~655MB)
http://www.oracle.com/technology/software/products/database/oracle10g/htdocs/10201winsoft.html
http://download.oracle.com/otn/nt/oracle10g/10201/10201_database_win32.zip
1.1 Choose Enterprise Edition
2. Download OC4J Standalone - Oracle Containers for J2EE (OC4J) 10g Release 3 (10.1.3.3) (ZIP, ~93MB; Pure Java—runs on all certified platforms)
http://www.oracle.com/technology/software/products/ias/index.html (Download Site)
http://download.oracle.com/otn/java/oc4j/101330/oc4j_extended_101330.zip
2.1 Extract to C:\oracle\product\10.2.0\db_1\oc4j_extended_101330
STEP-BY-STEP PROCEDURES
=================================================================
1. Connect to SYS account and create user STORE
CREATE USER store IDENTIFIED BY store;
GRANT connect, resource TO store;
2. Connect to Oracle using the user STORE and password STORE
CONNECT store/store;
3. Execute the following objects for this excercise
CREATE SEQUENCE order_sq;
CREATE TABLE product_types (
product_type_id INTEGER
CONSTRAINT product_types_pk PRIMARY KEY,
name VARCHAR2(10) NOT NULL
CREATE TABLE products (
product_id INTEGER
CONSTRAINT products_pk PRIMARY KEY,
product_type_id INTEGER
CONSTRAINT products_fk_product_types
REFERENCES product_types(product_type_id),
name VARCHAR2(30) NOT NULL,
description VARCHAR2(50),
price NUMBER(5, 2)
CREATE TABLE customers (
customer_id INTEGER
CONSTRAINT customers_pk PRIMARY KEY,
first_name VARCHAR2(10) NOT NULL,
last_name VARCHAR2(10) NOT NULL,
dob DATE,
phone VARCHAR2(12)
CREATE TABLE orders (
order_id INTEGER
CONSTRAINT orders_pk PRIMARY KEY,
product_id INTEGER
CONSTRAINT purchases_fk_products
REFERENCES products(product_id),
customer_id INTEGER
CONSTRAINT purchases_fk_customers
REFERENCES customers(customer_id),
quantity INTEGER NOT NULL
INSERT INTO customers (
customer_id, first_name, last_name, dob, phone
) VALUES (
1, 'John', 'Brown', '01-JAN-1965', '800-555-1211'
INSERT INTO product_types (
product_type_id, name
) VALUES (
1, 'Book'
INSERT INTO products (
product_id, product_type_id, name, description, price
) VALUES (
1, 1, 'Modern Science', 'A description of modern science', 19.95
COMMIT;
CREATE OR REPLACE PACKAGE dbfunc AS
FUNCTION place_order (
p_product_id INTEGER,
p_customer_id INTEGER,
p_quantity INTEGER
RETURN VARCHAR2;
END dbfunc;
CREATE OR REPLACE PACKAGE BODY dbfunc AS
FUNCTION place_order (
p_product_id INTEGER,
p_customer_id INTEGER,
p_quantity INTEGER
RETURN VARCHAR2 IS
v_customer_count INTEGER;
v_product_count INTEGER;
v_order_id INTEGER;
BEGIN
-- count the number of products with the
-- supplied p_product_id (should be 1 if the product exists)
SELECT COUNT(*)
INTO v_product_count
FROM products
WHERE product_id = p_product_id;
IF v_product_count = 0 THEN
RETURN 'No such product';
END IF;
-- count the number of customers with the
-- supplied p_customer_id (should be 1)
SELECT COUNT(*)
INTO v_customer_count
FROM customers
WHERE customer_id = p_customer_id;
IF v_customer_count = 0 THEN
RETURN 'No such customer';
END IF;
-- get the next value from orders_sq
SELECT order_sq.nextval
INTO v_order_id
FROM dual;
-- place the order
INSERT INTO orders (
order_id, product_id, customer_id, quantity
) VALUES (
v_order_id, p_product_id, p_customer_id, p_quantity
COMMIT;
RETURN 'Order placed with id of ' || v_order_id;
EXCEPTION
WHEN OTHERS THEN
ROLLBACK;
RETURN 'Order not placed';
END place_order;
END dbfunc;
4. Install and Configure OC4J
4.1 Change Directory
4.1.1 Open command prompt (cmd.exe)
4.1.2 CD C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\bin
4.2 Configure Environment variables (type in command prompt)
4.2.1 set JAVA_HOME=C:\oracle\product\10.2.0\db_1\jdk
4.2.2 set ORACLE_HOME=C:\oracle\product\10.2.0\db_1\oc4j_extended_101330
4.3 Starting OC4J for the first time
4.3.1 oc4j -start
4.3.2 If this is not your first time to "start" oc4j, go to step 4.3.4
4.3.3 Set oc4jadmin password (use the password "oracle" w/o the quotation marks)
08/03/21 17:13:54 Set OC4J administrator's password (password text will not be displayed as it is entered)
Enter password:
Confirm password:
Confirm password: The password for OC4J administrator "oc4jadmin" has been set.
08/03/21 17:14:01 The OC4J administrator "oc4jadmin" account is activated.
4.3.4 OC4J has started if you see the message :
08/03/21 17:14:16 Oracle Containers for J2EE 10g (10.1.3.3.0) initialized
4.3.5 Leave this command prompt open
4.4 Configure Data Source
4.4.1 Open a new command prompt via the cmd.exe command
4.4.2 type "hostname" and then press enter
4.4.3 Keep this command prompt open for later use
4.4.4 Open Windows Explorer and navigate to the folder C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\config
4.4.5 Open the file data-sources.xml
4.4.6 Modify and Save the file so that it will look something like the following :
4.4.6.1 Note that "hpv2710us" is my hostname found in step 4.4.2
4.4.6.2 Note that "ORCLDEV" is the name of my Oracle Instance. (Default installation uses ORCL only)
<connection-pool name="Example Connection Pool">
<connection-factory factory-class="oracle.jdbc.pool.OracleDataSource"
user="store"
password="store"
url="jdbc:oracle:thin:@//hpv2710us:1521/ORCLDEV">
</connection-factory>
</connection-pool>
4.4.7 Close the text editor
4.4.8 Close the Windows Explorer
4.4.9 Close this command prompt (type exit)
5. Publishing a PL/SQL Package as a Database Web Service
5.1 Create the config.xml file
5.1.1 Open Notepad.exe
5.1.2 Copy and Paste the following :
5.1.2.1 Note that "hpv2710us" is my hostname found in step 4.4.2
5.1.2.2 Note that "ORCLDEV" is the name of my Oracle Instance. (Default installation uses ORCL only)
<web-service>
<display-name>PLSQL Web Service</display-name>
<description>PLSQL Sample</description>
<destination-path>./dbfunc.ear</destination-path>
<temporary-directory>/tmp</temporary-directory>
<context>/plsqlsample</context>
<stateless-stored-procedure-java-service>
<jar-generation>
<schema>store/store</schema>
<db-url>jdbc:oracle:thin:@hpv2710us:1521:ORCLDEV</db-url>
<prefix>db.func.place.order</prefix>
<db-pkg-name>dbfunc</db-pkg-name>
</jar-generation>
<uri>/dbfunc</uri>
<database-JNDI-name>jdbc/OracleDS</database-JNDI-name>
</stateless-stored-procedure-java-service>
<wsdl-gen>
<wsdl-dir>wsdl</wsdl-dir>
<option name="force">true</option>
<option name="httpServerURL">http://localhost:8888</option>
</wsdl-gen>
<proxy-gen>
<proxy-dir>proxy</proxy-dir>
<option name="include-source">true</option>
</proxy-gen>
</web-service>
5.1.3 Save file as config.xml in the directory C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\config
5.1.3.1 Note it should be config.xml and not config.txt
5.1.4 Close the text editor
5.2 Publish dbfunc Oracle Package as a Web Service
5.2.1 Open a new command prompt via the cmd.exe command
5.2.2 CD C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home
5.2.3 mkdir ear
5.2.4 CD ear
5.2.5 set ORACLE_HOME=C:\oracle\product\10.2.0\db_1\oc4j_extended_101330
5.2.6 set CLASSPATH=.;%ORACLE_HOME%\webservices\lib\wsdl.jar;%ORACLE_HOME%\lib\xmlparserv2.jar;%ORACLE_HOME%\soap\lib\soap.jar
5.2.7 java -jar %ORACLE_HOME%\webservices\lib\WebServicesAssembler.jar -config C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\config\config.xml
Please wait ...
STORE.DBFUNC
5.2.8 java -jar %ORACLE_HOME%\j2ee\home\admin_client.jar deployer:oc4j:localhost:23791 oc4jadmin oracle -deploy -file C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home\ear\dbfunc.ear -deploymentName dbfunc
08/03/21 17:46:23 Notification ==>Application Deployer for dbfunc COMPLETES. Operation time: 296 msecs
5.2.9 java -jar %ORACLE_HOME%\j2ee\home\admin_client.jar deployer:oc4j:localhost:23791 oc4jadmin oracle -bindWebApp -appname dbfunc -webModuleName dbfunc_web
5.2.10 java -jar %ORACLE_HOME%\j2ee\home\admin_client.jar deployer:oc4j:localhost:23791 oc4jadmin oracle -bindAllWebApps -appname dbfunc
5.2.11 Close this command prompt (type exit)
6. Test dbfunc Web Service
6.1 Restart OC4J
6.1.1 Open the command prompt you used to start OC4J in step 4.1.1/4.3.1
6.1.2 In the keyboard, hit Ctrl+C
6.1.2.1 Type "Y" and then hit Enter
08/03/21 18:02:51 Shutting down OC4J...
Terminate batch job (Y/N)? Y
6.1.2.2 Note that the command prompt should still be open
6.1.2.2.1 If you accidentally closed the command prompt just do the following
6.1.2.2.1.1 Do 4.1.1 to 4.2.2 and then proceed to 6.1.3
6.1.3 oc4j -start
Starting OC4J from C:\oracle\product\10.2.0\db_1\oc4j_extended_101330\j2ee\home...
08/03/21 18:07:57 Oracle Containers for J2EE 10g (10.1.3.3.0) initialized
6.1.4 Leave this command prompt open
6.2 Use the Web Service to "Order an Item"
6.2.1 Connect to Oracle using the user STORE and password STORE
6.2.2 select * from orders
6.2.2.1 Zero row should return
6.2.3 Open Internet Explorer
6.2.4 Navigate to http://localhost:8888/plsqlsample/dbfunc
6.2.5 Input the following :
6.2.5.1 param0 value: 1
6.2.5.2 param1 value: 1
6.2.5.3 param2 value: 10
6.2.6 Click the Invoke button
6.2.7 A pop-up window will appear having the following contents :
<?xml version="1.0" encoding="UTF-8" ?>
- <SOAP-ENV:Envelope xmlns:SOAP-ENV="http://schemas.xmlsoap.org/soap/envelope/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema">
- <SOAP-ENV:Body>
- <ns1:placeOrderResponse xmlns:ns1="http://db.func.place.order/dbfunc.wsdl" SOAP-ENV:encodingStyle="http://schemas.xmlsoap.org/soap/encoding/">
<return xsi:type="xsd:string">Order placed with id of 1</return>
</ns1:placeOrderResponse>
</SOAP-ENV:Body>
</SOAP-ENV:Envelope>
6.2.8 Go back to SQLPLUS or Toad and execute "select * from orders" again
6.2.8.1 There should be one row
ORDER_ID, PRODUCT_ID, CUSTOMER_ID, QUANTITY
1, 1, 1, 10
NOTES AND REFERENCES
=================================================================
This detailed step-by-step guide was produced with the following article by Jason Price http://www.oracle.com/technology/pub/articles/price_10gws.html

Success!!!
I had to grant this permissions:
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.lang.RuntimePermission', 'getClassLoader', '' );
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.lang.RuntimePermission', 'accessClassInPackage.sun.util.calendar', '' );
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.lang.RuntimePermission', 'setFactory', '' )
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.util.PropertyPermission', 'HTTPClient.socket.idleTimeout', 'write' );
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.net.SocketPermission', 'localhost', 'resolve' );
call dbms_java.grant_permission( 'WS_TEST', 'SYS:java.net.SocketPermission', '127.0.0.1:8084', 'connect,resolve' );
As I wrote earlier, WS_TEST is my user into which I load JAX-RPC client. Note that, if you load JAX-RPC client into user another than SYS, you have NOT to use -s -grant public option (wassam wrote about this too). Another thing is that I (finally) didn't load OC4J. To consume WebService I use utl_dbws.invoke(call_Handle CALL, request SYS.XMLTYPE) function.
voytec001

Collection inaccessible from Before Header process

Hi,
I have a form based on the Matrix Order application. There's a collection-based report with a bunch of text fields that can be updated and a column with a "Remove" item that basically calls a conditional Before Header process to remove the item from the collection. What I want to do is update the collection (with the values that the end-user may have entered in the updateable columns) prior to removing any item. So when the user clicks on "remove", first I do an update_member_attribute and finally I remove the item the user chose. My problem is that the updates are skipped altogether; the code is not even executed, but the removal is. It's like the collection doesn't exist at one point, but exists the next. I added an insert into a dummy table to see how many items the collection had, and it returned zero. However, the delete worked just fine. Can you have a look at my code, to see if I'm missing something obvious? Thanks a lot!
Here's the code in the Before Header:
--Here we find out how many rows in the collection
select count(*) into c from apex_collections where collection_name = 'ORDER';
insert into table1 (column1) values ('to update '||i); --This inserts "to update 0" into my dummy table.
--Update collection - nice try!
FOR x IN 1..APEX_APPLICATION.g_f01.COUNT --This code is skipped; according to the previous select, the collection has 0 rows
LOOP
c := x;
apex_collection.update_member_attribute
( p_collection_name => 'ORDER',
p_seq => APEX_APPLICATION.g_f03 (x),
p_attr_number => 4,
p_attr_value => APEX_APPLICATION.g_f01 (x) );
apex_collection.update_member_attribute
( p_collection_name => 'ORDER',
p_seq => APEX_APPLICATION.g_f03 (x),
p_attr_number => 6,
p_attr_value => APEX_APPLICATION.g_f02 (x) );
END LOOP;
--This works fine, however!!!
apex_collection.delete_member(p_collection_name => 'ORDER', p_seq => :P612_SEQ_ID);
I've tried placing the code in a "On submit" process but it's never executed. I guess that the links on report columns are not considered submits, just redirects or something else.
Gabe

There is data, though:
<tr onmouseover="row_mouse_over5754815862961903(this, 1)" onmouseout="row_mouse_out5754815862961903(this, 1)"><td class="t15data" >21</td><td class="t15data" >Zapatos marrones</td><td class="t15data" >115</td><td class="t15data" ><*label for="f01_0001"* class="hideMe508">C004</label><input type="text" name="f01" size="15" maxlength="2000" value="1" id="f01_0001" /></td><td class="t15data" >898989</td><td class="t15data" ><label for="f02_0001" class="hideMe508">C006</label><input type="text" name="f02" size="15" maxlength="2000" value="75" id="f02_0001" /></td><td class="t15data" >Zapatos de cuero marron horribles</td><td class="t15data" ><img src="/i/minus.gif" border="0" title="Eliminar" alt="Icon 1"><label for="f03_0001" class="hideMe508">SEQ_ID</label><input type="hidden" name="f03" value="1" id="f03_0001" /><input type="hidden" name="fcs" value="AA82BB7B2A984AD8C1B429F5F782B915" /></td></tr><tr onmouseover="row_mouse_over5754815862961903(this, 2)" onmouseout="row_mouse_out5754815862961903(this, 2)"><td class="t15data" >22990</td><td class="t15data" >V/vs. bordado</td><td class="t15data" > - </td><td class="t15data" ><label for="f01_0002" class="hideMe508">C004</label><input type="text" name="f01" size="15" maxlength="2000" value="1" id="f01_0002" /></td><td class="t15data" >099900866</td><td class="t15data" ><label for="f02_0002" class="hideMe508">C006</label><input type="text" name="f02" size="15" maxlength="2000" value="" id="f02_0002" /></td><td class="t15data" >V/vs. bordado</td><td class="t15data" ><img src="/i/minus.gif" border="0" title="Eliminar" alt="Icon 1"><label for="f03_0002" class="hideMe508">SEQ_ID</label><input type="hidden" name="f03" value="2" id="f03_0002" /><input type="hidden" name="fcs" value="096444F9ABCDC797CE35E5A694057CF4" /></td></tr><tr onmouseover="row_mouse_over5754815862961903(this, 3)" onmouseout="row_mouse_out5754815862961903(this, 3)"><td class="t15data" >22990</td><td class="t15data" >V/vs. bordado</td><td class="t15data" > - </td><td class="t15data" ><label for="f01_0003" class="hideMe508">C004</label><input type="text" name="f01" size="15" maxlength="2000" value="1" id="f01_0003" /></td><td class="t15data" >099900866</td><td class="t15data" ><label for="f02_0003" class="hideMe508">C006</label><input type="text" name="f02" size="15" maxlength="2000" value="" id="f02_0003" /></td><td class="t15data" >V/vs. bordado</td><td class="t15data" ><img src="/i/minus.gif" border="0" title="Eliminar" alt="Icon 1"><label for="f03_0003" class="hideMe508">SEQ_ID</label><input type="hidden" name="f03" value="3" id="f03_0003" /><input type="hidden" name="fcs" value="DA834BD62491260D28F63E05662DDD97" /></td></tr><tr onmouseover="row_mouse_over5754815862961903(this, 4)" onmouseout="row_mouse_out5754815862961903(this, 4)"><td class="t15data" >22993</td><td class="t15data" >V/salerno-2003-rosa/celeste</td><td class="t15data" > - </td><td class="t15data" ><label for="f01_0004" class="hideMe508">C004</label><input type="text" name="f01" size="15" maxlength="2000" value="1" id="f01_0004" /></td><td class="t15data" >169780340</td><td class="t15data" ><label for="f02_0004" class="hideMe508">C006</label><input type="text" name="f02" size="15" maxlength="2000" value="" id="f02_0004" /></td><td class="t15data" >V/salerno-2003-rosa/celeste</td><td class="t15data" ><img src="/i/minus.gif" border="0" title="Eliminar" alt="Icon 1"><label for="f03_0004" class="hideMe508">SEQ_ID</label><input type="hidden" name="f03" value="4" id="f03_0004" /><input type="hidden" name="fcs" value="51CCCCF026D1C8F9350AA019CDCA3432" /></td></tr><tr>
Edited by: Gab2 on Oct 26, 2009 12:40 PM

Error -2147417851 when writing report to Excel

I have taken the Active-X example code where a table is written to Excel and a macro is run and adjusted it to fit my purposes. In my case, an array is written to an Excel file and thereafter a macro is run which creates some graphs and a report. This works fine on my computer with Windows 95. But, when running it on the computer it is supposed to be used on, Excel gives an access error 0xc0000005 just before a copy operation resulting in the "error -2147417851 ocurred at the server through an exception at my.vi". I am using LabVIEW full development 6.1, Windows NT 4 with the latest SP and Office 97 SP2 both wit and without all upgrades. However, if I change my macro so that it doesn't do the copy operation, it works just fi
ne, and the error is delayed until I close the document. Since my LabVIEW vi ends when the macro is completed, I don't get any error in LabVIEW.
I have searched Microsoft technet and tried the suggestions I found there, read all similar problems I could find here (I found four) but nothing seems to help. I have also tried it on a machine with XP and Office 97 SP2. The macro works fine there without modification and LabVIEW ends without error and I can even close my Excel document without errors, but when I try to quit Excel I get the same error message as always, only a different address.
I have tried to terminate the refnums in different order, inserted a delay and so on, but nothing seems to help. I still believe the error is related to LabVIEW, since my macro runs without error when launched from Excel, but I encounter the same error if the macro is launched from Excel with LabVIEW open in the background, even without open vi:s.
I have run out of ideas, and even if I am abl
e to create the reports, it doesn't feel good when Excel crashes every time. Any help would be much appreciated.
Thanks

Hi Paol,
Try looking at this answer posted a while ago it may help.
http://exchange.ni.com/servlet/ProcessRequest?RHIVEID=101&RNAME=ViewQuestion&HOID=506500000008000000192E0000&ECategory=LabVIEW.LabVIEW+General

My B+Tree can compile but have runtime error ... i can't tink why ...

Sorry to bother anyone ... i have spent almost 3 weeks trying to debug the problem...
My B+ Tree can compile but can't run as it throw invalid Null pointer Exception ..
I suspected the error is in the split (int order ) method in the BTreeNode class but i can't remedy for it
This my program code
public class BTree {
* The order of the B-Tree. All nodes of the B-Tree can store up to 2*order key values.
private int order;
* The number of key (with associated data values) stored in the B-Tree.
private int count;
* The root node of the B-Tree
private BTreeNode root;
* The first leaf node in the B-Tree. This field is used to give the starting point for sequential
* access to the keys and data stored in the leaf nodes.
private BTreeNode first;
* The last leaf node in the B-Tree. This field is used to give the starting point for reverse
* sequential access to the keys and data stored in the leaf nodes.
private BTreeNode last;
* A change count that can be used to invalidate iterators. This field is updated whenever a key plus data pair
* is added to the B-Tree (or the data associated with a key is changed), or when a key plus data pair are
* deleted from the B-Tree.
private int changeCount = 0;
// WHEN DOING ASSIGNMENT 5, DO NOT ADD ANY ADDITIONAL FIELDS TO THIS CLASS
// You will loose marks if you add additional fields to this class. The fields above are all that
// you need. If you need a variable in a method, use a local variable. I have seen too many
// assignments where students add fields rather than create local variables. Hopefull the threat
// of loosing (quite a few) marks will help reduce this habit.
* A general exception class for errors when constructing or manipulating a B-Tree. Use the string
* parameter to the constructor to say what the error really is.
public class BTreeError extends RuntimeException {
public BTreeError(String reason) {
super(reason);
* A constructor that creates an empty B-Tree of the given order.
* This is the only constructor provided at the moment for this BTree class. Could consider
* adding the equivalent of a 'copy constructor' that creates a new BTree object from an existing
* BTree object.Constructor
* creates the root of a btree
* A constructor that creates an empty B-Tree of the given order.
* This constructor need to copy the order parameter to the field of same name, and initialise the
* root, cound, first and last fields of the BTree object.
* @param order The order of the BTree.
public BTree(int order) {
count = 0;
this.order = order;
root = new BTreeNode(true, null, -1, null, null);
first = root;
last = root;
* A method to return a SequentialIterator object that is positioned just before the first key
* of the BTree object.
* Do not modify this method.
* @return A SequentialIterator object.
public SequentialIterator iterator() {
return new BTreeIterator();
* A mehtod to return a SequentialIterator object that is positioned at a key found through a call
* to the searchFor() method.
* Do not modify this method.
* @param position A SearchPosition() object that usually has been returne by a call to the searchFor() method.
* @return A SequentialIterator object initialised to start at particular key in the BTree.
public SequentialIterator iterator(SearchPosition position) {
return new BTreeIterator(position);
* A method to return a string representationo the BTree.
* The format of the string is:
* <pre>BTree: Order=<digits>, size=<digits>, root=<BTreeNode string></pre>
* Do not modify this method.
* @return A string to represent the BTree
public String toString() {
StringBuffer s = new StringBuffer("BTree: Order=");
s.append(order).append(", size=").append(size()).append(", root=").append(root.toString());
return s.toString();
* Method to determine the number of records stored in the B-Treee.
* Do not modify this method
* @return the number of records in the B-Tree.
public int size() {
return count;
* method to return the order of the B-Tree.
* 
* This is the smallest number of key values for all nodes
* except the root node. The maximum number of key values in a node is 2*order, and the maximum number
* of child nodes for a node is 2*order+1.
* Do not modify this method.
* @return The order of the B-tree.
public int order() {
return order;
* Insert a key plus data value into the BTree.
* This method needs to locate the leaf node in which the key + data value should be
* inserted, and then call the insertLeaf() method of BTreeNode to do the insertion.
* This method will always result in a change to the BTree, so it should increment
* the change count.
* The method may result in only the data associated with an existing ke being changed,
* so incrementing the count field should be done in the BTreeNode method (if needed).
* This is one of the method you need to complete for assignment 5.
* @param key The key associated with the data value to be added to the B-Tree
* @param data The data value to be added (with it's associated key) to the B-Tree.
public void add(Comparable key, Object data) {
// you need to add the code for this method
// i added
BTreeNode btNode = root;
while (!btNode.isLeaf) {
int i=0;
while(key.compareTo(btNode.keys) > 0) {
i++;
if (i == btNode.numberOfKeys) break;
btNode = btNode.childNodes[i];
btNode.insert(key,data);
if (root.numberOfKeys == order*2-1) root.split(order);
* insert a object with the given key into the tree
//KeyNode keyNode = new KeyNode(key, data);
// BTreeNode keyNode = new BTreeNode(key,data);
BTreeNode btNode = root;
while (!btNode.isLeaf) {
int i=0;
while(key.compareTo(btNode.key(i)) > 0) {
i++;
if (i == btNode.numberOfKeys())
break;
btNode = btNode.child(i); }
System.out.println("hmm1");
btNode.insert(key,data );
System.out.println("hmm2");
if (root.numberOfKeys == order*2-1)
System.out.println("hmm3");
root.split(order);
System.out.println("hmm4");
* This method searches the B-Tree for an occurence of the key in a leaf node and returns the result
* of the search in a SearchPosition object.
* Note that the key may occur in an interior node of the BTree without occuring in the leaf
* nodes. This can be the result of a deletion operation. This method need to search down to the
* leaf node that should contain the key if the key and associated data is in the B-Tree, and then
* scan through the keys in the leaf node for the search key.
* The result of the search is returned as a SearchPosition object, as this allow the return
* of the success or failure of the search, as well as the data belonging to the key. It also
* allows position information to be returned so that an interator can be initialised with the
* key as the starting position for subsequent sequential access to adjacent keys.
* This is one of the method you need to implement.
* Implementation nodes: 
* You need to find the leaf node that may contain the key (same code as for add()), then
* scan the leaf BTreeNode for the search tree. You can do this within this method, as you
* have total access to the fields and methods of BTreeNode (as BTreeNode is an inner class
* of BTree). If you find the key, construct and return a SearchPosition object with the appropriate
* details of the position, otherwise construct add return a SearchPosition object that indicates the
* search failed.
* @param key The key to search for in the BTree
* @return A SearchPosition object returning the data and position information for the search
public SearchPosition searchFor(Comparable key) {
// You need to add the code for this method. The code below simply creates a
// SearchPosition object which indicates an unsuccessful search.
return new SearchPosition(false, null, -1);
* A method to delete a node from the BTree.
* The method should return the data object that was deleted when the key plus data object pair
* are deleted from the B-tree.
* The method should throw a BTreeError exception (with an appropriate reason string) if the
* key is not found in the B-tree.
* This is a method you can implement for bonus marks in Assignment 5.
* Implementation notes: 
* The easiest way to proceed is to use searchFor() to determine if they key is in the BTree, and
* (if it is in the B-tree) to return position information about the key. Throw an exception if the
* key is not in the B-tree, otherwise keep a copy of the data assocaited with the key (to return),
* then for the leaf node containing the key (a BTreeNode object), call the deleteLeafNodeKey() method,
* passing across the leaf key index of the key (so you don't have to find it again in the leaf node).
* After this method deletes the key, return the data you saved as the method result.
* @param key The key to delete (along with it's associated data) from the B-tree.
* @return The data associated with the key that was deleted.
public Object delete(Comparable key){
// You need to add the code for this method.
return null;
* The inner class BTreeNode is used to represent the nodes in the B-Tree.
* The nodes in the BTree are of two types:
* <ol>
* <li>Leaf nodes that contain the keys and associated data values, stored in ascending key order. 
* These leaf nodes have next and previous pointers to adjacent leaf nodes to allow an easy
* implementation of an iterator class to provide bi-directional sequential access to the keys stored
* in the BTree nodes.
* <li>Interior nodes that contain keys and links to child nodes (that are either all internal nodes
* or all leaf nodes), organised as the node of a multi-way search tree. The interior nodes have
* one more child node link than keys. The child node link at index k is to a node with keys that
* are all less than the key at index k in this node. The link at index k+1 is to a child node
* with keys that are all greater than or equal to the key at index k.
* </ol>
* The BTreeNode class allows you to create these two 'types' of nodes, depending on the parameters
* passed to the constructor.
* There are methods that should only be called for leaf nodes and methods that should only be
* called for interior nodes. These methods should throw an exception if called by the wrong node
* type. This class should really be designed using inheritance to mimic the pascal/C++ variant
* record structure, but this design is relatively easy to understand and to implement.
* Note that this class is an inner class of BTree, and so all objects will have an implict
* reference to the BTree container object. This class has direct access to all the fields of the
* BTree contaner object. In particular, the order of the BTree is available, hence this class
* does not need to keep a copy of the order as a field.
* Skeleton class provided for Objects and Algorithms Assignment 5
* Only modify the methods where the JavaDoc indicates that you need to provide code.
* @author a.sobey
* @version 1.0
* Date: 16/05/2005
public class BTreeNode {
* The actual number of key values stored in the BTreeNode. Note that the BTree node has an implicit
* reference to the containing BTree object, and the maximum number of nodes that can be stored in a
* a BTreeNode (except temporarily during the split operation) is twice the order of the BTree. 
* This field is valid for both internal and leaf nodes.
private int numberOfKeys = 0;
* The array of pointers to child nodes of this node. Only (numberOfKeys+1) are valid if numberOfKeys
* is non-zero. 
* This array is only valid and created for internal nodes - this array is not created for leaf nodes. 
* There is space in the array created for one additional child node link - this makes the coding for
* splitting of an internal node easier to implement.
private BTreeNode[] childNodes;
* A reference to the parent node of this node. 
* This link is null if this node is the root node of the tree of BTreeNodes. 
* This node is valid for both internal and leaf nodes.
private BTreeNode parent;
* The index in the parent node's array of links (the childNodes array) for the link to this node. 
* This value should be set to -1 if this node is the root node (and so has no parent node). 
* This field is valid for both internal and leaf nodes.
private int parentIndex;
* A link to the next leaf node in the B-tree, provided to allow easy sequential access of the keys
* and values stored in the B-tree. 
* This field is only valid if the node is a leaf node. For non-leaf nodes set the value to null. 
* For leaf nodes, set the value to null if this node is the last leaf node in the B-tree.
private BTreeNode next;
* The link to the previous leaf node in the B-tree, provided ot allow easy reverse sequential access of the keys
* and values stored in the B-Tree. 
* This values should be set to null if this node is a leaf node but is the first leaf node in the B-Tree, or
* if this node is not a leaf node. 
* This field is only used in leaf nodes.
private BTreeNode previous;
* An array of comparable key objects that are stored in this node of the B-tree. 
* Only the first numberOfKey values in the array are valid. 
* The maximum number of keys in a node is 2*order, however there is space in this array
* for one additional value to make the coding of the node splitting operation easier to implement. 
* This field is valid for both internal and leaf nodes.
private Comparable[] keys;
* An array of data values associated with the keys stored in this leaf node of the B-tree. 
* Only the first numberOfKey values are valid. 
* The maximum number of data values in a node is 2*order, however there is space in this array
* for one additional value to make the codingof the leaf node splitting operation easier to implement. 
* This field is only valid for leaf nodes - for interior nodes this array is not created.
private Object[] data;
* A boolean value to indicate if the node is a leaf node or not. The structure of the remainder of the node
* depends on this value (would be nice to have variant records in Java ...). 
* This field is valid for both leaf and internal nodes.
private boolean isLeaf;
private int order;
* The constructor for a BTreeNode.
* The code for the constructor is provided - do not modify this constructor.
* @param isLeaf True if this node is a leaf node.
* @param parent A link to the parent node or null if this node is the root node of the B-Tree
* @param parentIndex The index of the link in the array of child node linkes in the parent node that points to this node.
* @param previous A link to the previous leaf node for sequentail access, or null if not a leaf node or no previous leaf nodes.
* @param next A link to the next leaf node for sequential access, or null if not a leaf node or the last leaf node.
public BTreeNode(boolean isLeaf, BTreeNode parent, int parentIndex, BTreeNode previous, BTreeNode next) {
this.parent = parent;
this.parentIndex = parentIndex;
this.previous = previous;
this.next = next;
this.isLeaf = isLeaf;
if (isLeaf)
data = new Object[2 * order + 1];
else
childNodes = new BTreeNode[2 * order + 2];
keys = new Comparable[2 * order + 1];
public BTreeNode( int order, BTreeNode parent)
this.order = order;
this.parent=parent;
this.keys = new Comparable[2*order-1];
this.data = new Object[2*order-1];
this.childNodes=new BTreeNode[2*order];
this.isLeaf=true;
* Returns the number of keys in this BTreeNode. Note that within the code in BTree you have access
* to all the fields of BTreeNode, so this method is not strictly necessary.
* @return The number of keys in this BTreeNode object.
public int numberOfKeys() {
return numberOfKeys;
* Returns the container BTree object for this BTreeNode object. You may like to check that container objects
* are the same when manipulating two BTreeNode objects.
* @return the containing BTree object.
public BTree container() {
return BTree.this;
* A private method to return a string representation of the array keys. This method is used in
* the toString() method for this class. 
* Do not modify the code provided for this method.
* @return A string representation of this nodes array of keys.
private String keyString() {
StringBuffer s = new StringBuffer("{");
for (int index = 0; index < numberOfKeys; index++)
s.append(index > 0 ? "," + keys[index] : keys[index]);
return s.append("}").toString();
* A private method to return a string representation of the array of data values stored in a leaf node. 
* This method is used in the toString() method of BTreeNode. The method does not check if this node is a
* leaf node, as it is not intended to be called directly from outside of this class, and the toString()
* method only calls this method if the node is a leaf node. 
* Do not modify the provided code for this method.
* @return a string representation of the data values array of a BTreeNode.
private String dataString() {
StringBuffer s = new StringBuffer("(");
for (int index = 0; index < numberOfKeys; index++)
s.append(index > 0 ? "," + data[index] : data[index]);
return s.append(")").toString();
* A private method to return a string prepresentation of the array of child node links in an interior node. 
* This method is used in the toString() method. This method does not check if this node is an interior
* node, so you must take care to only call this method for interior nodes. 
* Do not modify the provided code for this method.
* @return A string representation of the array of child nodes of this BTreeNode.
private String childString() {
StringBuffer s = new StringBuffer("<");
for (int index = 0; index < numberOfKeys + 1; index++)
s.append(childNodes[index] + (index == numberOfKeys ? "" : ","));
return s.append(">").toString();
* The toString method provides a string representation of a BTreeNode. This particular method does not
* include the details of all the fields of a BTreeNode. While debugging your code, you may like to include
* more information (such as the parentIndex value), but in your final submission you must have the code
* as provided in the skeleton BTreeNode class provided to you.
* @return A string representation of a BTreeNode.
public String toString() {
if (isLeaf)
return (new StringBuffer("[")).append(numberOfKeys)
// .append(',').append(parentIndex) // uncomment this line if need to check parentIndex values
.append(',').append(keyString()).append(',').append(dataString()).append(']').toString();
else
return (new StringBuffer("[")).append(numberOfKeys)
//.append(',').append(parentIndex) // uncomment this line if need to check parentIndex values
.append(',').append(keyString()).append(',').append(childString()).append(']').toString();
* Returns the key with the given index in this node. Throws a BTreeError exception if the index is not valid. 
* Do not modify this provided code.
* @param index The index of the key.
* @return The key value at the given index.
public Comparable key(int index) {
if (index < 0 || index >= numberOfKeys)
throw new BTreeError("Key index out of range - value = " + index);
return keys[index];
* Returns the child node at the provided index into the childNodes array. 
* A BTreeError exception is thrown if the node is not an internal
* node or if the index is not valid.
* Note that the child node returned will have keys that are all less than the key stored
* in the keys array of this node at the given index value (except the last childNode
* at index numberOfkeys, as this node has keys that are all greater than or equal to the last
* key value stored in this node). 
* Do not modify the provided code for this method.
* @param index The index into the array of child nodes for this internal BTreeNode object.
* @return The child node link.
public BTreeNode child(int index) {
if (isLeaf) throw new BTreeError("child() called for a leaf node");
if (index < 0 || index > numberOfKeys)
throw new BTreeError("Child node index out of range - value = " + index);
return childNodes[index];
* Returns the data value associated with the key at the given index. An BTreeError exception is thrown if the
* node is not a leaf node or if the index is invalid.
* Do not modify the provided code for this method.
* @param index The index of the key assocaited with the data value.
* @return The data value associated with the key with given index.
public Object data(int index) {
if (!isLeaf) throw new BTreeError("data() called for an internal node");
if (index < 0 || index >= numberOfKeys)
throw new BTreeError("Data index out of range - value = " + index);
return data[index];
* This method is used to determine if this node is a leaf node.
* @return True if this node is a leaf node.
public boolean isLeaf() {
return isLeaf;
* Inserts the (key, data) pair into this BTreeNode object.
* You must supply the code for this method.
* Implementation notes: 
* <ol>
* <li>Throw an exception if this node is not a leaf node.
* <li>Scan the keys array for index of the key greater than or equal to the insertion key.
* <li>If the key at the index is equal to the insertion key, update the data field and return - you are done.
* <li>Otherwise shuffle the keys values from the insertion index along to make a hole for the insertion key,
* and insert the insertion key into the keys array. Do the same for the data array values to insert the
* new data value into the data array at the insertion index.
* <li>increment the number of keys, and increment the container BTree object's count field.
* <li>If the number of keys in the node is now no more than 2*order, you are done, so simply return.
* <li>Otherwise the node has (2*order+1) key values, and need to split. The split operation leaves the first
* order keys and data values in this node (and so the node's numberOfKeys value will become
* order, and moves the remaining (order + 1) keys and data values to a new BTreeNode leaf node
* that you need to create. 
* You need to fix up the previous and next fields of this leaf node and the new leaf node you have created. 
* Two sub-cases:
* <ol>
* <li>If this node is the root node (i.e., it does not have a parent node), the split of this node will create
* a new root node, with a single key (the key at index (order+1)) and this node and the new BTreeNode as
* the child nodes. In my solution I used a call to the method newRootNode to do this. The newRootNode()
* method will also be used when a split of an interior node creates a new root node. See the JavaDoc for
* details of what the newRootNode() method should do. Once the new root node has been created, and all
* the fields updated due to the split, you are done.
* <li>Otherwise we need to insert in this node's parent node the middle key (at index (order+1) and the
* new node that we created. This is done by the method insertInterior(). The method is passed the
* key to insert (at location this.parentIndex in the keys array of the parent node), the index to
* to insert the key (this.parentIndex), and the new leaf node (that will be inserted at index
* (this.parentIndex+1) in the parent node's child links array).
* </ol>
* </ol>
* @param key The key to insert into the leaf node.
* @param data The key's corresponding data value.
public void insertLeaf(Comparable key, Object data) {
// You need to provide the code for this method.
// BTreeNode temp = new
int size = this.data.length;
int counter = 0;
this.keys[size] = key;
this.data[size] = data;
sort(size);
public int compareTo(Comparable o2) {
// Integer o1 = (Integer) o2;
return (((Integer)o2).compareTo(this));
*split()
*Splits a node into to nodes. This can only be done, if the node is full
*The midlest key go up into the parent, the left ones of them rest in
*this node, and the right ones go into a new node.
private BTreeNode split(int order) {
if (numberOfKeys == order*2-1) {
BTreeNode right = null;
if (parent == null) { // algo for the root-node
BTreeNode left = new BTreeNode(order, this);
right = new BTreeNode(order, this);
for (int i=0; i<order-1; i++) {
left.keys[i] = keys[i];
left.data[i] = data[i];
right.keys[i] = keys[order+i];
right.data[i] = data[order+i];
if (!isLeaf()) {
for (int i=0; i<order; i++) {
left.childNodes[i] = childNodes[i];
left.childNodes[i].parent = left;
right.childNodes[i] = childNodes[order+i];
right.childNodes[i].parent = right;
left.isLeaf = false;
right.isLeaf = false;
} else isLeaf = false;
keys[0] = keys[order-1];
numberOfKeys = 1;
left.numberOfKeys = order-1;
right.numberOfKeys = order-1;
for (int i=1; i<order*2-1; i++) {
keys[i] = null;
data[i] = null;
childNodes[i+1] = null;
childNodes[0] = left;
childNodes[1] = right;

* Don't post that much code. There should never be a reason to. You should be able to break your code down into small enough pieces that you can post a small example that demonstrates your problem.
* When you do post code, use [code] and [/code] tags to make it readable. You can use the code button on the message entry page.
* The stack trace will tell you which line the NPE occurred on, where it was called from, where that was called from, etc. You can use that to help you find your error. Look at the line it's complaining about. What references are on that line followed by a dot, and what arrays do you try to access the elements of. One of those must be null.
* Now that you know what[b] is null, put in a bunch of print statements to track [b]how it got to be null.

Creating F4 help with customized values in selection screen

Hi Dear friends
 In my report i have two input flds at selection screen i.e. sales order no and date description.Now based on sales order no the F4 help in the fld date description should change dynamically.eg. if there are two sales document number 001 and 002 and the corresponding date description for 001 are 123 and 234 and for 002 are 987 and 876 .Then if i select 001 the F4 help in date description should contain 123,234 and for 002 it should contain 987,876 before pressing the execute button.How to achieve this. Plz help me. i tried to use AT-SELECTION SCREEN ON VALUE REQUEST event but its not giving any out put as in the SELECT query i putted a WHERE condition where sales document of the database table equals to the sales order inserted in the selection screen. But when i debugg the input sales order parameter shows blank.

Try this way
REPORT ZVENKAT_F4_FOR_PARAMETERS MESSAGE-ID zmsg .
TYPES:
 BEGIN OF t_t001w,
 werks TYPE t001w-werks,
 name1 TYPE t001w-name1,
 END OF t_t001w,
 t_return_tab TYPE ddshretval.
DATA:
 w_t001w TYPE t_t001w,
 w_return_tab TYPE t_return_tab.
DATA:
 i_t001w TYPE STANDARD TABLE OF t_t001w,
 i_return_tab TYPE STANDARD TABLE OF t_return_tab.
SELECTION-SCREEN BEGIN OF BLOCK b1 WITH FRAME.
PARAMETERS :p_werks TYPE t001w-werks,
 p_name1 TYPE t001w-name1.
SELECTION-SCREEN END OF BLOCK b1.
AT SELECTION-SCREEN ON VALUE-REQUEST FOR p_werks.
PERFORM f4_help_for_palant.
*& Form f4_help_for_palant
FORM f4_help_for_palant.
DATA:
 w_dynpfields TYPE dynpread,
 i_dynpfields LIKE STANDARD TABLE OF dynpread.
IF i_t001w[] IS INITIAL.
 SELECT werks name1
 FROM t001w
 INTO TABLE i_t001w.
ENDIF.
CALL FUNCTION 'F4IF_INT_TABLE_VALUE_REQUEST'
 EXPORTING
 retfield = 'WERKS'
 dynpprog = sy-repid
 dynpnr = sy-dynnr
 dynprofield = 'P_WERKS'
 value_org = 'S'
 TABLES
 value_tab = i_t001w
 return_tab = i_return_tab.
IF sy-subrc <> 0.
* MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
* WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.
READ TABLE i_return_tab INTO w_return_tab INDEX 1.
p_werks = w_return_tab-fieldval.
READ TABLE i_t001w INTO w_t001w WITH KEY werks = p_werks.
IF sy-subrc = 0.
 w_dynpfields-fieldname = 'P_NAME1'.
 w_dynpfields-fieldvalue = w_t001w-name1.
 APPEND w_dynpfields TO i_dynpfields.
 CLEAR w_dynpfields.
 CALL FUNCTION 'DYNP_VALUES_UPDATE'
 EXPORTING
 dyname = sy-repid
 dynumb = sy-dynnr
 TABLES
 dynpfields = i_dynpfields.
ENDIF.
ENDFORM. " f4_help_for_palant
Thanks
Venkat.O

Ordered Insert in DBAdapter

Similar Messages

Maybe you are looking for