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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 4, 20262026-06-04T10:29:35+00:00 2026-06-04T10:29:35+00:00

How to find if a node does not exist ? i am using if

  • 0
  1. How to find if a node does not exist ?
    i am using

    if ( $item->branch()->siblings($tagNames[‘desc’])->text())

is there a better way ?

  1. is there a way to execute an OR query? if tag A exists get its text(), otherwise get B’s text() ?

I am using the following :

 $desc1 = (  $item->branch()->siblings($tagNames['desc'])->text()  ?
$item->branch()->siblings($tagNames['desc'])   :
$item->branch()->siblings($tagNames['descAlternative']) ) ;

which doesn’t look like the most efficient way of doing things.

Thanks

  • 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-04T10:29:36+00:00Added an answer on June 4, 2026 at 10:29 am

    Regarding the first:

    When QueryPath does not find a matching, it’s size is 0. So you can do:

    if (count($item) > 0) {
      // do whatever with $item
    }
    

    So for the second example, you could do:

    if (count($item->branch()->siblings($tagNames['desc']))) {
        $item->branch()->siblings($tagNames['desc']);
        $item->branch()->siblings($tagNames['descAlternative']) ) ;
    }
    

    But there’s another way: You can also pass two selectors in at once.

    $item->branch()->siblings('desc, descAlternative')->text();
    

    This will select both. However, text() will only return the text of the first matched item. So it has the effect of doing an OR.

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

Sidebar

Related Questions

Is there a way to find a node matched on part of a value.
This code here does not work when I try to find a single parent
I use apn node.js module to send Apple Push Notification but it does not
I'd like to find a way to take a piece of user supplied text
I'm using XMLSlurper. My code is below (but does not work). The problem is
I can't find a reason why the following does not work. If I have
using Eclipse 3.4 Ganymede and I cannot find the way to add javadoc support
I am currently learning server-side javascript development using Node.js and would like to find
Greetings How do you find the deepest node? So for this example, String would
How to find the Nth largest node in a BST? Do I keep 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.