fdb 5.1.5

data/lib/fdblocality.rb

@@ -0,0 +1,83 @@
+#encoding: BINARY
+
+#
+# fdblocality.rb
+#
+# This source file is part of the FoundationDB open source project
+#
+# Copyright 2013-2018 Apple Inc. and the FoundationDB project authors
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+# FoundationDB Ruby API
+
+# Documentation for this API can be found at
+# https://www.foundationdb.org/documentation/api-ruby.html
+
+module FDB
+  module Locality
+    def self.get_addresses_for_key(db_or_tr, key)
+      key = FDB.key_to_bytes(key)
+      db_or_tr.transact do |tr|
+        FutureStringArray.new(FDBC.fdb_transaction_get_addresses_for_key(tr.tpointer, key, key.bytesize))
+      end
+    end
+
+    def self.get_boundary_keys(db_or_tr, bkey, ekey)
+      bkey = FDB.key_to_bytes(bkey).dup.force_encoding('BINARY')
+      ekey = FDB.key_to_bytes(ekey).dup.force_encoding('BINARY')
+
+      if db_or_tr.is_a? Transaction
+        tr = db_or_tr.db.create_transaction
+        tr.set_read_version db_or_tr.get_read_version
+      else
+        tr = db_or_tr.create_transaction
+      end
+
+      tr.options.set_read_system_keys
+      tr.options.set_lock_aware
+      lastbkey = bkey
+      kvs = tr.snapshot.get_range("\xff/keyServers/"+bkey, "\xff/keyServers/"+ekey)
+
+      y = Enumerator.new do |yielder|
+        _tr = tr
+        _bkey = bkey
+        _ekey = ekey
+        _lastbkey = lastbkey
+        _kvs = kvs
+        while _bkey < _ekey
+          begin
+            _kvs.each do |kv|
+              yielder.yield kv.key.byteslice(13..-1)
+              _bkey = kv.key.byteslice(13..-1) + "\x00"
+            end
+            _bkey = _ekey
+          rescue FDB::Error => e
+            if e.code == 1007 and _bkey != _lastbkey # if we get a past_version and *something* has happened, then we are no longer transactional
+              _tr = _tr.db.create_transaction
+            else
+              _tr.on_error(e).wait
+            end
+            # we either created a new transaction or (implicitly) reset the one we had...
+            _tr.options.set_read_system_keys
+            _lastbkey = _bkey
+            _kvs = _tr.snapshot.get_range("\xff/keyServers/" + _bkey, "\xff/keyServers/" + _ekey)
+          end
+        end
+      end
+
+      return y
+    end
+  end
+end

data/lib/fdboptions.rb

@@ -0,0 +1,129 @@
+# FoundationDB Ruby API
+# Copyright (c) 2013-2017 Apple Inc.
+
+# 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.
+
+# Documentation for this API can be found at
+# https://www.foundationdb.org/documentation/api-ruby.html
+
+module FDB
+  @@NetworkOption = {
+    "LOCAL_ADDRESS" => [10, "Deprecated", '', "IP:PORT"],
+    "CLUSTER_FILE" => [20, "Deprecated", '', "path to cluster file"],
+    "TRACE_ENABLE" => [30, "Enables trace output to a file in a directory of the clients choosing", '', "path to output directory (or NULL for current working directory)"],
+    "TRACE_ROLL_SIZE" => [31, "Sets the maximum size in bytes of a single trace output file. This value should be in the range ``[0, INT64_MAX]``. If the value is set to 0, there is no limit on individual file size. The default is a maximum size of 10,485,760 bytes.", 0, "max size of a single trace output file"],
+    "TRACE_MAX_LOGS_SIZE" => [32, "Sets the maximum size of all the trace output files put together. This value should be in the range ``[0, INT64_MAX]``. If the value is set to 0, there is no limit on the total size of the files. The default is a maximum size of 104,857,600 bytes. If the default roll size is used, this means that a maximum of 10 trace files will be written at a time.", 0, "max total size of trace files"],
+    "TRACE_LOG_GROUP" => [33, "Sets the 'logGroup' attribute with the specified value for all events in the trace output files. The default log group is 'default'.", '', "value of the logGroup attribute"],
+    "KNOB" => [40, "Set internal tuning or debugging knobs", '', "knob_name=knob_value"],
+    "TLS_PLUGIN" => [41, "Set the TLS plugin to load. This option, if used, must be set before any other TLS options", '', "file path or linker-resolved name"],
+    "TLS_CERT_BYTES" => [42, "Set the certificate chain", '', "certificates"],
+    "TLS_CERT_PATH" => [43, "Set the file from which to load the certificate chain", '', "file path"],
+    "TLS_KEY_BYTES" => [45, "Set the private key corresponding to your own certificate", '', "key"],
+    "TLS_KEY_PATH" => [46, "Set the file from which to load the private key corresponding to your own certificate", '', "file path"],
+    "TLS_VERIFY_PEERS" => [47, "Set the peer certificate field verification criteria", '', "verification pattern"],
+    "BUGGIFY_ENABLE" => [48, "", nil, nil],
+    "BUGGIFY_DISABLE" => [49, "", nil, nil],
+    "BUGGIFY_SECTION_ACTIVATED_PROBABILITY" => [50, "Set the probability of a BUGGIFY section being active for the current execution.  Only applies to code paths first traversed AFTER this option is changed.", 0, "probability expressed as a percentage between 0 and 100"],
+    "BUGGIFY_SECTION_FIRED_PROBABILITY" => [51, "Set the probability of an active BUGGIFY section being fired", 0, "probability expressed as a percentage between 0 and 100"],
+    "DISABLE_MULTI_VERSION_CLIENT_API" => [60, "Disables the multi-version client API and instead uses the local client directly. Must be set before setting up the network.", nil, nil],
+    "CALLBACKS_ON_EXTERNAL_THREADS" => [61, "If set, callbacks from external client libraries can be called from threads created by the FoundationDB client library. Otherwise, callbacks will be called from either the thread used to add the callback or the network thread. Setting this option can improve performance when connected using an external client, but may not be safe to use in all environments. Must be set before setting up the network. WARNING: This feature is considered experimental at this time. ", nil, nil],
+    "EXTERNAL_CLIENT_LIBRARY" => [62, "Adds an external client library for use by the multi-version client API. Must be set before setting up the network.", '', "path to client library"],
+    "EXTERNAL_CLIENT_DIRECTORY" => [63, "Searches the specified path for dynamic libraries and adds them to the list of client libraries for use by the multi-version client API. Must be set before setting up the network.", '', "path to directory containing client libraries"],
+    "DISABLE_LOCAL_CLIENT" => [64, "Prevents connections through the local client, allowing only connections through externally loaded client libraries. Intended primarily for testing.", nil, nil],
+    "DISABLE_CLIENT_STATISTICS_LOGGING" => [70, "Disables logging of client statistics, such as sampled transaction activity.", nil, nil],
+    "ENABLE_SLOW_TASK_PROFILING" => [71, "Enables debugging feature to perform slow task profiling. Requires trace logging to be enabled. WARNING: this feature is not recommended for use in production.", nil, nil],
+  }
+
+  @@ClusterOption = {
+
+  }
+
+  @@DatabaseOption = {
+    "LOCATION_CACHE_SIZE" => [10, "Set the size of the client location cache. Raising this value can boost performance in very large databases where clients access data in a near-random pattern. Defaults to 100000.", 0, "Max location cache entries"],
+    "MAX_WATCHES" => [20, "Set the maximum number of watches allowed to be outstanding on a database connection. Increasing this number could result in increased resource usage. Reducing this number will not cancel any outstanding watches. Defaults to 10000 and cannot be larger than 1000000.", 0, "Max outstanding watches"],
+    "MACHINE_ID" => [21, "Specify the machine ID that was passed to fdbserver processes running on the same machine as this client, for better location-aware load balancing.", '', "Hexadecimal ID"],
+    "DATACENTER_ID" => [22, "Specify the datacenter ID that was passed to fdbserver processes running in the same datacenter as this client, for better location-aware load balancing.", '', "Hexadecimal ID"],
+  }
+
+  @@TransactionOption = {
+    "CAUSAL_WRITE_RISKY" => [10, "The transaction, if not self-conflicting, may be committed a second time after commit succeeds, in the event of a fault", nil, nil],
+    "CAUSAL_READ_RISKY" => [20, "The read version will be committed, and usually will be the latest committed, but might not be the latest committed in the event of a fault or partition", nil, nil],
+    "CAUSAL_READ_DISABLE" => [21, "", nil, nil],
+    "NEXT_WRITE_NO_WRITE_CONFLICT_RANGE" => [30, "The next write performed on this transaction will not generate a write conflict range. As a result, other transactions which read the key(s) being modified by the next write will not conflict with this transaction. Care needs to be taken when using this option on a transaction that is shared between multiple threads. When setting this option, write conflict ranges will be disabled on the next write operation, regardless of what thread it is on.", nil, nil],
+    "COMMIT_ON_FIRST_PROXY" => [40, "Committing this transaction will bypass the normal load balancing across proxies and go directly to the specifically nominated 'first proxy'.", nil, nil],
+    "CHECK_WRITES_ENABLE" => [50, "", nil, nil],
+    "READ_YOUR_WRITES_DISABLE" => [51, "Reads performed by a transaction will not see any prior mutations that occured in that transaction, instead seeing the value which was in the database at the transaction's read version. This option may provide a small performance benefit for the client, but also disables a number of client-side optimizations which are beneficial for transactions which tend to read and write the same keys within a single transaction.", nil, nil],
+    "READ_AHEAD_DISABLE" => [52, "Disables read-ahead caching for range reads. Under normal operation, a transaction will read extra rows from the database into cache if range reads are used to page through a series of data one row at a time (i.e. if a range read with a one row limit is followed by another one row range read starting immediately after the result of the first).", nil, nil],
+    "DURABILITY_DATACENTER" => [110, "", nil, nil],
+    "DURABILITY_RISKY" => [120, "", nil, nil],
+    "DURABILITY_DEV_NULL_IS_WEB_SCALE" => [130, "", nil, nil],
+    "PRIORITY_SYSTEM_IMMEDIATE" => [200, "Specifies that this transaction should be treated as highest priority and that lower priority transactions should block behind this one. Use is discouraged outside of low-level tools", nil, nil],
+    "PRIORITY_BATCH" => [201, "Specifies that this transaction should be treated as low priority and that default priority transactions should be processed first. Useful for doing batch work simultaneously with latency-sensitive work", nil, nil],
+    "INITIALIZE_NEW_DATABASE" => [300, "This is a write-only transaction which sets the initial configuration. This option is designed for use by database system tools only.", nil, nil],
+    "ACCESS_SYSTEM_KEYS" => [301, "Allows this transaction to read and modify system keys (those that start with the byte 0xFF)", nil, nil],
+    "READ_SYSTEM_KEYS" => [302, "Allows this transaction to read system keys (those that start with the byte 0xFF)", nil, nil],
+    "DEBUG_DUMP" => [400, "", nil, nil],
+    "DEBUG_RETRY_LOGGING" => [401, "", '', "Optional transaction name"],
+    "TRANSACTION_LOGGING_ENABLE" => [402, "Enables tracing for this transaction and logs results to the client trace logs. Client trace logging must be enabled to get log output.", '', "String identifier to be used in the logs when tracing this transaction. The identifier must not exceed 100 characters."],
+    "TIMEOUT" => [500, "Set a timeout in milliseconds which, when elapsed, will cause the transaction automatically to be cancelled. Valid parameter values are ``[0, INT_MAX]``. If set to 0, will disable all timeouts. All pending and any future uses of the transaction will throw an exception. The transaction can be used again after it is reset. Like all transaction options, a timeout must be reset after a call to onError. This behavior allows the user to make the timeout dynamic.", 0, "value in milliseconds of timeout"],
+    "RETRY_LIMIT" => [501, "Set a maximum number of retries after which additional calls to onError will throw the most recently seen error code. Valid parameter values are ``[-1, INT_MAX]``. If set to -1, will disable the retry limit. Like all transaction options, the retry limit must be reset after a call to onError. This behavior allows the user to make the retry limit dynamic.", 0, "number of times to retry"],
+    "MAX_RETRY_DELAY" => [502, "Set the maximum amount of backoff delay incurred in the call to onError if the error is retryable. Defaults to 1000 ms. Valid parameter values are ``[0, INT_MAX]``. Like all transaction options, the maximum retry delay must be reset after a call to onError. If the maximum retry delay is less than the current retry delay of the transaction, then the current retry delay will be clamped to the maximum retry delay.", 0, "value in milliseconds of maximum delay"],
+    "SNAPSHOT_RYW_ENABLE" => [600, "Snapshot read operations will see the results of writes done in the same transaction.", nil, nil],
+    "SNAPSHOT_RYW_DISABLE" => [601, "Snapshot read operations will not see the results of writes done in the same transaction.", nil, nil],
+    "LOCK_AWARE" => [700, "The transaction can read and write to locked databases, and is resposible for checking that it took the lock.", nil, nil],
+    "USED_DURING_COMMIT_PROTECTION_DISABLE" => [701, "By default, operations that are performed on a transaction while it is being committed will not only fail themselves, but they will attempt to fail other in-flight operations (such as the commit) as well. This behavior is intended to help developers discover situations where operations could be unintentionally executed after the transaction has been reset. Setting this option removes that protection, causing only the offending operation to fail.", nil, nil],
+    "READ_LOCK_AWARE" => [702, "The transaction can read from locked databases.", nil, nil],
+  }
+
+  @@StreamingMode = {
+    "WANT_ALL" => [-2, "Client intends to consume the entire range and would like it all transferred as early as possible.", nil, nil],
+    "ITERATOR" => [-1, "The default. The client doesn't know how much of the range it is likely to used and wants different performance concerns to be balanced. Only a small portion of data is transferred to the client initially (in order to minimize costs if the client doesn't read the entire range), and as the caller iterates over more items in the range larger batches will be transferred in order to minimize latency.", nil, nil],
+    "EXACT" => [0, "Infrequently used. The client has passed a specific row limit and wants that many rows delivered in a single batch. Because of iterator operation in client drivers make request batches transparent to the user, consider ``WANT_ALL`` StreamingMode instead. A row limit must be specified if this mode is used.", nil, nil],
+    "SMALL" => [1, "Infrequently used. Transfer data in batches small enough to not be much more expensive than reading individual rows, to minimize cost if iteration stops early.", nil, nil],
+    "MEDIUM" => [2, "Infrequently used. Transfer data in batches sized in between small and large.", nil, nil],
+    "LARGE" => [3, "Infrequently used. Transfer data in batches large enough to be, in a high-concurrency environment, nearly as efficient as possible. If the client stops iteration early, some disk and network bandwidth may be wasted. The batch size may still be too small to allow a single client to get high throughput from the database, so if that is what you need consider the SERIAL StreamingMode.", nil, nil],
+    "SERIAL" => [4, "Transfer data in batches large enough that an individual client can get reasonable read bandwidth from the database. If the client stops iteration early, considerable disk and network bandwidth may be wasted.", nil, nil],
+  }
+
+  @@MutationType = {
+    "ADD" => [2, "Performs an addition of little-endian integers. If the existing value in the database is not present or shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``. The integers to be added must be stored in a little-endian representation.  They can be signed in two's complement representation or unsigned. You can add to an integer at a known offset in the value by prepending the appropriate number of zero bytes to ``param`` and padding with zero bytes to match the length of the value. However, this offset technique requires that you know the addition will not cause the integer field within the value to overflow.", '', "addend"],
+    "AND" => [6, "Deprecated", '', "value with which to perform bitwise and"],
+    "BIT_AND" => [6, "Performs a bitwise ``and`` operation.  If the existing value in the database is not present, then ``param`` is stored in the database. If the existing value in the database is shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``.", '', "value with which to perform bitwise and"],
+    "OR" => [7, "Deprecated", '', "value with which to perform bitwise or"],
+    "BIT_OR" => [7, "Performs a bitwise ``or`` operation.  If the existing value in the database is not present or shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``.", '', "value with which to perform bitwise or"],
+    "XOR" => [8, "Deprecated", '', "value with which to perform bitwise xor"],
+    "BIT_XOR" => [8, "Performs a bitwise ``xor`` operation.  If the existing value in the database is not present or shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``.", '', "value with which to perform bitwise xor"],
+    "MAX" => [12, "Performs a little-endian comparison of byte strings. If the existing value in the database is not present or shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``. The larger of the two values is then stored in the database.", '', "value to check against database value"],
+    "MIN" => [13, "Performs a little-endian comparison of byte strings. If the existing value in the database is not present, then ``param`` is stored in the database. If the existing value in the database is shorter than ``param``, it is first extended to the length of ``param`` with zero bytes.  If ``param`` is shorter than the existing value in the database, the existing value is truncated to match the length of ``param``. The smaller of the two values is then stored in the database.", '', "value to check against database value"],
+    "SET_VERSIONSTAMPED_KEY" => [14, "Transforms ``key`` using a versionstamp for the transaction. Sets the transformed key in the database to ``param``. A versionstamp is a 10 byte, unique, monotonically (but not sequentially) increasing value for each committed transaction. The first 8 bytes are the committed version of the database. The last 2 bytes are monotonic in the serialization order for transactions. WARNING: At this time versionstamps are compatible with the Tuple layer only in the Java and Python bindings. Note that this implies versionstamped keys may not be used with the Subspace and Directory layers except in those languages.", '', "value to which to set the transformed key"],
+    "SET_VERSIONSTAMPED_VALUE" => [15, "Transforms ``param`` using a versionstamp for the transaction. Sets ``key`` in the database to the transformed parameter. A versionstamp is a 10 byte, unique, monotonically (but not sequentially) increasing value for each committed transaction. The first 8 bytes are the committed version of the database. The last 2 bytes are monotonic in the serialization order for transactions. WARNING: At this time versionstamped values are not compatible with the Tuple layer.", '', "value to versionstamp and set"],
+    "BYTE_MIN" => [16, "Performs lexicographic comparison of byte strings. If the existing value in the database is not present, then ``param`` is stored. Otherwise the smaller of the two values is then stored in the database.", '', "value to check against database value"],
+    "BYTE_MAX" => [17, "Performs lexicographic comparison of byte strings. If the existing value in the database is not present, then ``param`` is stored. Otherwise the larger of the two values is then stored in the database.", '', "value to check against database value"],
+  }
+
+  @@ConflictRangeType = {
+    "READ" => [0, "Used to add a read conflict range", nil, nil],
+    "WRITE" => [1, "Used to add a write conflict range", nil, nil],
+  }
+
+  @@ErrorPredicate = {
+
+  }
+
+end

data/lib/fdbsubspace.rb

@@ -0,0 +1,71 @@
+#encoding: BINARY
+
+#
+# fdbsubspace.rb
+#
+# This source file is part of the FoundationDB open source project
+#
+# Copyright 2013-2018 Apple Inc. and the FoundationDB project authors
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+# FoundationDB Ruby API
+
+# Documentation for this API can be found at
+# https://www.foundationdb.org/documentation/api-ruby.html
+
+require_relative 'fdbtuple'
+
+module FDB
+  class Subspace
+    def initialize(prefix_tuple=[], raw_prefix='')
+      @raw_prefix = raw_prefix.dup.force_encoding('BINARY') + FDB::Tuple.pack(prefix_tuple)
+    end
+    attr_reader :raw_prefix
+
+    def [](name)
+      Subspace.new([name], @raw_prefix)
+    end
+
+    def key
+      @raw_prefix
+    end
+
+    def pack(tuple)
+      @raw_prefix + FDB::Tuple.pack(tuple)
+    end
+
+    def unpack(key)
+      raise ArgumentError, 'Cannot unpack key that is not in subspace.' if not contains? key
+      FDB::Tuple.unpack(key[@raw_prefix.length..-1])
+    end
+
+    def range(tuple=[])
+      rng = FDB::Tuple.range(tuple)
+      [@raw_prefix + rng[0], @raw_prefix + rng[1]]
+    end
+
+    def contains?(key)
+      key.start_with? @raw_prefix
+    end
+
+    def as_foundationdb_key
+      key
+    end
+
+    def subspace(tuple)
+      Subspace.new(tuple, @raw_prefix)
+    end
+  end
+end

data/lib/fdbtuple.rb

@@ -0,0 +1,307 @@
+#encoding: BINARY
+
+#
+# fdbtuple.rb
+#
+# This source file is part of the FoundationDB open source project
+#
+# Copyright 2013-2018 Apple Inc. and the FoundationDB project authors
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+# FoundationDB Ruby API
+
+# Documentation for this API can be found at
+# https://www.foundationdb.org/documentation/api-ruby.html
+
+module FDB
+  module Tuple
+    @@size_limits = (0..8).map {|x| (1 << (x*8)) - 1}
+
+    # Type codes 
+    @@NULL_CODE       = 0x00
+    @@BYTES_CODE      = 0x01
+    @@STRING_CODE     = 0x02
+    @@NESTED_CODE     = 0x05
+    @@INT_ZERO_CODE   = 0x14
+    @@POS_INT_END     = 0x1c
+    @@NEG_INT_START   = 0x0c
+    @@FLOAT_CODE      = 0x20
+    @@DOUBLE_CODE     = 0x21
+    @@FALSE_CODE      = 0x26
+    @@TRUE_CODE       = 0x27
+    @@UUID_CODE       = 0x30
+
+    class UUID
+      def initialize(data)
+        if data.length != 16
+          raise Error.new(2268) # invalid_uuid_size
+        end
+        @data=data.slice(0,16)
+      end
+      def data
+        @data
+      end
+      def <=> (other)
+        self.data <=> other.data
+      end
+      def to_s
+        self.data.each_byte.map { |b| b.to_s(16) } .join
+      end
+    end
+
+    class SingleFloat
+      def initialize(value)
+        if value.kind_of? Float
+            @value=value
+        elsif value.kind_of? Integer
+            @value=value.to_f
+        else
+          raise ArgumentError, "Invalid value type for SingleFloat: " + value.class.name
+        end
+        @value=value
+      end
+      def value
+        @value
+      end
+      def <=> (other)
+        Tuple._compare_floats(self.value, other.value, false)
+      end
+      def to_s
+        self.value.to_s
+      end
+    end
+
+    def self.find_terminator(v, pos)
+      while true
+        pos = v.index("\x00", pos)
+        if !pos
+          return v.length
+        elsif pos+1 == v.length || v[pos+1] != "\xff"
+          return pos
+        end
+        pos += 2
+      end
+    end
+    private_class_method :find_terminator
+
+    def self.float_adjust(v, pos, length, encode)
+      if (encode and v[pos].ord & 0x80 != 0x00) or (not encode and v[pos].ord & 0x80 == 0x00)
+        v.slice(pos, length).chars.map { |b| (b.ord ^ 0xff).chr } .join
+      else
+        ret = v.slice(pos, length)
+        ret[0] = (ret[0].ord ^ 0x80).chr
+        ret
+      end
+    end
+    private_class_method :float_adjust
+
+    def self.decode(v, pos)
+      code = v.getbyte(pos)
+      if code == @@NULL_CODE
+        [nil, pos+1]
+      elsif code == @@BYTES_CODE
+        epos = find_terminator(v, pos+1)
+        [v.slice(pos+1, epos-pos-1).gsub("\x00\xFF", "\x00"), epos+1]
+      elsif code == @@STRING_CODE
+        epos = find_terminator(v, pos+1)
+        [v.slice(pos+1, epos-pos-1).gsub("\x00\xFF", "\x00").force_encoding("UTF-8"), epos+1]
+      elsif code >= @@INT_ZERO_CODE && code <= @@POS_INT_END
+        n = code - @@INT_ZERO_CODE
+        [("\x00" * (8-n) + v.slice(pos+1, n)).unpack("Q>")[0], pos+n+1]
+      elsif code >= @@NEG_INT_START and code < @@INT_ZERO_CODE
+        n = @@INT_ZERO_CODE - code
+        [("\x00" * (8-n) + v.slice(pos+1, n)).unpack("Q>")[0]-@@size_limits[n], pos+n+1]
+      elsif code == @@FALSE_CODE
+        [false, pos+1]
+      elsif code == @@TRUE_CODE
+        [true, pos+1]
+      elsif code == @@FLOAT_CODE
+        [SingleFloat.new(float_adjust(v, pos+1, 4, false).unpack("g")[0]), pos+5]
+      elsif code == @@DOUBLE_CODE
+        [float_adjust(v, pos+1, 8, false).unpack("G")[0], pos+9]
+      elsif code == @@UUID_CODE
+        [UUID.new(v.slice(pos+1, 16)), pos+17]
+      elsif code == @@NESTED_CODE
+        epos = pos+1
+        nested = []
+        while epos < v.length
+          if v.getbyte(epos) == @@NULL_CODE 
+            if epos+1 < v.length and v.getbyte(epos+1) == 0xFF
+              nested << nil
+              epos += 2
+            else
+              break
+            end
+          else
+            r, epos = decode(v, epos)
+            nested << r
+          end
+        end
+        [nested, epos+1]
+      else
+        raise "Unknown data type in DB: " + code.ord.to_s
+      end
+    end
+    private_class_method :decode
+
+    def self.bisect_left(list, item)
+      count = 0
+      list.each{|i|
+        return count if i >= item
+        count += 1
+      }
+      nil
+    end
+    private_class_method :bisect_left
+
+    def self.encode(v, nested=false)
+      if v.nil?
+        if nested
+          "\x00\xFF"
+        else
+          @@NULL_CODE.chr
+        end
+      elsif v.kind_of? String
+        if v.encoding == Encoding::BINARY || v.encoding == Encoding::ASCII
+          @@BYTES_CODE.chr + v.gsub("\x00", "\x00\xFF") + 0.chr
+        elsif v.encoding == Encoding::UTF_8
+          @@STRING_CODE.chr + v.dup.force_encoding("BINARY").gsub("\x00", "\x00\xFF") + 0.chr
+        else
+          raise ArgumentError, "unsupported encoding #{v.encoding.name}"
+        end
+      elsif v.kind_of? Integer
+        raise RangeError, "value outside inclusive range -2**64+1 to 2**64-1" if v < -2**64+1 || v > 2**64-1
+        if v == 0
+          @@INT_ZERO_CODE.chr
+        elsif v > 0
+          n = bisect_left( @@size_limits, v )
+          (20+n).chr + [v].pack("Q>").slice(8-n, n)
+        else
+          n = bisect_left( @@size_limits, -v )
+          (20-n).chr + [@@size_limits[n]+v].pack("Q>").slice(8-n, n)
+        end
+      elsif v.kind_of? TrueClass
+        @@TRUE_CODE.chr
+      elsif v.kind_of? FalseClass
+        @@FALSE_CODE.chr
+      elsif v.kind_of? SingleFloat
+        @@FLOAT_CODE.chr + float_adjust([v.value].pack("g"), 0, 4, true)
+      elsif v.kind_of? Float
+        @@DOUBLE_CODE.chr + float_adjust([v].pack("G"), 0, 8, true)
+      elsif v.kind_of? UUID
+        @@UUID_CODE.chr + v.data
+      elsif v.kind_of? Array
+        @@NESTED_CODE.chr + (v.map { |el| encode(el, true).force_encoding("BINARY") }).join + 0.chr
+      else
+        raise ArgumentError, "unsupported type #{v.class}"
+      end
+    end
+    private_class_method :encode
+
+    def self.pack(t)
+      (t.each_with_index.map {|el, i|
+         begin
+           (encode el).force_encoding("BINARY")
+         rescue
+           raise $!, "#{$!} at index #{i}", $!.backtrace
+         end
+       }).join
+    end
+
+    def self.unpack(key)
+      key = key.dup.force_encoding("BINARY")
+      pos = 0
+      res = []
+      while pos < key.length
+        r, pos = decode(key, pos)
+        res << r
+      end
+      res
+    end
+
+    def self.range(tuple=[])
+      p = pack(tuple)
+      [p+"\x00", p+"\xFF"]
+    end
+
+    def self._code_for(v)
+      if v.nil?
+        @@NULL_CODE
+      elsif v.kind_of? String
+        if v.encoding == Encoding::BINARY || v.encoding == Encoding::ASCII
+          @@BYTES_CODE
+        elsif v.encoding == Encoding::UTF_8
+          @@STRING_CODE
+        else
+          raise ArgumentError, "unsupported encoding #{v.encoding.name}"
+        end
+      elsif v.kind_of? Integer
+         @@INT_ZERO_CODE
+      elsif v.kind_of? TrueClass
+        @@TRUE_CODE
+      elsif v.kind_of? FalseClass
+        @@FALSE_CODE
+      elsif v.kind_of? SingleFloat
+        @@FLOAT_CODE
+      elsif v.kind_of? Float
+        @@DOUBLE_CODE
+      elsif v.kind_of? UUID
+        @@UUID_CODE
+      elsif v.kind_of? Array
+        @@NESTED_CODE
+      else
+        raise ArgumentError, "unsupported type #{v.class}"
+      end
+    end
+
+    def self._compare_floats(f1, f2, is_double)
+      # This converts the floats to their byte representation and then
+      # does the comparison. Why?
+      #   1) NaN comparison - Ruby doesn't really do this
+      #   2) -0.0 == 0.0 in Ruby but not in our representation
+      # It would be better to just take the floats and compare them, but
+      # this way handles the edge cases correctly.
+      b1 = float_adjust([f1].pack(is_double ? ">G" : ">g"), 0, (is_double ? 8 : 4), true)
+      b2 = float_adjust([f2].pack(is_double ? ">G" : ">g"), 0, (is_double ? 8 : 4), true)
+      b1 <=> b2
+    end
+
+    def self._compare_elems(v1, v2)
+      c1 = _code_for(v1)
+      c2 = _code_for(v2)
+      return c1 <=> c2 unless c1 == c2
+
+      if c1 == @@NULL_CODE
+        0
+      elsif c1 == @@DOUBLE_CODE
+        _compare_floats(v1, v2, true)
+      elsif c1 == @@NESTED_CODE
+        compare(v1, v2) # recurse
+      else
+        v1 <=> v2
+      end
+    end
+
+    def self.compare(tuple1, tuple2)
+      i = 0
+      while i < tuple1.length && i < tuple2.length
+        c = self._compare_elems(tuple1[i], tuple2[i])
+        return c unless c == 0
+        i += 1
+      end
+      tuple1.length <=> tuple2.length
+    end
+  end
+end