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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 19, 20262026-06-19T01:57:28+00:00 2026-06-19T01:57:28+00:00

The regular expression, specifically for negative lookahead patterns, does not seem to work properly

  • 0

The regular expression, specifically for negative lookahead patterns, does not seem to work properly in Android 2.1 code.

See example below:

private String parseString(String regex, String raw) {
    StringBuffer sb = new StringBuffer();
    Matcher m = Pattern.compile(regex).matcher(raw);
    m.matches();
    if (m.find()) sb.append(m.group()); 
    return sb.toString();
}

// Using the helper method above:
// Looking for 4-digit numeric strings within a text
String regex = "(\\d{4})(?!\\d)";
String text = "Looking for a 4-digit string 1234 in here!";
Log.i("Test", "[" + parseString(regex, text) + "]");

On Android 2.1, the result comes as:

I/Test (  451): []

On Android 2.2, it is:

I/Test (  451): [1234]

Does anyone know the reason for this?

  • 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-06-19T01:57:29+00:00Added an answer on June 19, 2026 at 1:57 am

    There is a bug in Android’s regular expression, specifically for negative lookahead patterns.

    Official ticket was created and fixed in Android 2.2 (Froyo):
    http://code.google.com/p/android/issues/detail?id=17159

    The solution:

    (a) Do not use Android 2.1 if you need this; or

    (b) Rebuild your regex without negative pattern (might get dirtier, but should work)

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

Sidebar

Related Questions

I need a regular expression that will not allow multiple special characters in a
I can't seem to understand regular expression at all. How can I match a
Is there a simpler way to write the following regular expression, specifically avoiding all
Problem : Regular expression not working as expected for HBase scan filter. Although this
I'm looking specifically for a regular expression that will grab the last term of
How would you create a regular expression that would parse the following url http://example.com/answers/38-my-example-question-on-regular-expression
Is there a reference for the regular expression language included in C++11 (i.e. not
Is there a way to declare preference in a regular expression? For example assume
I am learning about regular expressions and more specifically word boundries. I have a
What regular expression can I use (if any) to validate that a given string

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.