Search:

Yeah I did that with FileInputStream.read() and it took a lot longer. I mean, i exited the command prompt because I was tired of waiting.

I added the paragraph below my code the minute you posted, in case you didn't catch that. I'm willing to bet that what I've described is in the API. I tried using FileInputStream.read(), but it takes...

Is there an easier way to find duplicate files?



import java.io.*;
public class Test {
public static void main(String[] args) throws Throwable {
System.out.print(duplicate(new...

Imagine three objects with coordinates on a grid. I must compare the distance of object 1 and object 2 to object 3 with the distance formula. compareTo does not allow me to do with, mates. I need to...

In the interest of time, I ended up deciding that the code I posted was fine and that the teacher WAS talking about generics when she said "it should iterate through any list" (meaning any-typed...

Ok I understand. We called this the circularly-,doubly-linked list. It does get rid of the end node, so I'm gonna implement it because I'm a stickler for efficient code. But it still doesn't help me...

I have three files: Node.java, LinkedList.java, and LinkedListIterator.java. I will try to condense the presentation by omitting the junk inside routine methods, except the ones on which I want...

Sorry, I actually didn't read this paragraph. Kinda hasty. Ok, I have a Thinkpad x61. WinKey+Pause/Break says I have 3 GB RAM and a Core 2 Duo at 2 GHz. Also, I'm running Galileo, pretty recent.
...

This is screwed up. I've narrowed the issue down to one line in new_scanner.l:

EXP {EXP}{SP}("+"|"-"|"*"|"/"){SP}{VAL}|{VAL}
I ruled it further down to the recursive definition! I don't...

flex is happy when i run "flex scanner.l", but returns the error "flex scanner push-back overflow" when i run "flex new_scanner.l"

here are the files:

scanner.l:

/* scanner for a toy...

woooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooow script worked.

thanks so much.

Posting here because it's the only subforum whose description includes Linux, and I'm running Linux...

I'm accessing a linux account via ssh (putty). I don't think that matters. I'm just using the...

Will, not ability, is the issue here.

If you've got the RAM, eclipse really helps. Never click on a class variable that can't be resolved though. Eclipse will freeze for a full minute. You have been warned.

externalize node class => create constructor with first node as argument.

Inefficiency isn't elegant.

Don't use recursion for the Fibonacci sequence. It's running time is exponential --(3/2)^N. Every CS book that has a chapter on algorithmic analysis tells you this.

...

public class Test {
public static void main(String[] args) {
StringByComposition a = new StringByComposition("announce");
StringByComposition b = new StringByComposition("announce");
...

Run this short program for me:


import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Test {
public static void main(String[] args) throws Exception {
...

I love the idea of a separate sleek OS for gaming and graphics. I wish I could read what you have written, but my experience with Assembly is using MIPS for a class, lol...

Use the borderlayout manager. The first vertical panel would go in the west. The second would go in the center. The third would go in the east. The last horizontal panel would go in the south (or...

That is awesome and exactly what I was looking for thanks!

I think it is because of the implicit casting that happens when I add an integer to a double.I will have to implement a more complex loop that deals with numbers larger than 2147483647. I will post...

It is because you set the borderlayout of the Frame to null. That effective erases all the components within the layout. Delete that one line and you see the buttons.


f.setLayout(null);
...

If you don't understand basic syntax of Java, use google; don't use a forum. I'm going to help you anyway...


A = input.check;

This is unintelligible. There is no check instance variable...

Here is my code; the algorithm is taken from the Java API here


public int hashCode()
{
int code = 0;
for (int i = 0; i < length; i++) // where length is the length of the string....