Need help in the code for updating a record ( conditional update)

all set
Edited by: 871431 on Jul 9, 2011 6:30 PM

871431 wrote:
Hi
I am looking to update a table which contains approved & unapproved records, for that date & fund combination it should allow only one unapproved record.
what I did is check if the record is U if the incoming value is Unapproved for that fund & date combination raise error, but if I need to update that Unapproved record it raises error....so I need to update that record, and raise error if trying to insert another unapproved record.
Hope I am clear....Not clear for me
Help needed plsPlease realize & understand that everyone here speaks SQL
please post DDL for table
please provide sample/test data & then explain using actual test data what the results should be & why

Similar Messages

I still need help with the Dictionary for my Nokia...

I still need help with the Dictionary for my Nokia 6680...
Here's the error message I get when trying to open dictionary...
"Dictionary word information missing. Install word database."
Can someone please provide me a link the where I could download this dictionary for free?
Thanks!
DON'T HIT KIDS... THEY HAVE GUNS NOW.

oops, im sorry, i didnt realised i've already submitted it
DON'T HIT KIDS... THEY HAVE GUNS NOW.

Need help with LabVIEW code for motor control.

Hi,
My name is Sasi. I am a BME grad student working on my thesis topic of evaluating spine implants for low back pain. For this I am building a test machine that would apply pure moments to a spine specimen. I am using LabVIEW 8.5 to implement control of a brushless AC servo motor. My requirement is,
Step 1: Initialize the motor.
Step 2: Start moving it at a uniform RPM to the right (This RPM value too user can enter).
Step
3: While doin Step 2; simultaneously read torque cell data (Using DAQ
asst.). DAQ o/p is from 0 V to 10 V; 0 V being -10 Nm n
10 V being +10 Nm
Step 4: When Torque value reaches +10 Nm, i.e 10 V, the motor stops.
Step
5: From the position where motor stopped (i.e no need to reset to
initial position) Start moving in the opposite direction at the same
uniform RPM as in Step 2 while reading torque cell data.
Step 6: Once again when torque reaches -10 Nm, i.e. 0 V, the motor should stop.
Step 7: Repeat 'Step 2' to 'Step 6' 3 times.
Step 8: Reset motor postion.
Till now I have managed to get the motor to move forward n backward @ a desired vel, accl, n deceleration for 3 cycles. I am attaching my code. I am having problem inserting the code for reading DAQmx amidst all this. Can anyone help me out.
Thnks,
Sasi.
Solved!
Go to Solution.
Attachments:
Test_012609.vi ‏35 KB

Hi Sasidhar,
I took a look at your problem and I think I have a workable solution for you. I definitely agree with Lynn's suggestion of using parallel loops. This will allow the DAQmx portion to run uninhibited by the motion portion, and vice versa. Plus, you only need to iterate the motion loop whenever the voltage level crosses a threshold. So, by iterating on the motion code in the same loop that you are iterating on DAQmx code, you are essentially wasting processor.
I created a VI that should do what you are wanting. I tested it out myself and it works great. You might have a tweak a few things to apply to your system (like motion board ID and DAQmx physical channel, etc.). I used two parallel loops and event-based programming. Basically the motion loop starts the motor spinning at the specified velocity. Once the motor is spinning, it waits for the DAQmx loop to tell it that the voltage value has crossed the threshold. When the voltage value exceeds the maximum threshold (which I set to a value slightly less than 10 to allow for jitter and saturation), the DAQmx loop signals the motion loop that it can finish its iteration. The motion loop stops the motion, reverses the direction, and starts the motion again. Once motion has started, it again waits for the DAQmx loop to tell it that a threshold has occurred, but this time, it is looking for a minimum threshold. I used "Occurrences" to implement the event-based programming in LabVIEW.
I have commented the code rather thouroughly, so hopefully the comments will answer any remaining questions. The benefit of using event-based programming for this is that you save processor time, and your motion is more closely synchonized with the DAQmx. Instead of iterating the motion loop as fast as you can, checking for updates each time, you just pause it, and wait for the other loop to tell you when to start up again. In the mean time, the processor doesn't have to worry about iterating that loop over and over again. Also, when the occurrence does occur, you catch it immediately, instead of having to wait until the next iteration. Thus, you are more closely synchronized with the DAQmx portion of the code.
I hope this will help you. Please post back if you have any questions about the code or its implementation. Good Luck!
Message Edited by Wes P on 02-03-2009 05:18 PM
Wes P
Certified LabVIEW Developer
Attachments:
Motion and DAQ.vi ‏59 KB
DAQmx Loop.png ‏24 KB
Motion Loop.png ‏17 KB

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

How can I view the code for a routine in an update rule

on loading data for 0PLANT_ATTR, I am getting an error for No Local Currency found in Plant 1000 and SAles Org 6000.
in looking at the update rules for this, I see that there is a routine for the update of the local currency:
Perform GET_LOCCURRCY_FOR_PLANT
USING COMM_STRUCTURE-PLANT
COMM_STRUCTURE-SALESORG
CHANGING hlp_monitor
RESULT
hlp_subrc.
How do I see the code behind this? I want to make sure that I understand everything that needs to be populated in Master Data so that I can ask my functional consultant to update all the necessary fields.
Thanks
JP

Hi Riccardo,
When I double click on it, I get a message at the bottom that says program reindexed.
After looking again, I found that when I double clicked on the comm structure, then the routine, I was able to see it.
Thanks
JP

Need help with Labview code for DAQmx

I'm currently trying to write Labview code for some thesis research and am having problems. I'm using the cDAQ 9172 with strain gage modules and two voltage input modules. I'll be reading/recording a voltage from an external source on one channel, while recording strains and accelerations with the other channels. I need to do all this simultaneously.
Everything I've done to this point has been in SignalExpress so I'm not sure how to program any of this. I also need to be able to calibrate the strain gages prior to each set of recordings. Any help you guys could offer would be greatly appreciated. Thanks.

Hi,
I'm not sure how much this will help you, but I've attached a screen dump of code from a project I did that sounds pretty similar to what you're working on. The code is from a subVI that I used to create the daqMX measurement task for my data acquisition. I was also using a 9172. This was written in 8.5, but the only thing that you may not have access to is the functions for null offset and shunt cal of the strain gage channels. Hopefully this will at least get you started on your way to setting this up.
Andrew Carollo
Attachments:
create task.jpg ‏208 KB

Need help to write code for 'Print" button......!

Hi all,
I am working in oracle forms 6i.I am creating forms for ordering product/quantity(Entering quantity/product details). In my form i have "Print button" to print the quantity details which is in multi-record block(database item).Please help me of how to write code for print button. If u had any source code please post it.
Please help asap......!
Thanks
regards,
jame

You haven't got an answer or a reply because this question is asked so many times.
Why don't you search the forum to find them?

NEED HELP WITH REDEEMING CODE FOR OS LION!

im running 10.6.8 and im trying to update to Lion , im qualifyed to update free apple has sent me a code to redeem on the mac app store but i says " the code you have entered is not recognised as a valid code."
PLEASE HELP!

IVE DONE IT, IF YOUR USING HOTMAIL EMAIL - CLICK DOWNLOAD ON THE ABOVE YOU MESSAGE AND A LINK SHOULD APPEAR, YOU SHOULD HAVE GOT ANOTHER EMAIL SAYING YOUR CODE - COPY AND PASTE THE CODE YOU GOT INTO THE LINK AND CLICK NEXT OR SOMETHING, THEN YOU SHOULD GET ANOTHER CODE AND GO TO MAC APP STORE ON YOUR LEFT YOU SHOULD HAVE "QUICK LINKS" AND UNDER THAT YOU SHOULD HAVE REDEEM CLICK THAT AND TYPE IN THE CODE YOU GOT FROM THE LINK THEN YOUR DONE!
Ps. if you did not get the email check your junk/spam folders.

Need Help regarding the JVM for the ARM926EJS Processor

I Want to develop an application in java for the IMX.27 board which has ARM926EJS Procesor. This processor is jazelle enabled hardware.
My questiion is that how to get the JVM for this. So that i will use my Java appliaction. I am using linux OS.
Thanks in advance.

Hi Narendra,
Sun actually has a VM for the ARM ... well, actually 2 VMs for the ARM. Depending on your needs, there's a solution for JavaME CLDC, JavaME CDC, or JavaSE. There's also the open source implementations for CLDC and CDC. Here's how to get more info:
JavaME: http://java.sun.com/javame/index.jsp
CLDC open source project: phoneME Feature: https://phoneme.dev.java.net/content/phoneme_platforms.html#phonemefeature
CDC open source project: phoneME Advanced: https://phoneme.dev.java.net/content/phoneme_platforms.html#phonemeadvanced
Embedded SE: http://java.sun.com/j2se/embedded/offerings.html
email inquiry to: [email protected]
Regards,
Mark

Need help with html code for password logins

I'm building a site and need to have a login page where multiple users can have unique usernames and passwords and then all be redirected to the same page within the same website. Does anyone have any code advice or tips on how this can be done in iweb. I getting stuck at the point in the code where I have to enter the site to be redirected to upon entering the correct username and password. I would greatly appreciate any advice or tips. Thanks

Its done on the server rather than in iWeb....
http://www.iwebformusicians.com/iWeb/Comments-Password-Protect.html

I need help finding the driver for my ethernet.it is a compaq presario sr1403wm with windows xp.

compaq presario sr1403wm
windows xp
my computer dropped the driver for the ethernet card and am unable to do a system restore.

HP Spring 2005 Original Network Adapter Driver Collection
or
SiS900 LAN Driver v1.19
Frank
{------------ Please click the "White Kudos" Thumbs Up to say THANKS for helping.
Please click the "Accept As Solution" on my post, if my assistance has solved your issue. ------------V
This is a user supported forum. I am a volunteer and I don't work for HP.
HP 15t-j100 (on loan from HP)
HP 13 Split x2 (on loan from HP)
HP Slate8 Pro (on loan from HP)
HP a1632x - Windows 7, 4GB RAM, AMD Radeon HD 6450
HP p6130y - Windows 7, 8GB RAM, AMD Radeon HD 6450
HP p6320y - Windows 7, 8GB RAM, NVIDIA GT 240
HP p7-1026 - Windows 7, 6GB RAM, AMD Radeon HD 6450
HP p6787c - Windows 7, 8GB RAM, NVIDIA GT 240

Need help in simple code for LayeredPane

Hi,
here is my simple code for displaying layered pane,
why is it not working, when i comment label.setBounds();
also is there a way to have a transparent layer, like
what i want to do it
have ont JPanel with some painting on it
then i want to add one more JPanel over it which is transparent
Ashish
import javax.swing.*;
import javax.swing.table.*;
import java.awt.*;
import java.awt.event.*;
public class TestLayeredPaneFrame extends JFrame
     public TestLayeredPaneFrame()
          super("layered pane");
          this.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
          JLayeredPane layeredPane =new JLayeredPane();
          layeredPane.setPreferredSize(new Dimension(400,600));
int x = 30;
int y = 30;
for (int i = 0; i < 3; i++) {
x +=30;
y +=30;
origin.x += offset;
origin.y += offset;
layeredPane.add(new myLabel(x ,y ), new Integer(i));
          Container contentPane = this.getContentPane();
          contentPane.add(layeredPane, BorderLayout.CENTER);
          JPanel panel = myGlassPane();
          this.setGlassPane(panel);
          setSize(new Dimension(800,600));
          this.setVisible(true);
     private JLabel myLabel(int x, int y)
     JLabel label = new JLabel("My Name");
label.setVerticalAlignment(JLabel.TOP);
label.setHorizontalAlignment(JLabel.CENTER);
label.setOpaque(true);
label.setBackground(Color.BLUE);
label.setForeground(Color.black);
label.setBorder(BorderFactory.createLineBorder(Color.black));
label.setBounds(x, y, 140, 140);
return label;
     public static void main(String args[])
TestLayeredPaneFrame tlp = new TestLayeredPaneFrame();
}

Hi,
here is my simple code for displaying layered pane,
why is it not working, when i comment label.setBounds();
also is there a way to have a transparent layer, like
what i want to do it
have ont JPanel with some painting on it
then i want to add one more JPanel over it which is transparent
Ashish
import javax.swing.*;
import javax.swing.table.*;
import java.awt.*;
import java.awt.event.*;
public class TestLayeredPaneFrame extends JFrame
     public TestLayeredPaneFrame()
          super("layered pane");
          this.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
          JLayeredPane layeredPane =new JLayeredPane();
          layeredPane.setPreferredSize(new Dimension(400,600));
int x = 30;
int y = 30;
for (int i = 0; i < 3; i++) {
x +=30;
y +=30;
origin.x += offset;
origin.y += offset;
layeredPane.add(new myLabel(x ,y ), new Integer(i));
          Container contentPane = this.getContentPane();
          contentPane.add(layeredPane, BorderLayout.CENTER);
          JPanel panel = myGlassPane();
          this.setGlassPane(panel);
          setSize(new Dimension(800,600));
          this.setVisible(true);
     private JLabel myLabel(int x, int y)
     JLabel label = new JLabel("My Name");
label.setVerticalAlignment(JLabel.TOP);
label.setHorizontalAlignment(JLabel.CENTER);
label.setOpaque(true);
label.setBackground(Color.BLUE);
label.setForeground(Color.black);
label.setBorder(BorderFactory.createLineBorder(Color.black));
label.setBounds(x, y, 140, 140);
return label;
     public static void main(String args[])
TestLayeredPaneFrame tlp = new TestLayeredPaneFrame();
}

Need help writing correct code for nested button

This is the code on the main timeline.
stop();
garage.addEventListener(MouseEvent.MOUSE_DOWN, mouseDownHandler);
function mouseDownHandler(event:MouseEvent):void {
    gotoAndPlay("open");
The movieClip gDoor is nested inside of garage and "open" is a label on that timeline. I know the gotoAndPlay("open"); isn't correct. How would i target the label on the nested timeline.
the link below is to dowload the fla
clienttestsite.x10.mx/beta/garage.fla

The problem is that you have an event listener assigned to the garage, which is blocking/overriding interaction with anything inside of it. When you click on the chest's button, you are still clicking on the garage, which does the gotoAndPlay("open")... where it stops at the stop();
One way to get around this is to assign an instance name to the door and assign the opening code to that....
stop();
garage.door.addEventListener(MouseEvent.CLICK, openHandler);
function openHandler(event:MouseEvent):void{
   garage.play();
garage.chest.closeBtn.addEventListener(MouseEvent.CLICK, closeHandler);
function closeHandler(event:MouseEvent):void{
   garage.gotoAndPlay("close");
Notes: as shown in the code above...
- use CLICK instead of MOUSE_DOWN.
- in the openHandler use play() instead of gotoAndPlay("open"). You are already in the "open" frame, and it is only because the stop() is used up that it actuallys works.
Doing what I explain above also makes it so that you can click the door to close things as well.

Need help with the code...

The program should accept two inputs from user in form of military time for example (1245). Then it should calculate and display the difference.
For some reason it displays 0's...
Please help.
Thanks.
public class TimeInterval
private int firstHour;
private int firstMin;
private int secondHour;
private int secondMin;
//Constructor
public TimeInterval(String first, String second)
String h1 = first.substring(0,1);
int h2 = Integer.parseInt(h1);
firstHour = h2;
//firstHour = Integer.parseInt(first.substring(0,1));
String m1 = second.substring(2,3);
int m2 = Integer.parseInt(m1);
firstMin = m2;
//firstMin = Integer.parseInt(second.substring(2,3));
String hh1 = first.substring(0,1);
int hh2 = Integer.parseInt(hh1);
secondHour = hh2;
//secondHour = Integer.parseInt(first.substring(0,1));
String mm1 = second.substring(2,3);
int mm2 = Integer.parseInt(mm1);
secondMin = mm2;
//secondMin = Integer.parseInt(second.substring(2,3));
//Methods
public int getHours()
int HourDifference = secondHour - firstHour;
return HourDifference;
public int getMinutes()
int MinutesDifference = secondMin - firstMin;
return MinutesDifference;
import java.util.Scanner;
public class TimeIntervalTest
public static void main(String[] args)
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the First time now:");
String hr = scanner.next();
System.out.print("Enter the Second time now:");
String mn = scanner.next();
System.out.println(hr);
System.out.println(mn);
TimeInterval timeDifference = new TimeInterval(hr, mn);
System.out.println(timeDifference.getHours());
System.out.println(timeDifference.getMinutes());
}

I can't say I understand your code, but for a starter, I think you are misunderstanding method substring:
public class StringExample {
    public static void main(String[] args) {
        String first = "2345";
        String h1 = first.substring(0,1);
        System.out.println(h1);
}

Need help getting a code for photoshop

I have had Adobe Photo Album Starter Edition 3.2 on my computer sinse 2007. and it has been registered . but every once in awhile it would say it is not registered but it still let me look at my pictures so i didnt worry about it. now it is doing it and i reregistered it again but this time it wont let me look at my pictures untill i enter a code that was spose to be emailed to me. it has been days now of me trying and i still am not getting no emails with a code, and i cant look at my pictures, and i had adobe erase my chip after it was done downloading. So those are the only copy i have of those pictures. Can you help me ? send me a doe to unlock it or something, please .....

PS Starter is long a dead product. Whatever automatisms were in place to provide activation codes ondoubtedly no longer exist. As Wade said, contact support directly. Though I'm pretty certain they can't help you, either. Simply use anotehr image viewer/ editing program like PSE.
Mylenium

Need help in the code for updating a record ( conditional update)

Similar Messages

Maybe you are looking for