Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^3: search data structures using SQL ( FP, int DSL)

by LanX (Saint)
on Nov 16, 2013 at 15:50 UTC ( [id://1062906]=note: print w/replies, xml ) Need Help??


in reply to Re^2: search data structures using SQL (upd: FP, LINQ, int vs ext DSL)
in thread search data structures using SQL

Still don't know if you want an external or internal DSL.

External means you need an interpreter (parser + compiler) for a string holding SQL.

Internal means chaining/cascading Perl functions/methods with "SQL-like" names and semantics in combination with Perl builtins like shown before.

I prefer the latter.

> I mean SELECTs of not more than moderate complexity.

Please gimme some explicit examples of those SQLs of "moderate complexity" and I'll be pleased to show an internal DSL approach built on FP.

Cheers Rolf

( addicted to the Perl Programming Language)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1062906]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (6)
As of 2024-03-28 12:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found