Thread: STL list recursion

I need access to a list of a class called neuron passed in a function. The problem is this function is part of the neuron class itself. When I try to access the passed neuron with an iterator I get a compile error. Im not sure if this is recursion (in which case the post title is wrong). If the problem is because the class is trying to access itself before it's fully defined then is there any way around it?

Code:

class neuron {
public:
   //..
   deque<dend> dends;  //class with 3 int variables
   //..
   short calcExcitation(const list<neuron> &ln) {
      float total=0;
      neuron searchNeuron;
      list<neuron>::iterator iter;
      for(int i=0;i<dends.size();i++) {
         searchNeuron.neuronID=dends[i].ID;
         iter=find(ln.begin(), ln.end(), searchNeuron); //error here
         if(iter!=ln.end())
            total+=dends[i].weight * (*iter).excitation;
      }
      return excitation=total>ExcWeightThr?1:0;
   }
};

list<neuron> baseNeuron;  //global variable

The error I get is:

error C2679: binary '=' : no operator found which takes a right-hand operand of type 'std::list<_Ty,_Ax>::const_iterator' (or there is no acceptable conversion)
with
[
_Ty=neuron,
_Ax=std::allocator<neuron>
]

>> list<neuron>::const_iterator iter;

Do you know why?

gg

Thx codeplug. That made it work. After that I got 2 errors that neuron and dend didnt have == defined so I overloaded this operator for the both of them and it compiled fine.

To answer your question, I don't why. I didnt even know there was a const_iterator type with an underline. I know that const by itself means that a variable cant be altered but that's about it. When it comes to consts with container classes and iterators it just bogles my mind.