snd

24 Packages by snd

  • affilinet simple interface to the affilinet api
  • amazon-associate amazon-associate is a simple interface to amazon associate reports for nodejs
  • apparat apparat is a simple but powerful way to organize async code for nodejs
  • beget to do
  • celerity celerity uses redis to do centralized rate limiting for applications running on multiple heroku dynos
  • criterion criterion allows you to work with (build, combine, reuse, ...) SQL-where-conditions ('x = 5 AND y IS NOT NULL'...) as data (goodbye string-concatenation) and compile them to SQL: it has a succinct mongodb-like query-language, a simple and elegant function
  • env-config env-config reads configuration for twelve-factor-apps from environment variables
  • hinoki magical inversion of control for nodejs and the browser
  • hinoki-trace tracing for functions returned by hinoki factories
  • kup forget underpowered template languages - build HTML with the full power of coffeescript
  • mesa simple sql for nodejs
  • mesa-find pagination, multi-column-searching and sorting for mesa tables
  • mohair mohair is a simple and flexible sql builder with a fluent interface
  • nadar ERROR: No README.md file found!
  • passage passage is simple composable routing with middleware for nodejs
  • ravine ravine is a simple router middleware for nodejs
  • react-kup react-kup is a simple, non-intrusive alternative to jsx for coffeescript
  • searchlight searchlight is a simple and fast inverted search index stored in redis
  • sequenz sequenz composes connect middleware for nodejs
  • silhouette silhouette generates html from an array representation
  • url-pattern url-pattern is easy pattern matching and segment extraction for urls, domains, filepaths and any string composed of segments joined by a separator character
  • url-whitelist url-whitelist can create whitelists by including and excluding url patterns and check urls against them
  • whois-available whois-available returns whois information and checks whether domains are available
  • zuvor simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks