Forum: Ruby Mongrel 0.2.1 HTTP Library (Fancy URI Matching)

Announcement (2017-05-07): is now read-only since I unfortunately do not have the time to support and maintain the forum any more. Please see and for other Rails- und Ruby-related community platforms.
Zed S. (Guest)
on 2006-02-02 09:27
(Received via mailing list)
And now it's time for yet another Mongrel release.

Mongrel is a small fast HTTP library written in (partly) Ruby.  It is
intended to be used by web app framework authors to make their
applications fast and deployable without resorting to SCGI/FastCGI
trickery.  Mongrel is tested to work on Linux and Mac OS X (with more
reports welcome).  You'll need a full compiler to install Mongrel
since it has a C extension to work the voodoo.

-  -- project page.
- -- lame RDoc as home page.

You can grab downloads on the project page's File tab, or you can do
a simple:

   gem install mongrel

To get the latest stuff via RubyGems.  As usual you can also grab the
source .tgz and build from scratch if you need.  People with mongrel
already installed can just gem update.

== Changes

This release is pretty simple:

* Fixed a few bugs people reported.
* Cleaned up some documentation that people called "juvenile".
* And then redesigned the Trie search so that it finds any handler at
any character in any URI in one search.
* Wrote more extensive tests for the URIClassifier to test out the
new Trie implementation.

This change lays the foundation for pretty much everything I need to
start adding the important components many web application frameworks
need.  First up will be the ability to serve files, directories,
cache results, and efficiently upload/receive files.

== The New URIClassifier

The URIClassifier now lets you attach HttpHandlers (well, any object
really) to any URI at pretty much any point.  For the majority of
cases people will just attach a few URIs like this:

h ="", "3000")

Which is the way things always worked anyhow.  The big change though
is that you can load up handlers at any individual character, and the
longest match wins.  So, you can even do this (in theory):


The main advantage of this is that the URIClassifier doesn't actually
parse the URI, it just uses the trie to find the longest prefix with
a handler.  I'm sure people will find bizarre uses for this.

Also, registering and unregistering is pretty fast.  The tradeoff
with this is that you'll use more memory than you would with just a

== Testing

Please test this out and shoot me e-mails with bug reports.  Better
yet, use the tracker if you
can.  I like lists.

Zed A. Shaw
Massimo Maria Ghisalberti (Guest)
on 2006-02-02 15:29
(Received via mailing list)
Please, add

#if defined(_WIN32)
	#include <stddef.h>

in http11_parser.h for fine compilation on win32 platform (vc toolkit
2003), required for size_t definition

Massimo Maria Ghisalberti
LINee multimediaagency

unknown (Guest)
on 2006-02-02 20:35
(Received via mailing list)
Done.  I'll post a 0.2.2 tonight with this and some other improvements.

BTW, could you describe to me your win32 build setup so that I can try
building it too?

Massimo Maria Ghisalberti (Guest)
on 2006-02-02 23:03
(Received via mailing list)
simply add

#if defined(_MSC_VER)
#include <stddef.h>

to your header http11_parser.h and run extconf.rb for makefile
generation or from the top folder setup.rb for building and install.

_MSC_VER for testing microsoft compiler, _WIN32 is more generic for

This topic is locked and can not be replied to.