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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T06:17:43+00:00 2026-06-11T06:17:43+00:00

Given a unordered list of List<String> , I need to find whether there exist

  • 0

Given a unordered list of List<String>, I need to find whether there exist a String that matches supplied String.

So, i loop

    for (String k : keys) {
        if (Utils.keysMatch(k, anotherKey)) {
            result = true;
            break;
        }
    }

Where Utils.keysMatch checks if appropriate matching can happen.

Can the same be done without a complete iteration? Note that k may be a regular expression.

  • 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-11T06:17:44+00:00Added an answer on June 11, 2026 at 6:17 am

    You can do it in elegant way with Guava’s Iterables.any method and static Predicates class

    like this:


    return Iterables.any(keys, Predicates.containsPattern(k);

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

Sidebar

Related Questions

Given that an input String may be specified as follows: read(xpath(‘...’)) or xpath(‘...’) or
I have an unordered list that is being loaded from an external file using
Given the following unordered list, the JQuery selector $(#root #2) selects: /ul/li/ul[@id='root']/li/ul[@id='1']/li/ul[@id='2'] Whereas I
I have an unordered list of links that I save off to the side,
Given an unordered list of values like a = [5, 1, 2, 2, 4,
I need to render a unordered list with the data obtained from database using
I have a <dl> description list that is unordered and therefore should display bullets
There is unordered list , which not works properly in IE6-7, I would like
Given an un-ordered set, such as: 1,2,3,4,0,5,6,7,-1,-2,-3; Find the longest ascending sub set in
Given that the web application doesn't have su privileges, I'd like to execute a

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.