Passing parameter for the bean function that deletes record from DB
I need to delete some record from the DB without updating the reset of the user screen.
I use commandButton with immediate attribute as true, because validation should be skipped.
So, I can't rely on backing bean values being updated, but need to pass a param to the function that does the delete (deleteTemplate) function below.
The value of this param is selected value in another comboBox called "template".
Code below is not parsing. Could you advise how to do it?
<a4j:commandButton id="deleteTemplate" value="Delete"
action="#{qtBeanParam.deleteTemplate(param['piPerformanceReturnsForm:template'])}" immediate="true" reRender="template,templateList,templateOwner,templateOwnerList"
styleClass="blue-button">
</a4j:commandButton>Error Parsing: #{qtBeanParam.deleteTemplate(param['piPerformanceReturnsForm:template'])}
Thank you for your reply.
Could I pass the value that is entered in some other field as a "parameter" though?
<f:param name="anyName" value="parameter" />
For example the value from the following comboBox?
<rich:comboBox id="template" width="250" value="#{qtBeanParam.templateName}" enableManualInput="true"
converter="#{templateConverter}" valueChangeListener="#{qtBeanParam.changeTemplate}" >
<a4j:support event="onselect" reRender="template,templateList" ajaxSingle="true" />
<a4j:support event="onchange" reRender="template,templateList" ajaxSingle="true" />
<f:selectItems id="templateList" value="#{qtBeanParam.templateList}" />
</rich:comboBox>
Similar Messages
-
Help in CURSOR when pass parameter for the IN
Hi,
Need some help I have CURSOR that takes a VARCHAR2 and NUMBER but when I run my Procedure it gives invalid number. Here is the CURSOR
CURSOR get_count (p_list VARCHAR2, p_id NUMBER)
IS
SELECT COUNT (*) total_rows,
NVL
(SUM (CASE
WHEN UPPER (cdcode) = 'PASS'
THEN 1
ELSE 0
END
0
) tot_returned,
COUNT (*)
- NVL (SUM (CASE
WHEN UPPER (cdcode) = 'PASS'
THEN 1
ELSE 0
END
0
) diff
FROM testtable
WHERE plistcol IN (p_list)
AND pidcol = p_id;
plistcol is of datatype NUMBER
In my procedure I am building a list to comma separated numbers that goes in p_list parameter of type VARCHAR2 to the cursor i.e.
I have a for loop to build that list e.g.
loop
-- num is of datatype NUMBER
p_list := p_list || num || ',';
end loop
IF (p_list IS NOT NULL)
THEN
p_list := SUBSTR (p_list, 1, LENGTH (p_list) - 1);
END IF;here is how my p_list looks when i pass it on to the cursor
*12,345,678*
and here is how open the cursor
OPEN get_count (p_list, 99999);
and here is the error I get
SQLERRM ORA-01722: invalid number
Now when I hard *12,345,678* in my CURSOR SELECT it works fine, it's only when I pass this as parameter it fails. For example I hard code the values in my CURSOR select it works fine
CURSOR get_count (p_list VARCHAR2, p_id NUMBER)
IS
SELECT COUNT (*) total_rows,
NVL
(SUM (CASE
WHEN UPPER (cdcode) = 'PASS'
THEN 1
ELSE 0
END
0
) tot_returned,
COUNT (*)
- NVL (SUM (CASE
WHEN UPPER (cdcode) = 'PASS'
THEN 1
ELSE 0
END
0
) diff
FROM testtable
WHERE plistcol IN (12,345,678) -- even '12','345','678' works when hardcoded
AND pidcol = p_id;I even tried passing the values in the format *'12','345','678'* but still get the above error. So how can I pass the values to cursor IN clause.
So wondering what might be the issue.
ThanksWhy this kind of coding needs to be avoid - here is one demonstration of one aspect ->
satyaki>
satyaki>select * from v$version;
BANNER
Oracle Database 10g Enterprise Edition Release 10.2.0.3.0 - Prod
PL/SQL Release 10.2.0.3.0 - Production
CORE 10.2.0.3.0 Production
TNS for 32-bit Windows: Version 10.2.0.3.0 - Production
NLSRTL Version 10.2.0.3.0 - Production
Elapsed: 00:00:00.22
satyaki>
satyaki>select * from emp;
EMPNO ENAME JOB MGR HIREDATE SAL COMM DEPTNO
9999 SATYAKI SLS 7698 02-NOV-08 55000 3455 10
7777 SOURAV SLS 14-SEP-08 45000 3400 10
7521 WARD SALESMAN 7698 22-FEB-81 1250 500 30
7566 JONES MANAGER 7839 02-APR-81 2975 20
7654 MARTIN SALESMAN 7698 28-SEP-81 1250 1400 30
7698 BLAKE MANAGER 7839 01-MAY-81 2850 30
7782 CLARK MANAGER 7839 09-JUN-81 4450 10
7788 SCOTT ANALYST 7566 19-APR-87 3000 20
7839 KING PRESIDENT 17-NOV-81 7000 10
7844 TURNER SALESMAN 7698 08-SEP-81 1500 0 30
7876 ADAMS CLERK 7788 23-MAY-87 1100 20
EMPNO ENAME JOB MGR HIREDATE SAL COMM DEPTNO
7900 JAMES CLERK 7698 03-DEC-81 950 30
7902 FORD ANALYST 7566 03-DEC-81 3000 20
13 rows selected.
Elapsed: 00:00:01.90
satyaki>
--Your query works and here is the slightly modified version of your query
satyaki>
satyaki>
satyaki>declare
2
3 type t_ref_cursor is ref cursor;
4 l_cursor t_ref_cursor;
5 l_count number;
6 l_list varchar2(1000) := '10,20';
7 v_sql varchar2(1000);
8
9 begin
10
11 v_sql := '';
12 v_sql := v_sql||'select count(*) as tot_count ';
13 v_sql := v_sql||'from emp ';
14 v_sql := v_sql||'where deptno in ('||l_list||')';
15
16 open l_cursor for v_sql;
17 loop
18 fetch l_cursor into l_count;
19 exit when l_cursor%notfound;
20 dbms_output.put_line('count: '||l_count);
21 end loop;
22 close l_cursor;
23
24 end;
25 /
count: 8
PL/SQL procedure successfully completed.
Elapsed: 00:00:00.09
satyaki>
--Now, modifying the input i can sniff into the entire data
satyaki>
satyaki>declare
2
3 type t_ref_cursor is ref cursor;
4 l_cursor t_ref_cursor;
5 l_count number;
6 l_list varchar2(1000) := '10,20) or (1=1';
7 v_sql varchar2(1000);
8
9 begin
10
11 v_sql := '';
12 v_sql := v_sql||'select count(*) as tot_count ';
13 v_sql := v_sql||'from emp ';
14 v_sql := v_sql||'where deptno in ('||l_list||')';
15
16 open l_cursor for v_sql;
17 loop
18 fetch l_cursor into l_count;
19 exit when l_cursor%notfound;
20 dbms_output.put_line('count: '||l_count);
21 end loop;
22 close l_cursor;
23
24 end;
25 /
count: 13
PL/SQL procedure successfully completed.
Elapsed: 00:00:00.10
satyaki>Got me?
Regards.
Satyaki De. -
I can't find my serial number for the new Compressor that I got from the app store
ive been trying to export a final cut file to a .mov. i keep getting a codec error and recently got compressor however when i try to export using compressor it asks for a serial number that i dont have because the app store never gave me one.
Compressor 4 does not give a serial number, it only runs on Mac's that are "authorized" for your iTunes/App Store account.
If it's asking for a s/n, sounds like you're launching an old, unregistered Compressor 3.5 version. Launch from the Applications menu, not from the Dock. -
Deleting records from a recursive table query
Hi All,
I have the follow query, I would like to ask for your help, please: we use recursive tables for various purposes and one of them may have 100,000's records.
What would be the best approach to delete records from such a table?
I was thinking about two below, but any additional one will be more than welcome as well:
(1) I can DELETE FROM my_table WHERE my_table_id IN (SELECT my_table_id FROM my_table START WITH my_table_parent_id = X CONNECT BY PRIOR my_table_id = my_table_parent_id, but it means that I will run on my_table twice, no?
(2) I thought also to create a Foreign Key of my_table_id REFERENCES my_table_parent_id, but then I am afraid it will effect DML commands on that table.
Thank you in advanceHi,
kdwolf wrote:
... (1) I can DELETE FROM my_table WHERE my_table_id IN (SELECT my_table_id FROM my_table START WITH my_table_parent_id = X CONNECT BY PRIOR my_table_id = my_table_parent_id, but it means that I will run on my_table twice, no?Sorry, I'm not sure whqt you mean by "I will run on my_table twice". Assuming you don't already have a foreign key constraint (as you described below) I don;t know any other way, let alone a more efficient way, to get the same results.
(2) I thought also to create a Foreign Key of my_table_id REFERENCES my_table_parent_id, but then I am afraid it will effect DML commands on that table.You're right; a foreign key constraint always costs a little whenever you do DML. Someone who knows your application and your system as well as you do will have to decide if the benefit of having accurate, consistent data justifies that additional cost. If you're not sure, I suggest you add the constraint.
One advantage of having a foreign key constraint is that you can create it with the "ON DELETE CASCADE" option. Then, if you simply say "DELETE FROM my_table WHERE my_table_patrent_id = X", all the descendants of those rows will automatically be deleted, exactly as you requested in (1) above. -
Delete records from tableA which are not in tableB
Table A contains milions of records which is the best way to delete records from tableA which are not in tableB
delete from tableA where empno not in (select empno from tableb)
or
delete from tableA where empno not exists (select empno from tableb
where b.empno=a.empno)
any helpHi
If you can do this, do with this:
create table tableC
as select a.*
from tableA a,
(select empno from tableA
minus
select empno from tableB) b
where a.empno = b.empno;
drop table tableA;
rename table tableC to tableA;
Ott Karesz
http://www.trendo-kft.hu -
Pass more parameter to the packaged function with REMAP_DATA in EXPDP
1) can we pass more than one parameter to the packaged function specified in REMAP_DATA during DATA pump export?
2) if yes to point#1 then, how can we pass rownum & some other columns value in the same record passed into the function?when all else fails, Read The Fine Manual
http://download.oracle.com/docs/cd/E11882_01/server.112/e16536/dp_export.htm#sthref115 -
How to pass parameter to the Query String of the Named Queries'SQL
Firstly to say sorry,I'm a beginner and my English is very little.
Now I want to know
How to pass parameter to the Query String of the Named Queries'SQL in the Map editor.
Thanks.benzi,
Not sure if this is on target for your question, but see #5 in the link below for some web screencasts that show how to pass an input text form field value to the bind variable of a view object. If you're looking for something different, maybe provide some more details such as what you are trying to accomplish and what technology stack you are using - for example, ADF BC, JSF, etc.
http://radio.weblogs.com/0118231/stories/2005/06/24/jdeveloperAdfScreencasts.html
Also see section 5.9 and chapter 18 in the developer's guide.
thanks -
ADF UI Shell Pattern- How to pass parameter to the called bounded taskflow?
The sample Launcher class of the ADF UI Shell template has the following code:
private void _launchActivity(String title, String taskflowId, boolean newTab)
try
if (newTab)
TabContext.getCurrentInstance().addTab(
title,
taskflowId);
else
TabContext.getCurrentInstance().addOrSelectTab(
title,
taskflowId);
catch (TabContext.TabOverflowException toe)
// causes a dialog to be displayed to the user saying that there are
// too many tabs open - the new tab will not be opened...
toe.handleDefault();
}How do I pass a parameter to the bounded taskflow that will be launched?
For example:
1) I have a list of employees displayed on a tab.
2) When I select a record and click an edit button inside the tab, A separate tab should open with the corresponding employee to be edited.
How then could I pass the employee id to the edit-employee-task-flow?
I can't think on how/what would a "calling taskflow" come into this picture?
help!
pino
Edited by: pino on 16-Dec-2009 05:57
Edited by: pino on 16-Dec-2009 09:59Hi Arunkumar,
Thanks for the info. I was actually using EJB DataControls, and something similar to what you have suggested can also be done programmatically, but I wanted to follow the one promoted in the Fusion Developers' Guide to take advantage of the "ADF task flow framework" (like pass-by-value, pageflowScope, etc.) especially that we were having problems when we will just follow the procedures that was presented in the tutorials(I mean that- not all the procedures in the tutorials will work on an application based on the UI Shell pattern which do have multiple active taskflows.).
For instance, you have an active List of employees in one tab, and two other tabs that try to edit employee records. If these employee list and employee edit forms are based on a single iterator binding, then what would happen to the information in the two edit forms on each separate tabs if you selected another row on the employee list tab? -- In our case, the edit tabs' values synchronized to the new selected row in the list tab.
There are sure many work-arounds for these, but I am looking for a cleaner, clearer, or best way to handle this scenario.
regards,
pino -
Latest update of Firefox is REALLY slow. Is it just all the extra functionality that has been added or is there a button I need to press to make it the same speed as it use to be? I'll have to start usin safari again as this isn't funny anymore
Can i retro grade back to the last version?uninstalled firefox ....deleted all files still remaining under mozilla firefox directory in program files ... to avoid having to reprogram all my settings, reisntall all addons as well .. I did not remove anything from mozilla firefox that is stored in either appdata or under the windows users directory (if any)
... the as suggested reinstalled the latest version of the firefox browser using the link you provided in the email ..; tested and several issues still remain present and unresolved ....
so please this is urgent or I will have to jump browsers and start using chrome .. because we work 14 hours a day 6 (sometimes 7) days a week, to get ready for the launch of our newest venture and we cannot lose that much days on browser related issues ... so please instead of putting me through week long step process .. of do this .. do that .. can you please actually look into the issue from your end .. I use firefox for so many, many years thta I deserve this kind of support .. thnx Robert -
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 | <p | ? | >p ] Then swap = part to middle at the end
[ =p | <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 | =p | >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 | ? | =p | ? | >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 MuqaddasThanks 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. -
I have trouble seeing the small icons for the program functions in this tutorial.
Hello,
I have my assets from an older site, and want to start a site desktop site in muse. Is there a program ( maybe a book ) that can walk me through this step by step, instead of the Katie's Cafe demo / tutorial?
The problem with the tutorial is in the dark interface I have trouble seeing the small icons for the program functions.
I really need to setup a new site as soon as possible, but am not getting there right now.
Thanks.
Patricia GoffYou can download the pdf from here :
https://helpx.adobe.com/pdf/muse_reference.pdf
Thanks,
Sanjit -
How to pass parameter for table name in form6i.
Hi ,
I am facing the problem to pass parameter for table name in form6i.
If any solution please infirm me earliest to my mail id.
([email protected])
example:
begin
select ename into :ename
from :tab_name
where empno =7788;
end;
It gives error as bad bind variable 'tab_name'
*** where :ename and :tab_name are form fields
Thanking you,
Balasahebobject name not taken as table --> what do u mean by
this?
Please be more clear..
Regards
PriyaI have two block. First block I am displaying all the table using user_objects table. Another block I want display, user which table selected, corresponding table all the records. -
Does the iPad 2 pass through TV the same way that the iPhone 4s does ?
Does the iPad 2 pass through TV the same way that the iPhone 4s does ? I have an Arcam rCube dock which allows the tv pass through from the iPhone 4s and I was wondering if the iPad 2 will do the same if I buy a dock extender and what should I check for in a dock extender ?
No - that feature does not exist on the iPad2 and I know of no plans - nor would anyone else here - for that feature to be added with a software update in the future.
-
my iPod has not been working for a month now and i was hoping that you could help me.The part where you charge and sync the iPod is not connecting.There is defiantly not the lead as we use it for the iPhone and that works please could you help!
yours sincerly
jackfromsurreyWhat I am saying is ..........
The iPhone HAS to be active making calls on the UK carrier network for the carrier to identify as "theirs" and therefore eligible for the Carrier to unlock
The way to achieve this is to use a PAYG sim making and receiving calls to establish a customer relationship with the Carrier and then follow the Carrier's process to unlock
With a PAYG it usually means adding a specified (by the carrier ) amount usually £15 /£20 depending on the carrier
This is how O2 function and according to Gemma this is how Vodafone work -
Does RoboHelp 11 have the ability to add filters for the search function?
Does Robohelp 11 have the ability to add filters for the search function?
There's a page on my site about ZoomSearch. You can set up Rh to work with that and have a page with links or buttons that bring up different search options.
See www.grainge.org for RoboHelp and Authoring tips
@petergrainge
Maybe you are looking for
-
Hello, I run MacOS X 10.8.5 and Win7 SP1 installed on a MacBook Pro (model summer 2010). I used to run Win7 using Parallels desktop. I have version 9.0.23036 installed. Unfortunately, the boot sector for Win7 got corrupted or erased (???) I have many
-
Accessing the controls in initiation form in SPdesigner 2013 workflow
Hai , I created a re-usable workflow in SPdesigner and i created a initiation form for this workflow. In my initiation form i have 6 controls. First control is drop down list it contains 4 values and other 5 controls are checkboxes
-
Creative Cloud desktop failed to update.(Error code: 1)
Hello, I'm running a MacBook Pro Retina with Yosemite 10.10.2. I tried to update Creative Cloud Desktop manager and then tried to cancel it (it was killing my bandwidth while I was trying to work). It disappeared from the bar at the top of the OSx
-
IPhoto - storage or just referencing?
It seems that all physical manipulation of photos, creating of new albums etc had to be done in the Photo App, not iPhoto. No problem with that. But does that mean that iPhoto is just a reference to the photos that are stored on the iPad? Surely it
-
Ive updated to iOS6 and can no longer use bluetooth. I've been advised to go back to iOS5, how can I achieve this?