multiarray 0.5.2 → 0.6.0

data/Rakefile

@@ -6,7 +6,7 @@ require 'rake/packagetask'
 require 'rbconfig'
 
 PKG_NAME = 'multiarray'
-PKG_VERSION = '0.5.2'
+PKG_VERSION = '0.6.0'
 RB_FILES = FileList[ 'lib/**/*.rb' ]
 TC_FILES = FileList[ 'test/tc_*.rb' ]
 TS_FILES = FileList[ 'test/ts_*.rb' ]
@@ -52,6 +52,7 @@ Rake::TestTask.new do |t|
 end
 
 begin
+  # For development just run it with "yard server --reload".
   require 'yard'
   YARD::Rake::YardocTask.new :yard do |y|
     y.options << '--no-private'

data/TODO

@@ -1,46 +1,17 @@
-# use descriptors ('c','f',...)? GCCValue.identifiers is not modular
+# weighted histograms
+# lut/warp, histogram: clipping, masks?
+# lut, histogram with x and y coming from different tables?
 # pointer-increments for better efficiency, optimize Node#diagonal
-
-# histogram (implement using injection)
 # random numbers
-# Geometric Hashing? Bounded Hough Transform!!! RANSAC? histogram weights?
-# each, multi_each, collect, multi_collect, zip?
-# inject: n-d masks for warp
-# block(var1,var2,...) with smart subst?
+# Geometric Hashing? Bounded Hough Transform!!! RANSAC?
+# each, each_with_index, multi_each, collect, multi_collect, zip?
 
 # downsampling after correlation?
-# YARD documentation with pictures, demo video
+# YARD documentation with pictures, demo video, @group ..., @endgroup
 # CK_Thesis.pdf: tensor voting
-
-# f(g(i)) # g(i), f(g(i)) all can be vectors and all can be lazy
-# lut(g(i))
-# f(warp(i))
-#class Node
-#  def map( lut, options = {} )
-#    
-#  end
-#end
-
-# cache <-> demand/get? what about store?
-# allow creation of library for pre-loading cache
-
-# use inject for n-d clips for warp
-# block(var1,var2,...) with smart subst?
+# maxint -> native_int
 
 # downsampling after correlation?
-# ruby -Ilib -rrubygems -rmultiarray -rtest test/tc_sequence.rb
-# README.rdoc, demo video
-
-# f(g(i)) # g(i), f(g(i)) all can be vectors and all can be lazy
-# lut(g(i))
-# f(warp(i))
-#class Node
-#  def map( lut, options = {} ) # !!!
-#    
-#  end
-#end
-
-test type conversions
 
 a = lazy( 16, 32 ) { |i,j| Sequence[ i, j ] } # ???
 a = lazy( 8, 8 ) { |i,j| Sequence[ i, a[j] * sin( i + b[j] ) ] }.hist 8, 8

data/lib/multiarray/bool.rb

@@ -17,13 +17,14 @@
 # Namespace of Hornetseye computer vision library
 module Hornetseye
 
+  # Class for representing native booleans
   class BOOL < Element
 
     class << self
 
       # Get string with information about this class
       #
-      # @return [String] Returns +'BOOL'+
+      # @return [String] Returns 'BOOL'
       def inspect
         'BOOL'
       end
@@ -45,7 +46,7 @@ module Hornetseye
       #
       # @see Malloc#load
       #
-       # @return [BOOL] Result of fetch operation.
+      # @return [BOOL] Result of fetch operation.
       #
       # @private
       def fetch( ptr )
@@ -81,7 +82,7 @@ module Hornetseye
 
       # Directive for packing/unpacking elements of this type
       #
-      # @return [String] Returns +'c'+.
+      # @return [String] Returns 'c'.
       #
       # @private
       def directive
@@ -114,7 +115,7 @@ module Hornetseye
       # Method for matching elements of type BOOL
       #
       # @param [Array<Object>] *values Values to find matching native element
-      # type for.
+      #        type for.
       #
       # @return [Class] Native type fitting all values.
       #
@@ -135,6 +136,15 @@ module Hornetseye
 
   end
 
+  # Shortcut for constructor
+  #
+  # The method calls +BOOL.new+.
+  #
+  # @param [Boolean] value Boolean value.
+  #
+  # @return [BOOL] The wrapped boolean value.
+  #
+  # @private
   def BOOL( value )
     BOOL.new value
   end