- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
Re:
Hi, I'm new on this forum, but a friend directed me here to seek further assistance with a program I am trying to create. I have to create a program that can manage 10 bank accounts, one of which uses appropriate type definition to store the name, account number, balance … |
|
Re:
I am doing Project Euler Problem 3, but I seem to get stuck. I have written some code that makes sense (at least to me) but keeps printing the answer to 137. This is the problem: The prime factors of 13195 are 5, 7, 13 and 29. What is the … |
|
Hi I using gcc on a .S file to assemble my program. [CODE] #include <string.h> .text .global defaultBSTNode defaultBSTNode: pushl %ebp movl %esp, %ebp addl $last_local, %esp #//void * memset ( void * ptr, int value, size_t num ); pushl $bst_size pushl $0 pushl retValuePtr(%ebp) call memset addl $12, %esp … |
|
I am having problems accessing the members of the base class in my derived class. Is there anything wrong with the way I defined my base class as in: template <class T> class Stack : private Llist<T> Is there anything wrong with that? I am getting errors from gcc in … |
|
[CODE] template <class T> class Llist //.... //Iterates to position and sets pointers to node at position-1 and position. template <class T> void LList<T>::iterate(Node<T>*& previous, Node<T>*& next, unsigned short pos) { //some code } //Start Iterator template <class T> inline Iterator<T> LList<T>::start() { //some code } template <class T> class … |
|
|
Re:
I am troubled by my very long code for a movie reservation program. A friend of mine told me that I can shorten my very long code using functions. What made my code very long is the switch statement that I used which is composed of 200 cases. Sorry because … |
Re:
What is the difference between Structure and Class? Is there are any particular situations when I should use what? Once I implemented Binary search tree using structure. Now, I am trying to implement Red black tree using Class? But many discourages using class in this kind of situation, they say … |
|
Re:
so im taking the advice of 1ML, seems like a smart guy, and starting a second thread for the controversial, main calling, system calling, devil code, anyway i did take your guys advice and cut out the main calls and reduce everything to one fuction. however! ladies and gentlemen we … |
|
Name: Jade Height: 5'10'' Hair: green Eyes: purple Location: CA (originally from LA, the state) Age: 27 Hobbies: computer, meditation, fun Relationship Status: single Fav Music: metal, punk, lounge, acid-jazz Education: junior BS in CSC at UC Davis Work: Math Tutor Favorite TV Shows: XFiles |
|
Right now I am using gdb on command line in Ubuntu. It seems pretty inefficient and cumbersome. Is that just because of the learning curve or because it is really that way? Do "real" c++ programmers use gdb? I felt the same way about vi until I learned to use … |
|
Re:
Hi everybody, I am new to the programming world and I have an assignment that I need to write an array then a new array that needs to allocated dynamically and, then, populated in reverse order before being displayed all within a function. Here is what I have so far … |
|
Re:
Could someone explain to me (in layman's terms please) when to use pointers, pass by reference, this pointer and friendly functions. I understand the concepts but I can't think on my own when to use them. Can someone explain? thanks. |
|
Re:
The program asks the user to provide from 1 to 6, inclusive, numbers between 1 and 59, inclusive, as their lotto numbers. The lotto program will then use the random number generator to provide the same number of numbers in the same range. Check to see how many of the … |
|
Re:
I need to turn this code for a class that checks for a out-of-bound value: class array {public : int & operator [] (int); // Prototype; overloaded operator int size () // In-line function {return ub - lb + 1; }; int lbound () {return lb; }; int ubound () … |
|
This is giving me a segmentation fault in the noBucket() function. I don't see why. Does it having something to do with it being a const function? My other accessor functions are working fine and they are declared exactly the same with just a different name. The files are longer … |