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

πŸ’– NAME πŸ’–

RDF::Query::Plan::ComputedStatement β€” it's the executable query plan for computed triples, bestie. That's the whole vibe. ✨

So real quick, the manual page you're reading lives in the User Contributed Perl Documentation corner of the world (iykyk), and the module itself is RDF::Query::Plan::ComputedStatement. Periodt.


🌸 VERSION 🌸

This doc is describing RDF::Query::Plan::ComputedStatement version 2.919. No cap, that's the number. πŸŽ€


πŸ¦‹ METHODS πŸ¦‹

Okay so first things first, queen: on top of everything listed down here, this class also inherits methods from the RDF::Query::Plan class. So if you're looking for something and it's not here, go check the parent. It's giving "family plan". πŸ‘‘

  • new ( @triple ) β€” yep, the constructor. That's the whole entry right there. 🫢
  • execute ( $execution_context ) β€” go run it, with your execution context. πŸ’…
  • next β€” the next one. Simple as that. ✨
  • close β€” shut it down, babes. 🌈
  • nodes β€” returns a list of the three node objects that make up the triple pattern this plan is gonna return. Three. Tri. A triple. Iconic. πŸ”₯
  • triple β€” hands you an RDF::Trine::Statement object that represents the triple pattern this plan will return. It's the whole triple, wrapped up cute. 🎁
  • bf () β€” returns a string showing the state of the nodes of the triple: bound or free. That's it, that's the tea. πŸ“
  • distinct β€” returns true if the pattern is guaranteed to return distinct results. Guaranteed, bestie. Locked in. πŸ”’
  • ordered β€” returns true if the pattern is guaranteed to return ordered results. Also locked in. πŸ“
  • plan_node_name β€” returns the string name of this plan node, and it's built for use in serialization. Name tag energy. 🏷️
  • plan_prototype β€” returns a list of scalar identifiers describing the type of the content (children) nodes of this plan node. If you wanna know the allowable identifiers, they're listed over in RDF::Query::Plan. Go peek. πŸ‘€
  • plan_node_data β€” returns the data for this plan node, matching up with the values described by the signature that plan_prototype gives you. They're a matched set, fr fr. πŸ’ž
  • graph ( $g ) β€” takes $g. That's the entry. πŸ’œ

πŸ‘‘ AUTHOR πŸ‘‘

Gregory Todd Williams <gwilliams@cpan.org> β€” the legend who wrote this. Respect. 🫑


And that's the whole page, mwah. πŸ’‹ This was perl v5.40.1, dated 2025-08-18. Slay, go write some computed triples bestie, you got this. πŸ§šβ€β™€οΈβœ¨

πŸ“¦ where this page comes from