Where in the bc4j framework is the real implementation of interface methods

I was going through a ADF for forms and 4 GL developers and came across following code.
package devguide.examples.client;
import oracle.jbo.client.Configuration;
import oracle.jbo.*;
import oracle.jbo.domain.Number;
import oracle.jbo.domain.*;
+public class TestClient {+
+public static void main(String[] args) {+
String amDef = "devguide.examples.UserService";
String config = "UserServiceLocal";
ApplicationModule am =
Configuration.createRootApplicationModule(amDef,config);
ViewObject vo = am.findViewObject("UserList");
+while (vo.hasNext()) {+
Row curUser = vo.next();
System.out.println(vo.getCurrentRowIndex()". "++
curUser.getAttribute("UserId")" "++
curUser.getAttribute("Email"));
Configuration.releaseRootApplicationModule(am,true);
+}+
+}+
I wanted to understand that findViewObject returns an interface of type ViewObject.Since ViewObject is an interface so it does not have code implementation of any of its method like hasNext or next.Where in the framework is the actual implementation of these methods ?
Thanks

Are you asking to look at the code of the interface?
For that you'll need an Oracle Support license and then you can request the actual source code of Oracle ADF from Oracle Support by opening an SR.
If you just want to see the documentation for a method check the documentation API section for example:
http://docs.oracle.com/cd/E35521_01/index.htm
http://docs.oracle.com/cd/E35521_01/apirefs.111230/e17483/toc.htm
http://docs.oracle.com/cd/E35521_01/apirefs.111230/e17483/oracle/jbo/ViewObject.html

Similar Messages

Using the Axis Framework in the SOAP Adapter

Hello experts,
I am currenty checking how I can easily manipulate sender and receiver details and how I could get attachments into XI.
I saw in the sap help that it is possible to use the AXIS framework from the SOAP adapter:
http://help.sap.com/saphelp_nw04/helpdata/en/45/a39e244b030063e10000000a11466f/frameset.htm
As usual, the documentation is of the same quality SAP usually provides.
So my first question would be: This is a moduke to be used from the SOAP adapter right? I am asking because they also wirte about the AXIS adapter and its metadata.
In oder to get it working, I created in the NWDStudio a library project, added my libraries (to the root directory) and deployed it via SDM. Deployment is succesful but its not working.
SAPHelp says I should check for a MessageServlet - I ask myself how that could appear suddenly just by packaging some axis libraries...?
I am using for that the ESA box (NW04s SP6) - I was not able to see whether there are some dependencies to the SP - are they?
Thanks for your support!
Helge

Helge,
Axis is outdated and has some issues ..use Apache Soap instead its much better and easy to use.
http://ws.apache.org/soap/
Regards
Ravi

Ho to install the "BC4J Enterprise Manager Bean" in Application Server 10g

Hi
I'd like to monitor my BC4J Application installed on a 10g Application Server. According to the help system I can find this information on the Enterprise Manager Website of the 10g Application Server: open the OC4J (not "home" in my case), open "Administration" tab, click on link "BC4J". After entering the OC4J Admin password you should come to a page where you can monitor BC4J-Pools and so on.
If I try this on my (custom created) OC4J I get an error message that I should install the "BC4J Enterprise Manager Bean". What is this? I installed the BC4J.EAR Application, but to no avail. However: It works well on the default OC4J "home", but unfortunately my application is on a different OC4J :(
Can anyone give me a hint, how to install the "BC4J Enterprise Manager Bean"? Can anyone point me to some documentation on this?
Thanks.

BC4J Enterprise Manager Bean is the bean to manage the bc4j framework in the oc4j instance. By default, it is only pre-installed by home instance. For all other instances, you have to do it yourself.
You can use the EM to deploy this bean to the oc4j instance you want, the ear file is located in your iAS_HOME\BC4J\oem directory.

Redesigning the Collections Framework

Hi!
I'm sort of an experienced Java programmer, in the sense that I program regularly in Java. However, I am not experienced enough to understand the small design specifics of the Collections Framework (or other parts of Javas standard library).
There's been a number of minor things that bugged me about the framework, and all these minor things added up to a big annoyance, after which I've decided to (try to) design and implement my own framework.
The thing is however, that since I don't understand many design specifics about the Collection Framework and the individual collection implementations, I risk coming up short with my own.
(And if you are still reading this, then I thank you for your time, because already now I know that this entry is going to be long. : ) )
Since I'm doing my Collection framework nearly from scratch, I don't have to worry too much about the issue of backwards compatibility (altough I should consider making some parts similar to the collection framework as it is today, and provide a wrapper that implements the original collection interfaces).
I also have certain options of optimizing several of the collections, but then again, there may be very specific design issues concerning performance and usability that the developers of the framework (or other more experienced Java progammers) knew about, that I don't know.
So I'm going to share all of my thoughts here. I hope this will start an interesting discussion : )
(I'm also not going to make a fuss about the source code of my progress. I will happily share it with anyone who is interested. It is probably even neccessary in order for others to understand how I've intended to solve my annoyances (or understand what these annoyances were in the first place). ).
(I've read the "Java Collections API Design FAQ", btw).
Below, I'm going to go through all of the things that I've thought about, and what I've decided to do.
1.
The Collections class is a class that consists only of static utility methods.
Several of them return wrapper classes. However the majority of them work on collections implementing the List interface.
So why weren't they built into the List interface (same goes for methods working only with the Collection interface only, etc)? Several of them can even be implemented more efficiently. For example calling rotate for a LinkedList.
If the LinkedList is circular, using a sentry node connecting the head and tail, rotate is done simply by relocating the sentry node (rotating with one element would require one single operation). The Collections class makes several calls to the reverse method instead (because it lacks access to the internal workings of a LinkedList).
If it were done this way, the Collections class would be much smaller, and contain mostly methods that return wrapped classes.
After thinking about it a while, I think I can answer this question myself. The List interface would become rather bloated, and would force an implementation of methods that the user may not need.
At any rate, I intend to try to do some sort of clean-up. Exactly how, is something I'm still thinking about. Maybe two versions of List interfaces (one "light", and the other advanced), or maybe making the internal fields package private and generally more accessible to other package members, so that methods in other classes can do some optimizations with the additional information.
2.
At one point, I realized that the PriorityQueue didn't support increase\decrease key operations. Of course, elements would need to know where in the backing data structure it was located, and this is implementation specific. However, I was rather dissapointed that this wasn't supported somehow, so i figured out a way to support this anyway, and implemented it.
Basically, I've wrapped the elements in a class that contains this info, and if the element would want to increase its key, it would call a method on the wrapping class it was contained in. It worked fine.
It may cause some overhead, but at least I don't have to re-implement such a datastructure and fiddle around so much with the element-classes just because I want to try something with a PriorityQueue.
I can do the same thing to implement a reusable BinomialHeap, FibonacciHeap, and other datastructures, that usually require that the elements contain some implementation-specific fields and methods.
And this would all become part of the framework.
3.
This one is difficult ot explain.
It basically revolves around the first question in the "Java Collections API Design FAQ".
It has always bothered me that the Collection interface contained methods, that "maybe" would be implemented.
To me it didn't make sense. The Collection should only contain methods that are general for all Collections, such as the contains method. All methods that request, and manipulate the Collection, belonged in other interfaces.
However, I also realized that the whole smart thing about the current Collection interface, is that you can transfer elements from one Collection to another, without needing to know what type of Collection you were transferring from\to.
But I still felt it violated "something" out there, even if it was in the name of convenience. If this convenience was to be provided, it should be done by making a separate wrapper interface with the purpose of grouping the various Collection types together.
If you don't know what I'm trying to say then you might have to see the interfaces I've made.
And while I as at it, I also fiddled with the various method names.
For example, add( int index, E element), I felt it should be insert( int index, E element). This type of minor things caused a lot of confusion for me back then, so I cared enough about this to change it to somthing I thought more appropriate. But I have no idea how appropriate my approach may seem to others. : )
4.
I see an iterator as something that iterates through a collection, and nothing else.
Therefor, it bothered me that the Iterator interface had an optional remove method.
I myself have never needed it, so maybe I just don't know how to appreciate it. How much is it used? If its heavily used, I guess I'm going to have to include it somehow.
5.
A LinkedList doesnt' support random access. But true random access is when you access randomly relative to the first index.
Iterating from the first to the last with a for statement isn't really random access, but it still causes bad performance in the current LinkedList implementation. One would have to use the ListIterator to achieve this.
But even here, if you want a ListIterator that starts in the middle of the list, you still need to traverse the list to reach that point.
So I've come up with LinkedList that remembers the last accessed element using the basic methods get, set, remove etc, and can use it to access elements relatively from it.
Basically, there is now an special interal "ListIterator" that is used to access elements when the basic methods are used. This gives way for several improvements (although that may depend how you look at it).
It introduces some overhead in the form of if-else statemenets, but otherwise, I'm hoping that it will generally outperform the current LinkedList class (when using lists with a large nr of elements).
6.
I've also played around with the ArrayList class.
I've implemented it in a way, that is something like a random-access Deque. This has made it possible to improvement certain methods, like inserting an element\Collection at some index.
Instead of always shifting subsequent element to the right, elements can be shifted left as well. That means that inserting at index 0 only requires a single operation, instead of k * the length of the list.
Again, this intrduces some overhead with if-else statements, but is still better in many cases (again, the List must be large for this to pay off).
7.
I'm also trying to do a hybrid between an ArrayList and a Linked list, hopefully allowing mostly constant insertion, but constant true random access as well. It requires more than twice the memory, since it is backed by both an ArrayList and a LinkedList.
The overhead introduced , and the fact that worst case random access is no better than that of a pure LinkedList (which occurs when elelements are inserted at the same index many times, and you then try to access these elements), may make this class infeasible.
It was mostly the first three points that pushed my over the edge, and made me throw myself at this project.
You're free to comment as much as you like.
If no real discussion starts, thats ok.
Its not like I'm not having fun with this thing on my own : )
I've started from scratch several times because of design problems discovered too late, so if you request to see some of the source code, it is still in the works and I would have to scurry off and add a lot of java-comments as well, to explain code.
Great. Thanks!

This sort of reply has great value : )
Some of them show me that I need to take some other things into consideration. Some of them however, aren't resolved yet, some because I'm probably misunderstanding some of your arguments.
Here goes:
1.
a)
Are you saying that they're were made static, and therefor were implemented in a utility class? Isn't it the other way around? Suppose that I did put them into the List interface, that would mean they don't need to be static anymore, right?
b)
A bloated List interface is a problem. Many of them will however have a default not-so-alwyas-efficient implementation in a abstract base class.
Many of the list-algorithms dump sequential lists in an array, execute the algorithm, and dump the finished list back into a sequential list.
I believe that there are several of them where one of the "dumps" can be avoided.
And even if other algorithms would effectively just be moved around, it wouldn't neccesarily be in the name of performance (some of them cannot really be done better), but in the name of consistency\convenience.
Regarding convenience, I'm getting the message that some may think it more convenient to have these "extra" methods grouped in a utility class. That can be arranged.
But when it comes to consistency with method names (which conacerns usability as well), I felt it is something else entirely.
For example take the two methods fill and replaceAll in the Collections class. They both set specific elements (or all of them) to some value. So they're both related to the set method, but use method names that are very distinguished. For me it make sense to have a method called setAll(...), and overload it. And since the List interface has a set method, I would very much like to group all these related methods together.
Can you follow my idea?
And well, the Collections class would become smaller. If you ask me, it's rather bloated right now, and supports a huge mixed bag of related and unrelated utitlity methods. If we should take this to the extreme, then The Collections class and the Arrays class should be merged.
No, right? That would be hell : )
2,
At a first glance, your route might do the trick. But there's several things here that aren't right
a)
In order to delete an object, you need to know where it is. The only remove method supported by PriorityQueue actually does a linear search. Increase and decrease operations are supposed to be log(n). Doing a linear search would ruin that.
You need a method something like removeAt( int i), where i would be the index in the backing array (assuming you're using an array). The elemeny itself would need to know that int, meaning that it needs an internal int field, even though this field only is required due to the internal workings of PriorityQueue. Every time you want to insert some element, you need to add a field, that really has nothing to with that element from an object-oriented view.
b)
Even if you had such a remove method, using it to increase\decrease key would use up to twice the operations neccesary.
Increasing a key, for example, only requires you to float the element up the heap. You don't need to remove it first, which would require an additional log(n) operations.
3.
I've read the link before, and I agree with them. But I feel that there are other ways to avoid an insane nr of interfaces. I also think I know why I arrive at other design choices.
The Collection interface as it is now, is smart because it can covers a wide range of collection types with add and remove methods. This is useful because you can exchange elements between collections without knowing the type of the collection.
The drawback is of course that not all collection are, e.g modifiable.
What I think the problem is, is that the Collection interface is trying to be two things at once.
On one side, it wants to be the base interface. But on the other side, it wants to cast a wide net over all the collection types.
So what I've done is make a Collection interface that is infact a true base interface, only supporting methods that all collection types have in common.
Then I have a separate interface that tries to support methods for exchanging elements between collections of unknown type.
There isn't neccesarily any performance benefit (actually, it may even introduces some overhead), but in certainly is easier to grasp, for me at least, since it is more logically grouped.
I know, that I'm basically challenging the design choices of Java programmers that have much more experience than me. Hell, they probably already even have considered and rejected what I'm considering now. In that case, I defend myself by mentioning that it isn't described as a possiblity in the FAQ : )
4.
This point is actually related to point 3., becausue if I want the Collection interface to only support common methods, then I can't have an Iterator with a remove method.
But okay....I need to support it somehow. No way around it .
5. 6. & 7.
The message I'm getting here, is that if I implement these changes to LinkedList and ArrayList, then they aren't really LinkedList and ArrayList anymore.
And finally, why do that, when I'm going to do a class that (hopefully) can simulate both anyway?
I hadn't thought of the names as being the problem.
My line of thought was, that okay, you have this arraylist that performs lousy insertion and removal, and so you avoid it.
But occasionally, you need it (don't ask me how often this type of situation arises. Rarely?), and so you would appreciate it if performed "ok". It would still be linear, but would often perform much better (in extreme cases it would be in constant time).
But these improvements would almost certainly change the way one would use LinkedList and ArrayList, and I guess that requires different names for them.
Great input. That I wouldn't have thought of. Thanks.
There is however some comments I should comment:
"And what happens if something is suibsequently inserted or removed between that element and the one you want?"
Then it would perform just like one would expect from a LinkedList. However if that index were closer to the last indexed position, it would be faster. As it is now, LinkedList only chooses either the first index or the last to start the traversal from.
If you're working with a small number of elements, then this is definitely not worth it.
"It sounds to me like this (the hybrid list) is what you really want and indeed all you really need."
You may be right. I felt that since the hybrid list would use twice as much memory, it would not always be the best choice.
I going to think about that one. Thanks.

"No enought room on startup disk for Application Memory" when using the Accelerate Framework

Dear colleagues,
I am running what I know is a large problem for a scientific application (tochnog) a finite element solver that runs from the Terminal. The application tries to solve 1,320,000 simultaneous linear equations. The problem starts when I use the Accelerate Framework as the Virtual Memory size jumps from 142 G to about 576 G after the library (LAPACK) is called to solve the system.It does not do it if I use a solver that does not calls LAPACK inside Accelerate.
The machine is a mac pro desktop with 8 GB of ram, the 2.66 GHz Quad-core Intel and the standard 640 GB hard drive. The system tells me that I have 487 GB available on hard drive.
The top instruction in Terminal reads VM 129G vsize when starting. When I run the finite element application once the LAPACK library in the Accelerate framework gets called, the Virtual Memory (VM) jumps to 563 G vsize.
After a short while, I get the "No enought room on startup disk for Application Memory error"
This is a screen capture of the application attempting to solve the problem using the LAPACK library inside the Accelerate framework: Here are the numbers as reported by the activity Monitor.
Tochnog Real Memory 6.68 GB
System Memory Free: 33.8 MB, Wired 378.8 MB, Active 5.06 GB, Inactive 2.53 GB, Used 7.96 GB.
VM size 567.52 GB, Page ins 270.8 MB, Page outs 108.2 MB, Swap used 505 MB
This is a screen copy of the same application solving the same problemwithout using the Accelerate framework.
Tochnog Real Memory 1.96 GB,
System Memory Free: 4.52 MB, Wired 382.1 MB, Active 2.69 GB, Inactive 416.2 GB, Used 3.47 GB.
VM size 148.60 GB, Page ins 288.8 MB, Page outs 108.2 MB, Swap used 2.5 MB
I can not understand the disparity in the behavior for the same case. As I said before, the only difference is the use of Accelerate in the first case. Also, as you can see, I thought that 8 GB of ram memory was a lot.
Your help will be greatly appreciated
Best regards,
F Lorenzo

The OP had posted this question in the iMac Intel forum.
I replied along similar lines, but suggested he repost this in the SL forum where I know there are usually several people who have a far better grasp of these issues than I.
I would be interested in getting their take on this.
Although, I think you are coming to the correct conclusion that there are not enough resources available for this process, I'm not certain that what you are saying on the way to that conclusion is correct. My understanding of VM is that it is the total theoretical demand on memory a process might make. It is not necessarily the actual or real world demand being made.
As such, this process is not actually demanding 568GB (rounded.) As evidence of that, you can see there is still memory available, albeit quite small, in the form of free memory of 33.8MB and inactive of 2.53GB (the GB for that figure, above, seems like it might be a typo, since for the process when not using Accelerate the reported figure for inactive was 416.2 GB -- surely impossible) and 7.96GB used. The process, itself, is using 6.68GB real memory.
In addition, I question whether the OP has misstated the 487GB free drive space. I think that might be the total drive capacity, not the free space.
My guess is that it is the combination of low available memory and low free drive space prompting this error.
From Dr. Smoke on VM:
it is possible that swap files could grow to the point where all free space on your disk is consumed by them. This can happen if you are very low on both RAM and free disk space.
https://discussions.apple.com/message/2232469?messageID=2232469&#2232469
This gets more to the actual intent of your question...
EDIT: Looks like some kind of glitch right now getting to the Dr. Smoke post.
Message was edited by: WZZZ
<Hyperlink Edited by Host>

How Does EJB 2.0 Specification Change the BC4J?

Hi,
I had read the while paper of BC4J thoroughly. The following statement interested me:
"As Oracle9iAS, WebLogic, and other J2EE application server vendors begin to rollout complete support for the new EJB 2.0 specification in the first half of 2002, a new release of the BC4J framework will be released which includes support for the new local entity beans. This work entails enhancing our lightweight, local entity classes to support the necessary interface to be lightweight EJB 2.0 Local Entity Beans. ...."
I have searched all the documents about BC4J, but I couldn't find anything more about "How Does EJB 2.0 Specification Change the BC4J?"
I think the "Local EJB Entity Beans" is similar with BC4J DAO. So is there someone who can tell me how does EJB 2.0 Specification change the BC4J?
Any help would be appreciated!
James

We support using local CMP entity beans as your persistence layer for your entity objects, but as it adds an extra layer, it's turned out (in all honesty) to not be that popular a feature.
The performance offered by the simpler BC4J entity object (plain old java class) is fine, and the notion of using simple java beans for your model is widely recognized as a fine option for J2EE applications.
For example, check out Rod Johnson's book called "Expert one-to-one: J2EE Design and Development" which covers this subject excellently.

How to create SDA file for using AXIS Framework in the SOAP Adapter

Hi experts,
I have the following question:
How I can create the SDA file aii_af_axisprovider.sda for using the AXIS Framework in the SOAP Adpater described in http://help.sap.com/saphelp_nw04/helpdata/en/45/a4f8bbdfdc0d36e10000000a114a6b/content.htm ?
I have downloaded the files axis.jar, commons-discovery-0.2.jar, commons-logging-1.0.4.jar, commons-net-1.0.0-dev.jar and wsdl4j-1.5.1.jar. But how to create the SDA file aii_af_axisprovider.sda? Which tool I have to use for this? It is enough to compress these 5 jar-files in the sda file or need I further files with further information (meta information etc.)?
Thanks and best regards
Christopher

Hi Christopher,
Check this discussion if you have not checked already.
Re: NTLM Authentication dosent work with XI ?
Regards,
Ravi

Finding jsp file for the OA framework

hi all,
i working in the OA framework, and i need to do some changes in the application and i need to get the jsp files for the shopping carts, i connected to the server through ftp.
from the about link in the shopping cart it says that the OA_HTML found in the path /u01/applcrp2/crp2comn/html/ but i coudn't find the jsp files for the shopping cart, i also need to locate the java classes for this files
any help please, is there any documentation on this issue - the location of the files in the OA framework in the server.
urgent please any tipes
Mahdi

Oracle guys - maybe it's time for a "sticky" post at the top of the forum entitled This is not the right forum for asking OA Framework questions.
The OA Framework Forum is [url http://forums.oracle.com/forums/forum.jspa?forumID=210]here
I am going to become the top poster on this forum just responding to these ;)
John

Override renderKit to customize the dialog framework behavior

Hi all,
We're using JDeveloper 11.1.1.5.
Our requirement is to hide the browser's tool bar of the window opened by the dialog framework.
The below post says that the dialog framework only cares for height and width and ignores all other parameters.
How to Make dialog as full screen
And the below Java Doc says that the list of window property names that are supported by DialogRenderKitService.launchDialog() depend on the RenderKit.
http://www.jarvana.com/jarvana/view/org/apache/myfaces/trinidad/trinidad-api/1.2.7/trinidad-api-1.2.7-javadoc.jar!/org/apache/myfaces/trinidad/render/DialogRenderKitService.html#launchDialog%28javax.faces.context.FacesContext,%20javax.faces.component.UIViewRoot,%20javax.faces.component.UIComponent,%20java.util.Map,%20boolean,%20java.util.Map%29
Therefore it is likely that we can accomplish our requirement if we implement our own renderKit and set it as default.
Is it possible to override default renderKit (oracle.adf.rich) to customize the dialog framework behavior?
Regards,
Kenji

Thanks for your response.
However I think that overriding renderer is not the way to go but overriding render kit is.
It seems to me that dialog launching in the dialog framework is executed by launchDialog() method of DialogRenderKitService which is obtained as follows.
RenderKit rk = FacesContext.getCurrentInstance().getRenderKit();
DialogRenderKitService service = Service.getService(rk, DialogRenderKitService.class);Thus the solution should be, I think, something like this:
1. Override launchDialog() of DialogRenderKitService of the dialog framework so as to launch a dialog without the browser's toolbar.
2. Extend the default render kit (oracle.adf.rich) so as to return the extended DialogRenderKitService when Service.getService(rk, DialogRenderKitService.class) is called.
3. Set the extended render kit as default in faces-config.xml.
However, this is not easy (or I should not do this) as both the default DialogRenderKitService and render kit are in internal packages.
There may be another solution that is applicable.
Any idea?
Regards,
Kenji

Integration of exception framework with the JAZN repository????

hi all,
I am using soa 10.1.3.3.1. FaultMangement Framework. Here we are having one option to edit the payload in human intervention.
my quetion is can we Integratage the exception framework with the JAZN repository to control access for Human Intervention policy,
i mean to say, whenever enduser is found with fault payload, the enduser must able to edit it and continue form that poin of time..., but here only oc4jadmin or bpeladmin can controll the access of human intervention .....
is there any way to give this privilages to some specified users????
any help can be greatly appritiated...... thanks in advance.

Hi,
Thanks for your responce.
yes, you are right, we can achieve that by a new user JAZN and assign a role "BPMSSystemAdmin". But by doing so, we are giving the total control to the user. he can edit the data for the other instances also. i don't want to happen that.
my requirement is , the end user just able to edit the data and can continue, and also if he is not responded in the stipulated time auto esclation to the admin. he should not have privilage to chage the rule or edit the payload for other instances....
can it be possible?
please help me..,
if there is no such option, please tell me the ulternate way to achive this requirement...

Microsoft open sourced the Entity Framework

http://weblogs.asp.net/scottgu/archive/2012/07/19/entity-framework-and-open-source.aspx
Microsoft wants others to get involved in building the next version of the Entity Framework.
The source code is found here:
http://entityframework.codeplex.com/
The Mono Project is working to get the open sourced Entity Framework to work on Mono.
So, with Oracle working on a thin ODP.NET provider, hopefully, it will work on Mono too. But no guarantee from Oracle. I know at first, the thin ODP.NET provider will not support Entity Framework, but down the road it could (hopefully).

I'm using NHibernate and I'm more satisfied with it than EF.
Alex said that the final release for managed provider will come with Oracle 12 which maybe will come at the end of the year.

Where is the Adapter Framework/SDK ?

Hi
I have developed a JCA 1.5 resource adapter for integration test purpose.
I thought the "hard" part done...obviously I was wrong.
I know I can integrate it within BPEL PM as "explained" in this link: http://www.oracle.com/technology/products/integration/adapters/pdf/Adapter%20Development%20cookbook.pdf
Unfortunately this document doesn't realy help and some related tools or samples seem unobtainable.
1.- Does anybody know where I can get the Adapter Framework/SDK mentioned in this document ?
2.- Where can I find the -also mentioned- sample related to the MyOwnPersonalRecord -> XMLRecord translation ?
Dominique

There is also an AIR SDK outside the gaming SDK. I am looking for the Flex/AIR combination.

Where can I get Tutotorial.zip that the OA Framework Developer Guide talks

Hi
Can someone please tell me as to, from where I can get the Tutorial.zip that the OA Framework Developer Guide talks about.
thanks
subra.

Hi,
You can download the OA JDeveloper Extension from Metalink (Patch Number 4045639) and install it according to the instructions provided on Metalink note 286082.1. This will install a version of JDeveloper on your machine that already comes with the tutorial mentioned in the Developer Guide, as well as the IDE suited for OA Development.
Thanks!
Thiago

Where is the ExternalAccessories framework located in Xcode 6?

It appears that the ExternalAccessories.framework file has moved from Xcode 5 to Xcode 6. It used to be in the /System/Library/Frameworks folder.

It is gone in iOS 6. Use the Mobil site, download the app from the App Store, there is nothing that you can do about it until Google releases an app for the IPad.
it wasn't a competition thing. They couldn't agree on some other issues.
http://m.youtube.com/

References are becoming invalid when passed to an actor using the Actor Framework

I have having an issue with passing a couple of references to an actor using the actor framework 3.0.7 (LabVIEW 2011 & TestStand 2010 SP1).
Some background:
My application has three main components:
Main VI -- is not part of any class and Launches UI Actor.
UI Actor -- Launches the teststand actor
TestStand Actor -- Initializes and starts teststand.
The two references showing similar behavior (invalid reference) are the TestStand App Manager control and the "Current VI's Menubar" reference. The App Mgr control is on the front panel of the UI Actor's Actor Core.vi. The menubar reference is retrieved in the block diagram of the UI Actor's Actor Core.vi
Now,
When I run the Main VI I get an error in the TestStand Actor's Actor Core.vi (Remember Main VI launches UI Actor launches TestStand Actor) because the App Mgr and menubar references are invalid (. I have checked and verified that in this scenario the references are valid in the UI Actor before it launches the teststand actor.
If I run the UI Actor's Actor Core.vi stand alone (i.e. run it top level) the App Mgr and menubar references are passed to the teststand actor, no error occurs, and the code functions as expected.
Why would these references be invalid by simply starting a different top level VI? Could it have something to do with when the references are passed vs. when the front panel is loaded into memory?
I tried putting the App Mgr control on the front panel of the Main VI and passing it to the UI Actor and then to the TestStand Actor. This works....
Anyone have any experience or knowledge to why this is occurring?

Generally, references in LV are "owned" by the hierarchy they are first created in, and the hierarchy is determined by the top level VI. Once the hierarchy goes idle or out of memory, the references created by that hierarchy are automatically closed. That's usually what causes something like this - the reference is created in one hierarchy (let's say the main VI hierarchy) and then that hierarchy stops running.
I don't know the AF well enough to say if that's really the case (I actually thought that it always launches a separate top level dynamic process, which I assumed is where the UI actor's core VI would always be called), but that might help explain it. If not, you might wish to post to the AF group in the communities section.
Try to take over the world!

Where in the bc4j framework is the real implementation of interface methods

Similar Messages

Maybe you are looking for