No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
11 Posted Topics
 | Re: Compile Java For what it's worth, go to [URL]http://www.jgrasp.org[/URL] and download their very easy to use GUI-based editor. There are not a lot of bells and whistles, but it is free and is a decent enough compiler. Additionally, the actual Java compiler should be in a directory called jdk1.5.0_08\bin. This is providing …  |
| | I have two datasets that are being returned from two separate stored procedures. I need to be able to merge these two datasets into one so that the resulting dataset can be used to populate a DataList. I tried the typical ds1.Merge(ds2, true), but the result was not correct (as … |
| | Is there a way in JavaScript to add a footer to the bottom of each page that says something like "Continued on next page..." when the user prints the document? I know that the footer is generally controlled by the client's browser, and am not trying to get rid of … |
| | I am trying to find the number of times that one string is found in another string. I tried using (string= "x" "xyzx"), but of course that stops after the first match. If I put this into a loop, how would I define how to escape? Is there a way …  |
| | Is there a way to define a PrintWriter object in main() and use it in other methods (within the same class) without having to pass the object as a parameter to all of the other methods? For example: [code] public static void main (String args []) throws FileNotFoundException { PrintWriter …  |
| | If I were to implement a heap constructed of integer values, does it matter that the root is not the smallest value? In my algorithm book it always shows the root being the smallest value given. But the [URL="http://en.wikipedia.org/wiki/Heap_%28data_structure%29"]Wiki entry[/URL] shows the root as being the largest value.  |
| | I am trying to write a recursive function that will produce a fractal snowflake, but am not getting the correct results. For some reason it gets caught in an infinte loop, but I cannot figure out why. Any help is appreciated. [code] [COLOR=#941edf]private[/COLOR] [COLOR=#941edf]void[/COLOR] recursiveDraw([COLOR=#941edf]double[/COLOR] x1, [COLOR=#941edf]double[/COLOR] y1, [COLOR=#941edf]double[/COLOR] x2, … |
| | I have a basic Java file I/O question. I am trying to read/write from/to a text file (obviously) from within a function that is called by main(). Can you do the following within a function: [code] Scanner inFile = new Scanner(new FileReader("File1.txt")); PrintWriter outFile = new PrintWriter("File2.txt"); [/code] or does … |
| | I have two text files that I am trying to compare (test.txt and removewords.txt. If a word from removetext.txt is found in test.txt it should be excluded from the output; otherwise it should be displayed. Here is my code: [code] while ( inClientFile >> word ) { while ( inIgnoreFile … |
| | Hello, When I compile the following code I get this single error: In constructor `Point::Point expected `{' before ':' token ()': I cannot figure out what is wrong. What am I missing? Thanks. Header file [code] #include <iostream> using std::cout; using std::endl; class Point { friend void setX( Point &, …  |
| | Hello, I think my problem is a simple one (but probably isn't) and something that I have foolishy overlooked. I have created a class (Time) with a constructor that has as its argument a 3x3 int array. It is defined in a header file as follows: [code] public: Time(int [][columns]); … |
The End.