zoukankan      html  css  js  c++  java
  • Oracle EBS AR 删除应收发票

    DECLARE
       -- Non-scalar parameters require additional processing 
       p_errors arp_trx_validate.message_tbl_type;
    
       CURSOR cur_t IS
          SELECT l.customer_trx_id, l.trx_number
            FROM ra_customer_trx_all l
           WHERE l.org_id = 122;
       l_return_status VARCHAR2(3000);
       l_msg_count     NUMBER;
       l_msg_data      VARCHAR2(3000);
    BEGIN
       mo_global.init('AR');
       mo_global.set_policy_context('S'122);
    
       fnd_global.apps_initialize(user_id => 0,
                                  
                                  resp_id => 50757,
                                  
                                  resp_appl_id => 222);
       FOR rec_t IN cur_t LOOP
          -- Call the procedure
          ar_invoice_api_pub.delete_transaction(p_api_name        => 'cux_delete_txn',
                                                p_api_version     => 1,
                                                p_customer_trx_id => rec_t.customer_trx_id,
                                                p_return_status   => l_return_status,
                                                p_msg_count       => l_msg_count,
                                                p_msg_data        => l_msg_data,
                                                p_errors          => p_errors);
       
          IF l_return_status <> 'S' THEN
             dbms_output.put_line('trx:' || rec_t.trx_number);
             dbms_output.put_line('trx1:' || rec_t.customer_trx_id);
             dbms_output.put_line('E:' || cux_util.dump_error_stack);
          
          END IF;
       
       END LOOP; --FOR rec_t IN cur_t LOOP
    END;
    /*SELECT COUNT(1) FROM ra_customer_trx_all l WHERE l.org_id = 122;
    */
    土豆君
  • 相关阅读:
    多重背包POJ1276不要求恰好装满 poj1014多重背包恰好装满
    哈理工1053完全背包
    求最小公倍数与最大公约数的函数
    Bus Pass ZOJ 2913 BFS 最大中取最小的
    POJ 3624 charm bracelet 01背包 不要求装满
    HavelHakimi定理(判断一个序列是否可图)
    z0j1008Gnome Tetravex
    ZOJ 1136 Multiple BFS 取模 POJ 1465
    01背包 擎天柱 恰好装满 zjut(浙江工业大学OJ) 1355
    zoj 2412 水田灌溉,求连通分支个数
  • 原文地址:https://www.cnblogs.com/jenrry/p/10007080.html
Copyright © 2011-2022 走看看