Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6733879
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T10:49:22+00:00 2026-05-26T10:49:22+00:00

So I have a function called find, which has two versions: template <typename T>

  • 0

So I have a function called find, which has two versions:

template <typename T> 
typename btree<T>::iterator btree<T>::find(const T& elem)
{
    //Implementation
}

and the other is the const_iterator version:

template <typename T> 
typename btree<T>::const_iterator btree<T>::find(const T& elem) const
{
    //Implementation
}

In my test file when I do

btree<char>::iterator it = myTree.find('M');

Everything works fine, however when I use the const_iterator version:

btree<char>::const_iterator it = myTree.find('M');

It gives me the error

error: conversion from ‘btree_iterator’ to non-scalar type ‘const_btree_iterator’ requested

Which obviously means that find is only ever using the iterator (non const) version. I know that C++ is supposed to call the const_iterator version automatically – if I had done everything right. So the question is, what might I be doing wrong?

The iterator classes are:

class btree_iterator and class const_btree_iterator which is just a copy paste of btree_iterator with the names changed

Here are the full source code:
btree_iterator.h (includes const_btree_iterator) http://pastebin.com/zQnj9DxA
btree.h http://pastebin.com/9U5AXmtV
btree.tem http://pastebin.com/U9uV3uXj

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T10:49:23+00:00Added an answer on May 26, 2026 at 10:49 am

    All the standard containers implement conversion of non-const to const iterators (as specified in the requirements for the Container concept):

    The type of iterator used to iterate through a container’s elements. The iterator’s value type is expected to be the container’s value type. A conversion from the iterator type to the const iterator type must exist.

    You need conversion constructor like so:

    class btree_iterator;
    class const_btree_iterator
    {
           // ....
           public:
                  const_btree_iterator(const btree_iterator& rhs) { /* .... */ }
    //optionally: const_btree_iterator& operator=(const btree_iterator& rhs) { /* .... */ }
    };
    

    I threw in the assignment operator too but I suppose it is redundant

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a file called function.js which has all my jQuery for my aplication
Now I'm sure this is super easy, I have a function called remove_deposit which
I have a function which calculates distance from database records. This function is called
I have a class called Type: class Type { ... } Which has a
I have a TypedDataTable called CamerasDT which has a composite Primary Key of GroupId
I have a function called FindSpecificRowValue that takes in a datatable and returns the
I have a function called: void initializeJSP(string Experiment) And in my MyJSP.h file I
I have a function called Colorbox (jQuery plugin) that takes a number of parameters
I have this function called ProperCase that takes a string, then converts the first
I have a prototype representing a particual IFrame. That prototype have a function called

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.