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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T14:12:42+00:00 2026-05-31T14:12:42+00:00

for (int i = 0; i < nodes.getLength(); i++) { HashMap<String, String> map =

  • 0
for (int i = 0; i < nodes.getLength(); i++) {
    HashMap<String, String> map = new HashMap<String, String>();

    Element e = (Element) nodes.item(i);
    String nameMapString = XMLfunctions.getValue(e, "name");
    if(nameMapString.matches(".*+searchTextString1+.*")){
        map.put("id", XMLfunctions.getValue(e, "id"));
        map.put("name", "Name:" + XMLfunctions.getValue(e, "name"));
        map.put("Score", "Score: " + XMLfunctions.getValue(e, "score"));
        mylist.add(map);
    }


}

I am writing an android program.
searchTextString is user provided value from EditText.
nameMapString holds value of name tag from xml file.
Suppose it may contain Mark, Marry, Jack, JackMar etc.
When i search Ma only, i want to display all which contain Ma (in this case Mark,Marry,JackMar). but above code display all name.
Sorry for my bad english.

  • 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-31T14:12:43+00:00Added an answer on May 31, 2026 at 2:12 pm

    You can try indexOf(String str) method for it, see the updated code below,

    for (int i = 0; i < nodes.getLength(); i++) 
    {
        HashMap<String, String> map = new HashMap<String, String>();
    
        Element e = (Element) nodes.item(i);
        String nameMapString = XMLfunctions.getValue(e, "name");
        if ( nameMapString.toLowerCase().indexOf(searchTextString1.toLowerCase()) != -1 )   // != -1 means string is present in the search string
        {
            map.put("id", XMLfunctions.getValue(e, "id"));
            map.put("name", "Name:" + XMLfunctions.getValue(e, "name"));
            map.put("Score", "Score: " + XMLfunctions.getValue(e, "score"));
            mylist.add(map);
        }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

So I have two tables structured like so: CREATE TABLE #nodes(node int NOT NULL);
fringe = new PriorityQueue<Node>(10,new Comparator<Node>(){ @Override public int compare(Node node1,Node node2) { if (f(node1)>f(node2))
I have a list of Nodes which I loop through: for (int i =
So I've got the following: NodeList nodeList = element.getElementsByTagName(rowset); if (nodeList.getLength() > 0) {
My code does not retrieve the entirety of element nodes that contain special characters.
struct node { node(int _value, node* _next) : value(_value), next(_next) {} int value; node*
struct Node { int value Node* next; } typedef List Node* const Set operator
struct node { int id; float weight; }; int find_last(struct node Prio_Q[]) { int
struct Edge; struct Node { int id; vector<Edge> *edges; }; struct Edge { int
Given the following tree structure in Haskell: data Tree = Leaf Int | Node

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.