ruletagger 0.0.1

data/COPYING

@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright (c) 2008 Todd A. Fisher
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/History.txt

@@ -0,0 +1,4 @@
+== 0.0.1 2008-05-14
+
+* 1 major enhancement:
+  * Initial release

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright (c) 2008 Todd A. Fisher
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/License.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2008 FIXME full name
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/Manifest.txt

@@ -0,0 +1,75 @@
+COPYING
+History.txt
+LICENSE
+License.txt
+Manifest.txt
+PostInstall.txt
+README
+README.txt
+Rakefile
+config/hoe.rb
+config/requirements.rb
+ext/rule_tagger/bool.h
+ext/rule_tagger/darray.c
+ext/rule_tagger/darray.h
+ext/rule_tagger/darrayP.h
+ext/rule_tagger/extconf.rb
+ext/rule_tagger/lex.c
+ext/rule_tagger/lex.h
+ext/rule_tagger/memory.c
+ext/rule_tagger/memory.h
+ext/rule_tagger/rbtagger.c
+ext/rule_tagger/registry.c
+ext/rule_tagger/registry.h
+ext/rule_tagger/registryP.h
+ext/rule_tagger/ruby-compat.h
+ext/rule_tagger/rules.c
+ext/rule_tagger/rules.h
+ext/rule_tagger/sysdep.h
+ext/rule_tagger/tagger.c
+ext/rule_tagger/tagger.h
+ext/rule_tagger/useful.c
+ext/rule_tagger/useful.h
+ext/word_tagger/extconf.rb
+ext/word_tagger/porter_stemmer.c
+ext/word_tagger/porter_stemmer.h
+ext/word_tagger/rtagger.cc
+ext/word_tagger/tagger.cc
+ext/word_tagger/tagger.h
+ext/word_tagger/tagger.rb
+ext/word_tagger/test.rb
+ext/word_tagger/test/Makefile
+ext/word_tagger/test/doc.txt
+ext/word_tagger/test/test.cc
+lib/brill/tagger.rb
+lib/rbtagger.rb
+lib/rbtagger/version.rb
+script/console
+script/destroy
+script/generate
+script/txt2html
+setup.rb
+tasks/deployment.rake
+tasks/environment.rake
+tasks/website.rake
+test/CONTEXTUALRULEFILE
+test/LEXICALRULEFILE
+test/LEXICON
+test/docs/doc0.txt
+test/docs/doc1.txt
+test/docs/doc2.txt
+test/docs/doc3.txt
+test/docs/doc4.txt
+test/docs/doc5.txt
+test/docs/doc6.txt
+test/docs/doc7.txt
+test/docs/doc8.txt
+test/docs/doc9.txt
+test/tagger_test.rb
+test/test_helper.rb
+tools/rakehelp.rb
+website/index.html
+website/index.txt
+website/javascripts/rounded_corners_lite.inc.js
+website/stylesheets/screen.css
+website/template.html.erb

data/PostInstall.txt

@@ -0,0 +1,7 @@
+
+For more information on rb-brill-tagger, see http://rb-brill-tagger.rubyforge.org
+
+NOTE: Change this information in PostInstall.txt 
+You can also delete it if you don't want it.
+
+

data/README

@@ -0,0 +1,7 @@
+A Simple Ruby Rule-Based Part of Speech Tagger
+
+This work is based on the work of Eric Brill
+
+Credit for extracting Eric's work into a reusable library goes to Ken Williams as part of his work in creating the Lingua::BrillTagger perl module
+
+This software is made available under the MIT License, see LICENSE

data/README.txt

@@ -0,0 +1,53 @@
+= rbtagger
+
+* http://github.com/taf2/rb-brill-tagger/tree/master
+
+== DESCRIPTION:
+
+A Simple Ruby Rule-Based Part of Speech Tagger
+
+This work is based on the work of Eric Brill
+
+Credit for extracting Eric's work into a reusable library goes to Ken Williams as part of his work in creating the Lingua::BrillTagger perl module
+
+This software is made available under the MIT License, see LICENSE
+
+== FEATURES/PROBLEMS:
+
+* Rule based tagger
+* Word matching tagger
+
+== SYNOPSIS:
+
+ tagger = Brill::Tagger.new( File.join(File.dirname(__FILE__),"LEXICON"),
+                             File.join(File.dirname(__FILE__),"LEXICALRULEFILE"),
+                             File.join(File.dirname(__FILE__),"CONTEXTUALRULEFILE") )
+
+== INSTALL:
+
+* sudo gem install rbtagger
+
+== LICENSE:
+
+(The MIT License)
+
+Copyright (c) 2008 Todd A. Fisher
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/Rakefile

@@ -0,0 +1,33 @@
+require 'config/requirements'
+require 'config/hoe' # setup Hoe + all gem configuration
+
+Dir['tasks/**/*.rake'].each { |rake| load rake }
+
+# redefine release
+
+desc 'Package and upload the release to rubyforge.'
+task :release_current => [:clean, :package] do |t|
+  require 'config/hoe'
+  version = ENV["VERSION"] or abort "Must supply VERSION=x.y.z"
+  name = $hoe.name
+  rubyforge_name = $hoe.rubyforge_name
+  description = $hoe.description
+  pkg = "pkg/#{name}-#{version}"
+  abort "Package doesn't exist => #{pkg}" if !File.exist?(pkg)
+
+  rf = RubyForge.new
+  puts "Logging in"
+  rf.login
+
+  c = rf.userconfig
+  c["release_notes"] = description if description
+  c["release_changes"] = $hoe.changes if $hoe.changes
+  c["preformatted"] = true
+
+  files = [(@need_tar ? "#{pkg}.tgz" : nil),
+           (@need_zip ? "#{pkg}.zip" : nil),
+           "#{pkg}.gem"].compact
+
+  puts "Releasing #{rubyforge_name} v. #{version}"
+  rf.add_release 'ruletagger', 'ruletagger', version, *files
+end

data/config/hoe.rb

@@ -0,0 +1,75 @@
+require 'rbtagger/version'
+
+AUTHOR = 'Todd A. Fisher'  # can also be an array of Authors
+EMAIL = 'todd.fisher@gmail.com'
+DESCRIPTION = "A Simple Ruby Rule-Based Part of Speech Tagger"
+GEM_NAME = 'rbtagger' # what ppl will type to install your gem
+RUBYFORGE_PROJECT = 'ruletagger' # The unix name for your project
+HOMEPATH = "http://#{RUBYFORGE_PROJECT}.rubyforge.org"
+DOWNLOAD_PATH = "http://rubyforge.org/projects/#{RUBYFORGE_PROJECT}"
+EXTRA_DEPENDENCIES = [
+#  ['activesupport', '>= 1.3.1']
+]    # An array of rubygem dependencies [name, version]
+
+@config_file = "~/.rubyforge/user-config.yml"
+@config = nil
+RUBYFORGE_USERNAME = "unknown"
+def rubyforge_username
+  unless @config
+    begin
+      @config = YAML.load(File.read(File.expand_path(@config_file)))
+    rescue
+      puts <<-EOS
+ERROR: No rubyforge config file found: #{@config_file}
+Run 'rubyforge setup' to prepare your env for access to Rubyforge
+ - See http://newgem.rubyforge.org/rubyforge.html for more details
+      EOS
+      exit
+    end
+  end
+  RUBYFORGE_USERNAME.replace @config["username"]
+end
+
+
+REV = nil
+# UNCOMMENT IF REQUIRED:
+# REV = YAML.load(`svn info`)['Revision']
+VERS = RbTagger::VERSION::STRING + (REV ? ".#{REV}" : "")
+RDOC_OPTS = ['--quiet', '--title', 'ruletagger documentation',
+    "--opname", "index.html",
+    "--line-numbers",
+    "--main", "README",
+    "--inline-source"]
+
+class Hoe
+  def extra_deps
+    @extra_deps.reject! { |x| Array(x).first == 'hoe' }
+    @extra_deps
+  end
+end
+
+PATH    = (RUBYFORGE_PROJECT == GEM_NAME) ? RUBYFORGE_PROJECT : "#{RUBYFORGE_PROJECT}/#{GEM_NAME}"
+
+# Generate all the Rake tasks
+# Run 'rake -T' to see list of generated tasks (from gem root directory)
+$hoe = Hoe.new(GEM_NAME, VERS) do |p|
+  p.developer(AUTHOR, EMAIL)
+  p.description = DESCRIPTION
+  p.summary = DESCRIPTION
+  p.url = HOMEPATH
+  p.name = RUBYFORGE_PROJECT 
+  p.rubyforge_name = RUBYFORGE_PROJECT if RUBYFORGE_PROJECT
+  p.test_globs = ["test/**/test_*.rb"]
+  p.clean_globs |= ['**/.*.sw?', '*.gem', '.config', '**/.DS_Store']  #An array of file patterns to delete on clean.
+
+  # == Optional
+  p.changes = p.paragraphs_of("History.txt", 0..1).join("\n\n")
+  #p.extra_deps = EXTRA_DEPENDENCIES
+
+  #p.spec_extras = {}    # A hash of extra values to set in the gemspec.
+end
+
+CHANGES = $hoe.paragraphs_of('History.txt', 0..1).join("\\n\\n")
+$hoe.remote_rdoc_dir = File.join(PATH.gsub(/^#{RUBYFORGE_PROJECT}\/?/,''), 'rdoc')
+$hoe.rsync_args = '-av --delete --ignore-errors'
+$hoe.spec.post_install_message = File.open(File.dirname(__FILE__) + "/../PostInstall.txt").read rescue ""

data/config/requirements.rb

@@ -0,0 +1,15 @@
+require 'fileutils'
+include FileUtils
+
+require 'rubygems'
+%w[rake hoe newgem rubigen].each do |req_gem|
+  begin
+    require req_gem
+  rescue LoadError
+    puts "This Rakefile requires the '#{req_gem}' RubyGem."
+    puts "Installation: gem install #{req_gem} -y"
+    exit
+  end
+end
+
+$:.unshift(File.join(File.dirname(__FILE__), %w[.. lib]))

data/ext/rule_tagger/bool.h

@@ -0,0 +1,38 @@
+#ifndef _BOOL_H_
+#define _BOOL_H_
+
+/* Note: It is an abstraction violation to use the C "boolean"
+ * operators (&&, ||, etc.) on Bool objects.  Those operators
+ * really operate on type "int".
+ *
+ * Note: Bool_and() and Bool_or() do not short circuit.
+ * Bool_cand() and Bool_cor() do.  
+ */ 
+
+/* The identifier en_Bool and the values are private */
+
+#ifdef Bool
+#undef Bool
+#endif
+
+#ifdef __STDC__
+typedef enum Bool_en {Bool_FALSE=0, Bool_TRUE=1} Bool;
+#else
+typedef int Bool;
+#define Bool_FALSE 0
+#define Bool_TRUE  1
+#endif
+
+/* The macro expansions are private */
+
+#define Bool_to_int(a) ((int)a)
+#define Bool_to_char(a) ((char)a)
+#define Bool_create(integral_value) (((integral_value) != 0)?(Bool_TRUE):(Bool_FALSE))
+/* Some type conversions are omitted for efficiency (with stupid compilers) */
+#define Bool_or(a,b) ((a)|(b))
+#define Bool_and(a,b) ((a)&(b))
+#define Bool_cor(a,b) ((a)||(b))
+#define Bool_cand(a,b) ((a)&&(b))
+#define Bool_not(a) ((a)^(Bool_TRUE))
+
+#endif

data/ext/rule_tagger/darray.c

@@ -0,0 +1,292 @@
+#include <stddef.h>
+/*#include <stdlib.h>*/
+#include <stdio.h>
+#include <assert.h>
+
+#include "sysdep.h"
+#include "memory.h"
+#include "bool.h"
+
+#include "useful.h"
+#include "darrayP.h"
+
+/* Grow in the specified direction by the specified amount (number of 
+ * new array slots).  It amount is zero, grow by some default amount.
+ */
+static NORET grow(array_rep, direction, amount)
+     Darray_rep *array_rep;
+     enum grow_direction direction;
+     unsigned amount;
+{
+  int grow_amount;
+  int new_length;
+  VOIDP *temp_new_space;
+  VOIDP *p, *q;
+ 
+  assert(direction == GROW_HIGH || direction == GROW_LOW);
+
+  if (amount == 0) 
+    grow_amount = (MAX_GROW_STEP < array_rep->storage_length) ? 
+      MAX_GROW_STEP : array_rep->storage_length;
+  else
+    grow_amount = amount;
+  
+  new_length = array_rep->storage_length + grow_amount;
+
+  /* sort of like realloc, but not really */
+  if (direction == GROW_HIGH) {
+    /* Maybe this should not use realloc, since there may be unused 
+       slots at the low end of the darray (before storage_offset), and it
+       is a waste to copy them */
+    array_rep->storage = (VOIDP *)Memory_reallocate(array_rep->storage,
+					       sizeof(VOIDP) * new_length);
+    array_rep->storage_length = new_length;
+  } else {			/* direction == GROW_LOW */
+    temp_new_space = (VOIDP *)Memory_allocate(sizeof(VOIDP) * new_length);
+    for (p=temp_new_space+grow_amount+array_rep->storage_offset, 
+	   q=array_rep->storage+array_rep->storage_offset; 
+	 q < array_rep->storage+array_rep->storage_offset+array_rep->length; 
+	 ++p, ++q) {
+      *p = *q;
+    }
+    Memory_free(array_rep->storage);
+    array_rep->storage = temp_new_space;
+    array_rep->storage_length = new_length;
+    array_rep->storage_offset += grow_amount;
+  }
+}
+
+Darray Darray_create(NOARGS)
+{
+  Darray_rep *temp = dcreate();
+
+  temp->length = 0;
+  temp->storage = (VOIDP *)Memory_allocate(sizeof(VOIDP));
+  temp->storage_length = 1;
+  temp->storage_offset = 0;
+  return draise(temp);
+}
+
+NORET Darray_destroy(dyn_ary)
+     Darray dyn_ary;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  Memory_free((VOIDP)temp->storage);
+  Memory_free((VOIDP)temp);
+}
+
+NORET Darray_hint(dyn_ary, addl_hint, addh_hint)
+     Darray dyn_ary;
+     unsigned addl_hint, addh_hint;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+  int grow_amount;
+
+  grow_amount = addh_hint - (temp->storage_length - temp->storage_offset 
+			     - temp->length);
+  if (grow_amount > 0) 
+    grow(temp, GROW_HIGH, (unsigned)grow_amount);
+
+  grow_amount = addl_hint - temp->storage_offset;
+  if (grow_amount > 0)
+    grow(temp, GROW_LOW, (unsigned)grow_amount);
+
+}
+
+NORET Darray_addh(dyn_ary, object)
+     Darray_rep *dyn_ary;
+     VOIDP object;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+  int add_posn = temp->storage_offset + temp->length;
+
+  if (add_posn >= temp->storage_length)
+    grow(temp, GROW_HIGH, (unsigned)0);
+
+  *(temp->storage + add_posn) = object;
+  ++temp->length;
+}
+
+NORET Darray_addl(dyn_ary, obj)
+     Darray dyn_ary;
+     VOIDP obj;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  if (temp->storage_offset == 0)
+    grow(temp, GROW_LOW, (unsigned)0);	/* Modifies storage_offset */
+
+  assert(temp->storage_offset > 0);
+
+  /* Note side-effect */
+  *(temp->storage + --temp->storage_offset) = obj;
+  ++temp->length;
+}
+
+VOIDP Darray_remh(dyn_ary)
+     Darray dyn_ary;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  assert(temp->length > 0);
+
+  return *(temp->storage + temp->storage_offset + --temp->length);
+}
+
+VOIDP Darray_reml(dyn_ary)
+     Darray dyn_ary;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+  VOIDP return_value;
+
+  assert(temp->length > 0);
+
+  return_value =  *(temp->storage + temp->storage_offset++);
+  --temp->length;
+  return return_value;
+}
+
+unsigned Darray_len(dyn_ary)
+     Darray dyn_ary;
+{
+  assert(dyn_ary != (Darray)NULL);
+
+  return dlower(dyn_ary)->length;
+}
+
+Bool Darray_valid_index(dyn_ary, index)
+     Darray dyn_ary;
+     unsigned index;
+{
+  return Bool_create(index < Darray_len(dyn_ary));
+}
+
+NORET Darray_set(dyn_ary, index, obj)
+     Darray dyn_ary;
+     unsigned index;
+     VOIDP obj;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  assert(Darray_valid_index(dyn_ary, index)==Bool_TRUE);
+ 
+  *(temp->storage + temp->storage_offset + index) = obj;
+}
+
+VOIDP Darray_get(dyn_ary, index)
+     Darray dyn_ary;
+     unsigned index;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  assert(Darray_valid_index(dyn_ary, index)==Bool_TRUE);
+ 
+  /* You should suppress the saber warning on the following line */
+  return *(temp->storage + temp->storage_offset + index);
+}
+
+NORET Darray_values(dyn_ary, c_ary)
+     Darray dyn_ary;
+     VOIDP *c_ary;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+  VOIDP *p, *q;
+
+  for (p=c_ary, q=temp->storage+temp->storage_offset; 
+       q < temp->storage+temp->storage_offset+temp->length; 
+       ++p, ++q) {
+    *p = *q;
+  }
+}
+
+Darray Darray_copy(dyn_ary)
+     Darray dyn_ary;
+{
+  Darray temp = Darray_create();
+  unsigned int temp_len = Darray_len(dyn_ary);
+  unsigned int i;
+
+  Darray_hint(temp, (unsigned int)0, temp_len);
+  for (i = 0; i < temp_len; ++i)
+    Darray_addh(temp, Darray_get(dyn_ary, i));
+  return temp;
+}
+
+
+/*--------------------------------------------------*/
+/* code added by Rich Pito */
+/*--------------------------------------------------*/
+
+/* Both of thes function has to be rewrutten to use the internal darray data */
+/* structure.  This is this way for ease of writing */
+
+Darray Darray_remove(dar, index)
+     Darray dar;
+     int index;
+{
+  int s, d, l;
+  l = Darray_len(dar);
+  if (index == (l - 1)) {
+    Darray_remh(dar);
+    return dar;
+  }
+  if (index == 0) {
+    Darray_reml(dar);
+    return dar;
+  }
+  s = index + 1; d = index;
+  while (s < l) {
+    Darray_set(dar, d, (VOIDP)Darray_get(dar, s));
+    s++; d++;
+  }
+  Darray_remh(dar);
+  return dar;
+}
+
+/*--------------------------------------------------*/
+Darray Darray_insert(dar, index, data)
+     Darray dar;
+     int index;
+     VOIDP data;
+{
+  int l = Darray_len(dar);
+  int source;
+  if (index <= 0)
+    Darray_addl(dar, data);
+  else if (index >= l)
+    Darray_addh(dar, data);
+  else {
+    Darray_addh(dar, NULL);
+    for (source = l - 1; source >= index; source--) 
+      Darray_set(dar, source + 1, Darray_get(dar, source));
+    Darray_set(dar, index, data);
+  }  
+  return dar;
+}
+
+
+/*--------------------------------------------------*/
+Darray Darray_duplicate(a)
+     Darray a;
+{
+  int i, l;
+  Darray ret;
+
+  l = Darray_len(a);
+  ret = Darray_create();
+  Darray_hint(ret, 0, l);
+  for (i = 0; i < l; i++) {
+    Darray_addh(ret, (char*)Darray_get(a, i));
+  }
+  return ret;
+}
+
+void Darray_clear(dyn_ary)
+     Darray dyn_ary;
+{
+  Darray_rep *temp = dlower(dyn_ary);
+
+  temp->storage_offset = 0;
+  temp->length = 0;
+}