### Dirk-Jan Binnema

Shared publicly -When I was doing some of the Problem Euler problems, I noticed how elegantly you can solve them in e.g. Rust or Scheme, using their higher-order list functions. That got me thinking - would be useful to have some of that when using GLib's good-old GList...

Ta-da: http://www.djcbsoftware.nl/code/gxlib/ (docs) and https://github.com/djcb/gxlib (code)

For example, a common problem in daily life: let's get the sum of primes in the range 1..100:

Ta-da: http://www.djcbsoftware.nl/code/gxlib/ (docs) and https://github.com/djcb/gxlib (code)

For example, a common problem in daily life: let's get the sum of primes in the range 1..100:

5

6 comments

Thanks eagle-eyed Stefan -- fixed.

Add a comment...