[Okta Webinar] Learn how to a build a cloud-first strategyRegister Now

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 216
  • Last Modified:

interacting with elements of a templated container

Hi,

I made a templated container class for testing out templates. It is a simple doubly linked list. Previously I had specified the exact type the container used so there were class specific operations in there, one of which was dumping the contents of the container (just pseudo code):

    class CLinkedList {

         CSpecificClass *m_pLinkedList;

         void DumpToScreen()
         {
              while (m_pLinkedList) {
                   next->PrintContents();
              }
    };

Now CLinkedList uses templates for the data it stores and so what can I do for an operation to dump all the contents of the list since I don't know what the user is going to stick in there? I can't do anything really, can I? I'd have to do it externally now like:

     int main()
     {
          CLinkedList<CWhatever> list;
          list.AddNode(...);
          list.AddNode(...);
          list.AddNode(...);

          // Iterate through each element somehow out here since I know the type only outside, not internally:
          while (somehow iterate externally over the list's elements) {
              *it->Print();
          }
     }

I guess this is why stl implemented the iterators, I'd have to do the same thing?

Thanks
   
0
DJ_AM_Juicebox
Asked:
DJ_AM_Juicebox
  • 2
1 Solution
 
jkrCommented:
Implementing iterators on your own might be some overkill for startng out, but you could do something like

    template<typename T>
    class CLinkedList {

        public:

        CLinkedList () { // default constructor

            m_pNodes = NULL;
            m_pCurrent = NULL;
        }

        CNode<T>* First() const { m_pCurrent = m_pNodes; return m_pCurrent;}
        CNode<T>* Next() const {

            if (!m_pCurrent) return NULL;

            m_pCurrent = m_pCurrent->m_pNext;

            return m_pCurrent;
        }

        private:
        CNode<T> *m_pNodes;
        CNode<T> *m_pCurrent;
    };

     int main()
     {
          CLinkedList<CWhatever> list;
          list.AddNode(...);
          list.AddNode(...);
          list.AddNode(...);

          // Iterate through each element somehow out here since I know the type only outside, not internally:
         CWhatever<CSomeType>* it = list.First();;
          while (it) {
              it->Print();

              it = list.Next();
          }
     }
0
 
jkrCommented:
Ooops, remove the 'const' in the above, that should just be

        CNode<T>* First() { m_pCurrent = m_pNodes; return m_pCurrent;}
        CNode<T>* Next() {

            if (!m_pCurrent) return NULL;

            m_pCurrent = m_pCurrent->m_pNext;

            return m_pCurrent;
        }
0
 
DJ_AM_JuiceboxAuthor Commented:
Yep that's perfect, thanks as always.
0
 
AxterCommented:
Hi DJ_AM_Juicebox,
> I guess this is why stl implemented the iterators, I'd have to do the same thing?
>>I guess this is why stl implemented the iterators, I'd have to do the same thing?

Are you sure you need a link list.  Rarely is a link list the correct container type, and for most requirements, a std::vector type contianer is much more efficient and more appropriate.
Moreover, with a std::vector, you can use operator[] instead of iterators.

David Maisonave (Axter)
Cheers!
0

Featured Post

Free Tool: IP Lookup

Get more info about an IP address or domain name, such as organization, abuse contacts and geolocation.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now