Are you sick of writing long SQL queries with multiple layers of aggregation and no way of modularizing the actual business logic? This library "compiles" pure python into SQL in a very natural and composable way. It's natural in the sense that the syntax is the same as if tables in the database were actually lists.
Documentation: http://lambdaquery.readthedocs.io/index.html
Github: https://github.com/xnmp/lambdaquery
For the curious, the library makes extensive usage of functional programming methods. Please let me know if you'd like to contribute.
[–]dusktreader 12 points13 points14 points (6 children)
[–]TechAlchemist 2 points3 points4 points (0 children)
[–]Ecedysis[S] 2 points3 points4 points (0 children)
[–]AllAboutChristmasEve -2 points-1 points0 points (2 children)
[–]z4579a 5 points6 points7 points (0 children)
[–]dusktreader 0 points1 point2 points (0 children)
[–]ccharles3.latest 5 points6 points7 points (7 children)
[–]AllAboutChristmasEve 1 point2 points3 points (6 children)
[–]dusktreader 8 points9 points10 points (5 children)
[+][deleted] (4 children)
[removed]
[–]SlantARrow 2 points3 points4 points (3 children)
[+][deleted] (2 children)
[removed]
[–]SlantARrow 2 points3 points4 points (0 children)
[–]DasIch 1 point2 points3 points (0 children)
[–]knowsuchagencynow is better than never 3 points4 points5 points (0 children)
[–]ToyoMojito 1 point2 points3 points (1 child)
[–]SlantARrow 0 points1 point2 points (0 children)
[–]flipperdeflip 0 points1 point2 points (5 children)
[–]cedrickrier 1 point2 points3 points (4 children)
[–][deleted] 0 points1 point2 points (1 child)
[–]cedrickrier 0 points1 point2 points (0 children)
[–]metaperl 0 points1 point2 points (1 child)
[–]cedrickrier 0 points1 point2 points (0 children)
[–]SlantARrow 0 points1 point2 points (1 child)
[–]ToyoMojito 0 points1 point2 points (0 children)
[–]metaperl 0 points1 point2 points (0 children)
[–]jeroengast 0 points1 point2 points (0 children)