Search:

thanks Phil for the iterator::advance(). i know you're busy, which is why you forgot the open interval thingy:



li = l.begin();
if(l.size()%2!=0){
advance(li,l.size()/2);// l.begin()...

intuitively i would whimp out and repeat the method you designed; however i have done some research and i have formed an opinion on the skill set of those of who have had the benefit of 'java' as...

hey,
my question is in regards to the fact that a list<T>::iterator apparently doesn't work with pointer notation or comparision operators(not a pointer?). i came up with this last night after...

got it working... i understand the part about redeclaration; however, i don't see why changing the parameter's identifier was crucial. my question on where i can find a resource still stands. thanks...

i'm still having problems; what part(s) of the code above needs to be removed? also, is there a resource that i can review? thanks.

could you give a small example, please?

i see i am not the only one with template issues here; however this code compiles && runs in Visual Studio and not in gcc. i get the following errors:

error: declaration of 'class T'
error: ...

dude...

and your question is...

assignment is assignment; what you need is another data structure to hold the required values; ie :



int b[12] = {1,2,3,12,34,22,11,19,75,10,4,20};
int a[3][4];
int x = 0,i,j;...

this is what i mean...



//demo
#include <iostream>
using namespace std;

int main(){
int a[3][4];

are the values that you're assigning to the array discrete or random? you could use a for loop... the outer array index would be your row value; the inner the column value.

hey. i am a student. you do know that google is your friend? i just searched with the general terms stated above and found plenty of information! i even found some code... but i won't tell you...

so that's why the <bad_ptr> thing in the debugger! i do listen to what you gentlemen and ladies have to say... again thank you. due to the fact that my classmates were in tears thursday, i'll only...

You are a god!!!<not the g_d, mind you...> but a god none the less. i was ready to go back to java and be content with the crap that they spoon feed us...so i have to be mindful of the size(s) of the...

when i use that i get this:



which is why i never thought that it might be a size issue. i did get rid of the dereferencing... here is the relevent code in main as of (3) minutes ago :


...

yeah, i'm back. after reading up on slicing i kind of thought that maybe i need to implement the assignment operator, i suspect that the compiler's version is the one doing the cutting. however the...

what you talking bout willis? <meaning slicing>

okay, how would i accomplish that? i'm using visual studio so i have access to a debugger, but since i'm a student and my instructor doesn't do any "unnecessary" instructing, i wouldn't know where to...

thanks for that Lindley, however i have a different problem now. i fixed the sort but i'm getting the wildest output. it looks like the sort is rearranging the fields in the different instances. i've...

thanks Alan. i fixed it, it was the (t) pointer as well as the sort. i used a different algorithm. i also am the only one who turned in the project on time :D so here is the corrected code...


...

i hate to be back so soon, however i doubt seriously if i implemented the operator overloading in the subclasses correctly on this. the code runs fine without the sort:



class media{
...

i see that i might as well move in... thanks for that Lindley. as you can probably guess i got to run the code at home finally and found the seg fault in gcc. and of course you're correct, different...

#ifndef ACCOUNT_H_
#define ACCOUNT_H_

#include <string>

class account
{
protected:
int acctnum;
double bal;

IT'S VISUAL STUDIO! i re-read the posts and realized what you guys were saying about it shouldn't have compiled; i checked my code using someone else's account and found the problem. apparently there...