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 4007442
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 20, 20262026-05-20T08:37:58+00:00 2026-05-20T08:37:58+00:00

I have got a std::string like this: std::string fileName; where fileName is like /tmp/fs////js//config.js

  • 0

I have got a std::string like this:

std::string fileName;

where fileName is like /tmp/fs////js//config.js
It is coming from somewhere and I need to store it. But when I store it, I need to remove extra ‘/’ chars from the path, basically need only one separator between directory names and file names.

I can remove these by iterating over the string one char at a time and comparing with the next char, but its not very efficient.

Can anyone suggest some efficient way to do it?

  • 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-20T08:37:59+00:00Added an answer on May 20, 2026 at 8:37 am

    You’re not going to find anything more efficient than that – think about it – you need to remove consecutive duplicated characters – the imnplication is that, even in the best case, you’re going to have to look at every character at least once.

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

Sidebar

Related Questions

I have got a std::list< std::pair<std::string,double> > , which I know is sorted according
I have this code: std::string name = kingfisher; char node_name[name.size()+1]; strcpy(node_name,name.c_str()); node_name[name.size()] = '\0';
I have a function like this: int find_string ( string *url){ if(*url.find() != string::npos){
Possible Duplicate: Splitting a string in C++ I have this vector function from one
Possible Duplicate: Convert std::string to const char* or char* i've got a line from
I have got this circle detection working but only detects 1 circle. How would
I have got this code: function init(){ if (typeof window.jQuery !== 'function') { var
i have got <div><a class='link' href='index.php' data-container='target'>Load</a></div> <div class='target'></div> i need to write jquery
I have got two pages. example.com/php.com and example.com. I use this function to set
I have a class Foo defined like this: class Foo { public: Foo(int num);

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.