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

  • Home
  • SEARCH
  • 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 6722119
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T09:24:34+00:00 2026-05-26T09:24:34+00:00

Suppose I would like to match for the following pipe-delimited strings: std::string re(a|*|c); std::string

  • 0

Suppose I would like to match for the following pipe-delimited strings:

std::string re("a|*|c");
std::string x("a|b|c");
std::string y("a|c|d");

does_match( re, x );  // want to return TRUE
does_match( re, y );  // want to return FALSE

what is the best way to implement does_match() using boost::regex?

I think I may be running into issues with escaping pipes and stars. Note that I don’t care about the actual matches: I just want an easy-to-use interface to does_match() to tell me if I have a match.

In particular, I hope to get this working without having to use a ton of escapes for pipes and stars. I don’t care about other more general uses of regex – if I can use pipe-delimiters and * for wildcards, that’s sufficient.

Maybe I should do a transform inside does_match to make boost::regex happy? Or perhaps my entire approach is bad (like I should be using some kind of strsplit() instead?).

  • 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-26T09:24:35+00:00Added an answer on May 26, 2026 at 9:24 am

    Ok, I think I’m barking up the wrong tree by attempting to solve this with boost::regex() – boost::split() is probably more appropriate.

    #include <string>
    #include <vector>
    
    #include <boost/algorithm/string.hpp>
    
    bool does_match( const std::string& fmt, const std::string& str )
    {
        std::vector<std::string> strs, fmts;
        boost::split( strs, str, boost::is_any_of( "|" ));
        boost::split( fmts, fmt, boost::is_any_of( "|" ));
        if ( strs.size()!=fmts.size() )
            return false;
        size_t n = strs.size(); 
        for( size_t i=0; i<n; ++i )
            if ( fmts[i].compare("*")  && fmts[i].compare( strs[i] ))
                return false;
        return true;
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I would like to find the count of Exact match of string Let suppose
Suppose I have this Windows wchar_t string: L\x4f60\x597d and L\x00e4\x00a0\x597d and would like to
Suppose I want to implement an interpreter for a functional language. I would like
Supposed I have the following string: string str = <tag>text</tag>; And I would like
I would like to ask how licensing works on multiple instances? Suppose that I
Let's suppose I'm using the Northwind database and I would like to run a
Suppose we have an Option[String], and if there is Some(string) in there, we want
im relatively new to ROR, and would like some help with the following code.
Suppose there is a large text file and I would like to print only
Suppose I have a lex regular expression like [aA][0-9]{2,2}[pP][sS][nN]? { return TOKEN; } If

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.