triez 1.0 → 1.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 8624d508bf82330cf354730f21341f21c7e0989b
+  data.tar.gz: cc9e500bf179457d77361acef1c399da936b0375
+SHA512:
+  metadata.gz: c73e070211b80ceb0c50fb0af6c09bc726b9ffe1a396d4faf104a74bad75d4a2484606444636c9d5c9390a0d1b28f6eca4c656aef422411e2c8c83984ff4894c
+  data.tar.gz: bdf8cc170ce95ba7370b2d163730ce42b78a2a84de823cfdcfe220f07898aa8a08385819acd01e217ce829fc44ca662845776f4de33297c69ef7a5daf4cf7b4a

data/changes

@@ -0,0 +1,4 @@
+1.0.1
+
+2013-05-30
+  fix extconf.rb for mkmf of ruby-head

data/ext/extconf.rb

@@ -1,6 +1,7 @@
 require "mkmf"
 
 $CFLAGS << ' -Ihat-trie'
+$CPPFLAGS << ' -Ihat-trie'
 $LDFLAGS << ' -Lbuild -ltries'
 create_makefile 'triez'
 

data/ext/hat-trie/ahtable.c

@@ -14,7 +14,7 @@
 
 
 const double ahtable_max_load_factor = 100000.0; /* arbitrary large number => don't resize */
-const const size_t ahtable_initial_size = 4096;
+const size_t ahtable_initial_size = 4096;
 static const uint16_t LONG_KEYLEN_MASK = 0x7fff;
 
 static size_t keylen(slot_t s) {

data/ext/triez.cc

@@ -2,6 +2,11 @@
 #include <ruby.h>
 #include <ruby/encoding.h>
 
+// for rubinius
+#ifndef rb_enc_fast_mbclen
+#   define rb_enc_fast_mbclen rb_enc_mbclen
+#endif
+
 static VALUE hat_class;
 static rb_encoding* u8_enc;
 static rb_encoding* bin_enc;

data/lib/triez.rb

@@ -1,7 +1,7 @@
 require_relative "../ext/triez"
 
 class Triez
-  VERSION = '1.0'
+  VERSION = '1.0.1'
 
   private :_internal_set_type
   private :_internal_search

data/readme.md

@@ -1,14 +1,18 @@
-## What
+## Triez
+
+[![Build Status](https://travis-ci.org/luikore/triez.png)](https://travis-ci.org/luikore/triez)
+[![Code Climate](https://codeclimate.com/github/luikore/triez.png)](https://codeclimate.com/github/luikore/triez)
+[![Gem Version](https://badge.fury.io/rb/triez.png)](http://badge.fury.io/rb/triez)
 
 Pragmatic [tries](http://en.wikipedia.org/wiki/Trie) for Ruby, spelled in lolcat.
 
 It is fast, memory efficient, unicode aware, prefix searchable, and enchanced with prefix/suffix/substring keys.
 
-The backend of *triez* is a cache oblivious data structure: the [HAT trie](https://github.com/dcjones/hat-trie) (In fact I'm using a [modified version](https://github.com/luikore/hat-trie) for improved functionality). HAT trie is generally faster and more memory efficient than [double array](http://linux.thai.net/~thep/datrie/datrie.html) or [burst trie](http://ww2.cs.mu.oz.au/~jz/fulltext/acmtois02.pdf).
+The backend of *triez* is a cache oblivious data structure: the [HAT trie](https://github.com/dcjones/hat-trie) (In fact it is a [modified version](https://github.com/luikore/hat-trie) for improved functionality). HAT trie is generally faster and more memory efficient than [double array](http://linux.thai.net/~thep/datrie/datrie.html) or [burst trie](http://ww2.cs.mu.oz.au/~jz/fulltext/acmtois02.pdf).
 
 ## Requirement
 
-- Ruby 1.9
+- CRuby 1.9 / 2.0
 - `g++` or `clang`
 
 ## Install
@@ -72,10 +76,10 @@ t.each do |key, value|
 end
 ```
 
-\* Note: By default, *triez* store signed integers within 64bits, you can use them as weights, counts or database IDs. In case you need to store arbitrary object in a node, use `obj_value: true`:
+\* Note: By default, *triez* store signed integers within 64bits, you can use them as weights, counts or database IDs. In case you need to store arbitrary object in a node, use `value_type: :object`:
 
 ``` ruby
-t = Triez.new obj_value: true
+t = Triez.new value_type: :object
 t['Tom'] = {name: 'Tom', sex: 'Female'}
 t['Tree'] = [:leaf, :trunk, :root]
 ```
@@ -91,8 +95,8 @@ t = Triez.new
 words.each do |word|
   t[word] = 1
 end
-t.search_with_prefix 're' do |word|
-  puts "candidate: #{word}"
+t.search_with_prefix 're' do |suffix|
+  puts "candidate: re#{suffix}"
 end
 ```
 
@@ -116,9 +120,9 @@ sequences = {
 }
 t = Triez.new
 
-# build suffix trie
+# build suffix tree
 sequences.each do |seq, id|
-  t.change_all :suffix, [seq] = id
+  t.change_all(:suffix, seq){id}
 end
 
 t.search_with_prefix 'CGGT' do |_, id|
@@ -126,7 +130,7 @@ t.search_with_prefix 'CGGT' do |_, id|
 end
 ```
 
-The searching time is linear to the length of the substring.
+The searching time is linear to the length of the substring. You may also be interested in the example of a simple [full text search server](https://github.com/luikore/triez/tree/master/examples/full-text-search-server) with *triez*.
 
 ---
 
@@ -185,7 +189,7 @@ fast_trie/double array* | 155.6 M |    130.7 s     | 0.4359 s
 triez/HAT trie          | 121.7 M |    3.872 s     | 0.3472 s
 ```
 
-Note: `trie/double array` -> https://github.com/tyler/trie
+Note: `fast_trie/double array` -> https://github.com/tyler/trie
 
 ## Caveats
 

metadata

@@ -1,15 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: triez
 version: !ruby/object:Gem::Version
-  version: '1.0'
-  prerelease: 
+  version: 1.0.1
 platform: ruby
 authors:
 - Zete Lui
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-02-04 00:00:00.000000000 Z
+date: 2013-05-29 00:00:00.000000000 Z
 dependencies: []
 description: fast, efficient, unicode aware HAT trie with prefix / suffix support.
 email: 
@@ -19,6 +18,7 @@ extensions:
 extra_rdoc_files: []
 files:
 - copying
+- changes
 - readme.md
 - lib/triez.rb
 - test/triez_test.rb
@@ -37,27 +37,26 @@ files:
 - ext/hat-trie/pstdint.h
 homepage: https://github.com/luikore/triez
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: 1.9.2
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.24
+rubygems_version: 2.0.3
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: fast, efficient, unicode aware HAT trie with prefix / suffix support
 test_files: []
 has_rdoc: false