RDF::Q...Pattern(3pm)

🌸 NAME 🌸

okay so bestie, meet RDF::Query::Plan::BasicGraphPattern β€” it's the executable query plan for BasicGraphPatterns, and yes it's exactly as iconic as it sounds πŸ’…


✨ VERSION ✨

This doc is describing RDF::Query::Plan::BasicGraphPattern version 2.919 β€” write that down, it's giving "citation needed" energy if you forget πŸŽ€


πŸ’– METHODS πŸ’–

first things first, bestie: on top of everything listed below, this class also inherits methods from the RDF::Query::Plan class. so it's not doing all this alone, it's got backup 🫢

  • new ( @triples ) β€” constructor vibes, takes @triples πŸ’«
  • execute ( $execution_context ) β€” runs the thing, passes in $execution_context πŸ”₯
  • next β€” grab the next one, move along, nothing to see here (affectionate) ⭐
  • close β€” wrap it up, we're done here πŸŽ€
  • distinct β€” returns true if the pattern is guaranteed to hand back distinct results. lowkey a promise, highkey a guarantee ✨
  • ordered β€” returns true if the pattern is guaranteed to return ordered results. it's giving "yes, I keep my word" energy πŸ‘‘
  • plan_node_name β€” hands you back the string name of this plan node, and it's specifically suitable for use in serialization. no cap πŸ’…
  • plan_prototype β€” returns a list of scalar identifiers describing the type of the content (children) nodes of this plan node. and if you wanna know which identifiers are even allowed, go check RDF::Query::Plan for the full list, bestie, it's all there πŸ“‹
  • plan_node_data β€” returns the data for this plan node that lines up with the values described by the signature that plan_prototype gives you. they're a matching set, fr fr πŸ¦‹

🌈 AUTHOR 🌈

written by Gregory Todd Williams <gwilliams@cpan.org> β€” shoutout to the legend, we love to see it πŸ’œ


ok and one last thing, the actual page was generated by perl v5.40.1 on 2025-08-18, so that's the receipts, that's the date, slay 🩷✨
πŸ“¦ where this page comes from