|
Hi and thanks for the response.
I tried to move the counters inside the method "ledcountdown". It doesn't seem to have any effect. I still get the effect of color change between instances of tile[][] when a new call to the ledcountdown1 is issued in a different instance of tile[][].
And for some reason color shows up on an instance of tile even though Im not calling ledcountdown in that instance. (I put a print statement inside the ledcountdown method to see if it was being called).
I dont think I can instantiate the timers anonymously because I need to be able to cancel them.
Is it possible to use the same instance of a timer if each one is inside a different instance of the TileMaker class ?
Im not following you with the id, idea.
modified on Tuesday, June 28, 2011 11:26 AM
|
|
|
|
|
do me a favour:
- Set up a custom Timer object aside of your existing code.
- Give the Timer an ID so that you can check whether the same timer object is called to often.
regards Torsten
I never finish anyth...
|
|
|
|
|
I haven't set up the timer like you asked because when changing the ledlist from static my problems got solved. But I had to change the scope of the timers to global within the class because otherwise the timer tasks would not cancel when I asked them to.
Thank you for your suggestions.
|
|
|
|
|
you're welcome. Nice failure.
regards Torsten
I never finish anyth...
|
|
|
|
|
Why is ledlist static? I'm not 100% clear in my mind what you're trying to achieve but if ledlist is static, how do you distinguish the 8 LEDs on canvas 1 from the 8 LEDs on canvas 2?
|
|
|
|
|
Bah that static has no valid reason to be there Oo.. Thanks for pointing that out.
I'll see if this changes anything tomorrow when I connect to the hardware that I'm interacting with.
Thank you.
|
|
|
|
|
Your comment about the static ledlist seems to have done the trick. Random LEDs don't appear any more nor do I see a brief color change when a new tile starts it's countdown.
Thank you very much for pointing me to that damn static =)
|
|
|
|
|
plese tell me the blue j code for tictactoe game
|
|
|
|
|
This is really not a very sensible question. Firstly it is not clear, secondly it implies that you are too lazy to do the most basic research (via Google) for yourself, and thirdly, nobody here is just going to give (or write) a full program for you for nothing.
The best things in life are not things.
|
|
|
|
|
sir actually i have made the code but it is giving so many errors and i have to submit it on 1st of july that is whay i need proggram help and code
|
|
|
|
|
Four days to debug your code. POP!
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
Are they compilation errors? Logic errors? The best thing you can do is try to break your code into small logical parts, and try to fix the issues that you've got there.
It's extremely unlikely that anybody here will give you the code you are so desparately after, so you'll just end up wasting valuable time arguing and begging with people here. Save yourself that time, and learn some valuable debugging techniques while you are at it.
|
|
|
|
|
sir actually i have dividied into the function but ther are still problems in logic as well as in compilation plese send me suggation as much fast you can because my computer is going some where else tomarrow
|
|
|
|
|
I know I'm good, but I'm not that good, that out of all of the millions of computers in the world I can narrow my telepathic field to pick the details of the screen that you are looking at.
|
|
|
|
|
|
Ooh. Text speak. Guaranteed to really annoy.
Which bit of people aren't going to write this code for you don't you get? It's not a hard concept; rather than wasting time begging, you should actually be trying to fix your errors. The obvious course of action would be for you to post the sections code that doesn't compile and see if you can get help there, rather than asking us to write the code for you.
Bottom line - only a moron is actually going to give you the code. We are professional programmers who don't appreciate having substandard developers polluting the coding gene-pool, and if we help you pass, we've just helped somebody who doesn't deserve to be a coder.
|
|
|
|
|
Pete O'Hanlon wrote: Ooh. Text speak. Guaranteed to really annoy.
Man, forget helping the OP now, as far as I'm concerned.
"The clue train passed his station without stopping." - John Simmons / outlaw programmer
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
"Not only do you continue to babble nonsense, you can't even correctly remember the nonsense you babbled just minutes ago." - Rob Graham
|
|
|
|
|
This is homework. We don't do homework. We have jobs to do.
Show us what you've got.
regards Torsten
I never finish anyth...
|
|
|
|
|
|
I need to find an alphanumeric sequence example:1wer3rtyu4sd inside a block of text
to which the alpanumeric sequence is unique.
I am using the following piece of code:
Pattern pattern = Pattern.compile(regex);//need a proper regex
Matcher matcher = pattern.matcher(strLine); //strLine consists the text
if (matcher.find())
{
System.out.println(matcher.group());
System.out.println(matcher.groupCount());
}
|
|
|
|
|
Your question is unclear. Are you searching for a pattern that you already know exactly? If so, use strLine.indexOf(wantedString). If you are doing something selse, you need to tell us more about how to specify the search pattern.
Peter
Software rusts. Simon Stephenson, ca 1994.
|
|
|
|
|
I successfully created UNbalanced Binary Search Tree to see if I can actually do it and I did - However, I would like to know how to make it a "Balanced" Binary Search Tree.
Here is the code for "BinarySearchTree.java"
package util;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.NoSuchElementException;
public class BinarySearchTree implements BinarySearchTreeADT {
private static final String INDENT = " ";
private Node root;
private static String makeIndents(int indent) {
String result = "";
for (int i = 0; i < indent; i++) {
result = result + BinarySearchTree.INDENT;
}
return result;
}
@Override
public final void add(Comparable item) {
this.root = addIterative(item, this.root);
}
private Node addIterative(Comparable item, Node n) {
Node originalTree = n;
if (n == null) {
Node newNode = new Node();
newNode.item = item;
return newNode;
}
while (n != null) {
int compare = item.compareTo(n.item);
if (compare == 0) throw new DuplicateElementException();
if (compare < 0) {
if (n.left == null) {
n.left = new Node();
n.left.item = item;
break;
}
else n = n.left;
}
else {
if (n.right == null) {
n.right = new Node();
n.right.item = item;
break;
}
else n = n.right;
}
}
return originalTree;
}
private Node add(Comparable item, Node n) {
if (n == null) {
Node newNode = new Node();
newNode.item = item;
return newNode;
}
if (item.compareTo(n.item) > 0) {
n.right = add(item, n.right);
return n;
}
if (item.compareTo(n.item) < 0) {
n.left = add(item, n.left);
return n;
}
throw new DuplicateElementException();
}
@Override
public Iterator<Comparable> iterator() throws ConcurrentModificationException,
UnsupportedOperationException {
throw new UnsupportedOperationException("To do.") ;
}
@Override
public String printTree() {
if (this.root == null) return "";
return "\n" + printTree(this.root, 0);
}
private String printTree(Node root, int level) {
String result = "";
if (root.right != null) {
result = result + printTree(root.right, level + 1);
}
result = result + makeIndents(level) + root.item.toString() +
"(" + root.getBalanceFactor() + ")\n";
if (root.left != null) {
result = result + printTree(root.left, level + 1);
}
return result;
}
@Override
public void remove(Comparable item) {
this.root = removeIterativeAlmost(item, this.root);
}
private Node removeIterativeAlmost(Comparable item, Node n) {
Node parent = null;
Node toremove = n;
while (toremove != null) {
int compare = item.compareTo(toremove.item);
if (compare == 0) break;
parent = toremove;
if (compare < 0) toremove = toremove.left;
else toremove = toremove.right;
}
if (toremove == null) throw new NoSuchElementException();
if (toremove.left == null) {
replaceChildNodeInParent(parent, toremove, toremove.right);
return n;
}
if (toremove.right == null) {
replaceChildNodeInParent(parent, toremove, toremove.left);
return n;
}
Comparable largest = findLargest(toremove.left);
toremove.item = largest;
toremove.left = removeIterativeAlmost(largest, toremove.left);
return n;
}
private void replaceChildNodeInParent(
Node parent, Node currentchild, Node newchild) {
if (parent == null) this.root = newchild;
else if (parent.left == currentchild) parent.left = newchild;
else parent.right = newchild;
}
private Node remove(Comparable item, Node n) {
if (n == null) throw new NoSuchElementException();
if (item.compareTo(n.item) < 0) {
n.left = remove(item, n.left);
return n;
}
if (item.compareTo(n.item) > 0) {
n.right = remove(item, n.right);
return n;
}
if (n.left == null) return n.right;
if (n.right == null) return n.left;
Comparable largest = findLargest(n.left);
n.item = largest;
n.left = remove(largest, n.left);
return n;
}
private Comparable findLargest(Node n) {
while (n.right != null) {
n = n.right;
}
return n.item;
}
private Comparable findSmallest(Node n) {
while (n.left != null) {
n = n.left;
}
return n.item;
}
private class Node {
private Comparable item;
private Node left;
private Node right;
private int getBalanceFactor() {
return -999;
}
}
}
Here is the code for "BinarySearchTreeADT.java"
package util;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
public interface BinarySearchTreeADT {
public void add(Comparable item) throws DuplicateElementException;
public Iterator<Comparable> iterator() throws ConcurrentModificationException,
UnsupportedOperationException;
public String printTree();
public void remove(Comparable item);
}
Here is the code for "DuplicateElementException.java"
package util;
public class DuplicateElementException extends RuntimeException {
}
Here is the code for "Program.java"
package util;
import java.util.Iterator;
import util.BinarySearchTree;
import java.util.TreeSet;
public class Program {
private static final String NAME = "D3158";
public static void main(String[] args) {
BinarySearchTree tree = new BinarySearchTree();
System.out.println("BST: " + Program.NAME);
System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");
tree.add("Eve");
tree.add("Pam");
tree.add("Zoe");
tree.add("Cam");
tree.add("Lee");
tree.add("Joy");
System.out.println("\nBinary search tree after add: Eve Pam Zoe Cam Lee Joy");
System.out.print(tree.printTree());
System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");
tree.add("Ivy");
tree.add("Abe");
tree.add("Fay");
System.out.println("\nBinary search tree after add: Ivy Abe Fay");
System.out.print(tree.printTree());
System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");
System.out.println("\nIterator output\n");
for (Iterator<Comparable> it = tree.iterator(); it.hasNext();) {
System.out.print(it.next() + " ");
}
System.out.println("\n\n= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");
tree.remove("Lee");
tree.remove("Cam");
tree.remove("Abe");
System.out.println("\nBinary search tree after remove: Lee Cam Abe");
System.out.print(tree.printTree());
System.out.println("= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =");
}
}
|
|
|
|
|
Are you asking us to review your code, rewrite it for you, or give you an algorithm for how a balanced binary tree should work?
|
|
|
|
|
Review the code, of course. Then rewrite the code(with comments possibly, so I can understand it better) which is a big time request. I am struggling big time with it. Please assist me.
|
|
|
|
|
can you answer me:
How do you define the Binary Seach Tree(BST)?
if you define by List Link you can repair struct of two tree:
step 1: find possible of root of tree 2 in tree 1;
step 2: replace link at this possible
step 3: ok;
|
|
|
|