Do we need to compile the code migrating from JDK 1.4.2.11. to 1.4.2.15

Hi
Currently our application is running in JDK 1.4.2.11 and because of the SSL vulnerability issues we are planning to upgrade the JDK to 1.4.2.15 version.
Just wanted to know do we need to complie the code for this change.

In general, no. However, if your code depends on code that was changed as part of a bugfix, you may have to make source changes, and then recompile.
Test and see. And review the release documents for the versions involved.

Similar Messages

I need to cancel the code that I redeem and restart the code

I went to use another email and pass word to redeem my gift card. I did not relize I could use my email. so I need to have the code canceled from the [email protected] so I can use it on my [email protected] can some one help me. this is my first time using itunes

Click here and request assistance.
(63314)

Need to compile C code for Solaris 5.4 target

Hi,
I'm current on a project where the target platform is Solaris 5.4. I believe the SunOS version is 2.4. Unfortunately, there is no way I can get the customer to upgrade their server or OS.
In my search so far I've been unsuccessful in finding a compiler for that platform. The oldest gcc I can find is for SunOS 2.5.
What other options do I have?
Will code compiled with the C compiler in the Sun Studio 12 be able to run on SunOS 2.4? If so, is there a command line option I need to set while compiling the code?

No available Sun compiler can be used on, or to generate code for, SunOS 5.4 (Solaris 2.4). Even Sun Workshop 5.0, released in 1998, did not support Solaris 2.4.
If you develop code to be run on Solaris 2.4, you need to compile on Solaris 2.4 (or earlier). Binaries created on a later version of Solaris will not in general run on an earlier version of Solaris. I think that Sun WorkShop 3.0 was the last version that supported Solaris 2.4, but it might have been WorkShop 2.0. Those antiques are not available from Sun.
If I were in this situation, I would tell the customer that the OS and all support software are many years past End Of Service Life. No support is available, the software is no longer available, and I can't help them unless they are willing to upgrade to supported software. (I might also ask the customer if they still use Windows 3.1 on their PCs. The situation is comparable.)
If you don't have that option, your next best hope is that the customer has a C compiler on their system. If so, find a way to use it. If it's a Sun compiler, you will have a problem acquiring a license to run it. You will probably have to run it on their system.
If the customer doesn't have a compiler, I guess you have to keep trolling in newsgroups and forums, looking for a compiler that supports Solaris 2.4. Good luck.

I need to compile a code in dev c++ how can I do it on my mac?

I need to compile a code in dev c++ how can I do it on my mac?

XCode http://developer.apple.com/technologies/mac/
Stefan

I need to retrieve the code I was given to activate my creative suite design & web premium.

PLEASE can someone help me. I need to retrieve the code I was given to activate my creative suite design & web premium. I have got a new mac and it is only saying I have a 30 day trial.

Sign in, activation, or connection errors | CS5.5 and later
Find your serial number quickly
Mylenium

Need help improve the code

I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
thank you

let me fix my misstake which was point out by some one in here and thank you ofr do so because I'm new at this.
I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
}thank you

Need to check the data flow from R/3 to BW server.

Hi BI experts,
This query is regarding need to check the data flow from R/3 to BW server.
As of now I have some set of reports which I would need to take up in BW. The requirement is to go through the list of transaction codes for reports in R/3 and find out if there are already any existing objects in BW system which I can use for these reports.
So, can u plz help me.

Depends what are your Tcode or Reports users run in R/3 and they want the same in BW.Then in BI Content we have Out of the box Delivered reports.You can activate those Load data and use it.
Gimme T-codes you have I can send you Standard reports in BI or Cube you can get these from.
~AK

Can anyone help me, I need to change the address (country) from US to UK so i can purchase?

can anyone help me, I need to change the address (country) from US to UK so i can purchase?

Change/Verify Account https://forums.adobe.com/thread/1465499 may help
-http://helpx.adobe.com/x-productkb/policy-pricing/change-country-associated-with-adobe-id. html

Hi, we need to create the test environment from our production for oracle AP Imaging. we have soa,ipm,ucm and capture managed servers in our weblogic. can anyone tell me what is the best way to clone the environment, can I just tar the weblogic file syste

Hi, we need to create the test environment from our production for oracle AP Imaging. we have soa,ipm,ucm and capture managed servers in our weblogic..
Can anyone tell me what is the best way to cloning the application from different environment, the test and production are in different physical server.
Can I just tar the weblogic file system and untar it to the new server and make the necessary changes?
Can anyone share their experiences and how to with me?
Thank in advance.
Katherine

Hi Katherine,
yes and no . You need as well weblogic + soa files as the database schemas (soa_infra, mds...).
Please refer to the AMIS Blog: https://technology.amis.nl/2011/08/11/clone-your-oracle-fmw-soa-suite-11g/
HTH
Borys

BW3.5 : Busness content == Need to find the source cube from an web item

Hi,
While executing( preview) an iview of the predelivered CRM business package( com.sap.pct.crm.slsAnalyt.spa.Customer iview for Sales manager), in Enterprise Portal, I get an error " Error loading template 0TPL_0CRM_SM_CUSTOMER".
I can see this perticular web template in BW and when trying to activate this by tranferring into the content windows it brought thousands of other objects( even when I selected 'Only necessary object'). I am not sure whether I should go ahead with the activation.
I would like to know what is the relationship between a cube and a web template and how to findout the related cube from the template?
Also is it possible to activate only certain webtemplates only for queries of a perticular cube?
Thanks
Arunava

Thanks Dinesh,
\ BW3.5 : Busness content ==>Need to find the source cube from an web item
Posted: Nov 2, 2005 10:00 PM Reply E-mail this post
Thanks Dinesh
I would still like to know the relationship between a cube and a web template and how to find out the related cube( or query etc) from the template?
Please let me know,
Thanks
Arunava

I used my military (.mil) address as the backup for my appleID account, but now that I need to open the verification email from apple, the .mil doesnt allow me to open and verify that I am who I am?

I used my military (.mil) address as the backup for my appleID account, but now that I need to open the verification email from apple, the .mil doesnt allow me to open and verify that I am who I am?

Hey Edgew7,
Thanks for the question. The following resource may provide a solution:
iOS 7: If you're asked for the password to your previous Apple ID when signing out of iCloud
http://support.apple.com/kb/ts5223
3. Change your Apple ID temporarily
If signing out and back in to iMessage or FaceTime didn't work, try these steps:
1. Change your Apple ID to the Apple ID you used previously. You shouldn't need to verify the email address.
2. Tap Settings > iCloud and try to sign out.
3. Change your Apple ID to the new email address that you want to use. You'll need to verify the email address.
4. Tap Settings > iCloud and sign in with the new Apple ID.
Thanks,
Matt M.

We need to pass the customer id from Parent BO report to Child BO report.

Hello Experts
We are using SAP BI BO 4.1 for Business Objects and SAP BW 7.3 as BW Backend.
Requirement: We need to pass the customer id from Parent BO report to Child BO report.
Issue: Customer (0CUST_SALES__CUSTOMER) Characterisitic is used where in the display characteristic is set to Key i.e 'Display As "Key" ' But the In BO the Dimension appreas as Text .
I have tried out by changing the display characteristic as KEY/ TEXT/ KEY & TEXT but still at the BO end the it is displayed as TEXT.
Workaround Tried: I have used the detailed object for the Dimension 0CUST_SALES__CUSTOMER- key in SAP BO i.e the key value where in we are able to view the customer ID. But we are unable to pass the value from parent report to child report as the query level Filter cannot be applied onto a detaield object.
Is this a BI- BO Integration issue?? Kindly help me out with the same.
Regards
Akshay.

Hello Victor,
I have gone through the doc sent. It was helpful.
Info Object (BW)/ Dimension (BO): 0CUST_SALES__CUSTOMER.
In SAP BO the dimension has detailed object under it 0CUST_SALES__CUSTOMER- KEY and 0CUST_SALES__CUSTOMER- TEXT.
Now I can pass "0CUST_SALES__CUSTOMER- KEY" from the parent report. But in the child report we cannot apply Query level Prompt / Filter on the detailed object which will hold the parameter passed from the Parent report.
Q1: Can we apply prompts on a detailed objects?? Is there any configuration changes required.
Q2: Is there any other method the achive the same??
Regards
Akshay.

I need to unsubscribe the creative suite from my computer and put it onto my new one, how do i do this

I need to unsubscribe the creative suite from my computer and put it onto my new one, how do i do this

There is a bit of confusion in the way you explain what you want... more on that in a minute. Whatever the scenario is, you are allowed to have the software installed and working on two machines, so if you like you can leave the original installation intact as a backup and just install on the new machine like you did originally.
Back to the confusion... You say "unsubscribe" which would be associated with the Creative Cloud. You say "creative suite" which would not be a subscription (I think they stopped CS subscriptions when the Cloud came into being). So if you have a Cloud subscription you would sign out of it on the old machine if you no longer want it there. Then you could uninstall if you like. If you have a licensed Creative Suite then you would open any one of the applications in it and choose Help -> Deactivate. Then you could uninstall if you like.

If you have a smart phone, can you conect it to the new wrieless ipad's or do you need to order the wireless service from verizon?

If you have a smart phone, can you connect it to the new wireless ipad's or do you need to order the wireless service from Verizon for ipad's or do you need to order the wireless service from verizon?

Kneehightoughguy,
You do not need to purchase service from a carrier unless you want to utilize the iPads connection to a 3G Network on it's own (directly). You may choose to add a Tethering plan onto your existing cell phone plan and to have an iPad connect to the Wifi connection that the Tethered phone would offer.
Always compare your usage and your costs, as your mileage may vary.
Brad

Which Preview will do the code migrations?

I have tried the Tech preview 1 and now 2 and neither of them will import a 10.x project.
This late in the game I would think the migration would be done, and since there is a migration tool that pops up when you try and open an old existing project.
My project is over 1000 files, I would not want to have to massage a project of this size, just to use the newest version of JDEV
Thanks
Kelly

My Project consists of using the ADF/bc4j as the data model, and JSF pages.
A lot of the views are dropping thier respective java code files and need to be recreated by selecting the view object and clicking on the java file check boxes for the different layers.
The multiselect core table code that I used from the examples of the previous version are no longer valid with trinidad (this was the default option for the upgrade/migration to use trinidad).
Those were the two biggest things that I saw so far.

Do we need to compile the code migrating from JDK 1.4.2.11. to 1.4.2.15

Similar Messages

Maybe you are looking for