oj 3.8.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: a19be14b516dee300d722fd94e2ffc33415e046bec08a2e6bc62a2585967d616
+  data.tar.gz: 5c2d36263070e4ae9313657cdc0e56beb414bdd9c9025f5d7b2d5d3088ecab9f
+SHA512:
+  metadata.gz: aef03660a2a58f825e7776b230627229fc8a22b92bf748146b67b3c505bb62f4ca1ab6376450786ae67a9c1e15cae2095e0cbde92787fdcd8f72b5a28ff63ee8
+  data.tar.gz: c17b96a8433a4115aeb2d5367ca05d6739cfc9ab4c8471fd0f5c69b103e5b67f534dfd579c08133dc94315ebfa17ef1f077b9cc5a12ecb4d42431d4df8a57f67

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2012 Peter Ohler
+
+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/README.md

@@ -0,0 +1,104 @@
+# [![{}j](http://www.ohler.com/dev/images/oj_comet_64.svg)](http://www.ohler.com/oj) gem
+
+[![Build Status](https://img.shields.io/travis/ohler55/oj/master.svg)](http://travis-ci.org/ohler55/oj?branch=master) [![AppVeyor](https://img.shields.io/appveyor/ci/ohler55/oj/master.svg)](https://ci.appveyor.com/project/ohler55/oj) ![Gem](https://img.shields.io/gem/v/oj.svg) ![Gem](https://img.shields.io/gem/dt/oj.svg) [![SemVer compatibility](https://api.dependabot.com/badges/compatibility_score?dependency-name=oj&package-manager=bundler&version-scheme=semver)](https://dependabot.com/compatibility-score.html?dependency-name=oj&package-manager=bundler&version-scheme=semver) [![TideLift](https://tidelift.com/badges/github/ohler55/oj)](https://tidelift.com/subscription/pkg/rubygems-oj?utm_source=rubygems-oj&utm_medium=referral&utm_campaign=readme)
+
+A *fast* JSON parser and Object marshaller as a Ruby gem.
+
+Version 3.0 is out! 3.0 provides better json gem and Rails compatibility. It
+also provides additional optimization options.
+
+## Using
+
+```ruby
+require 'oj'
+
+h = { 'one' => 1, 'array' => [ true, false ] }
+json = Oj.dump(h)
+
+# json =
+# {
+#   "one":1,
+#   "array":[
+#     true,
+#     false
+#   ]
+# }
+
+h2 = Oj.load(json)
+puts "Same? #{h == h2}"
+# true
+```
+
+## Installation
+```
+gem install oj
+```
+
+or in Bundler:
+
+```
+gem 'oj'
+```
+
+## Support
+
+[Get supported Oj with a Tidelift Subscription.](https://tidelift.com/subscription/pkg/rubygems-oj?utm_source=rubygems-oj&utm_medium=referral&utm_campaign=readme)
+
+## Further Reading
+
+For more details on options, modes, advanced features, and more follow these
+links.
+
+ - [{file:Options.md}](pages/Options.md) for parse and dump options.
+ - [{file:Modes.md}](pages/Modes.md) for details on modes for strict JSON compliance, mimicing the JSON gem, and mimicing Rails and ActiveSupport behavior.
+ - [{file:JsonGem.md}](pages/JsonGem.md) includes more details on json gem compatibility and use.
+ - [{file:Rails.md}](pages/Rails.md) includes more details on Rails and ActiveSupport compatibility and use.
+ - [{file:Custom.md}](pages/Custom.md) includes more details on Custom mode.
+ - [{file:Encoding.md}](pages/Encoding.md) describes the :object encoding format.
+ - [{file:Compatibility.md}](pages/Compatibility.md) lists current compatibility with Rubys and Rails.
+ - [{file:Advanced.md}](pages/Advanced.md) for fast parser and marshalling features.
+ - [{file:Security.md}](pages/Security.md) for security considerations.
+
+## Releases
+
+See [{file:CHANGELOG.md}](CHANGELOG.md)
+
+## Links
+
+- *Documentation*: http://www.ohler.com/oj/doc, http://rubydoc.info/gems/oj
+
+- *GitHub* *repo*: https://github.com/ohler55/oj
+
+- *RubyGems* *repo*: https://rubygems.org/gems/oj
+
+Follow [@peterohler on Twitter](http://twitter.com/peterohler) for announcements and news about the Oj gem.
+
+#### Performance Comparisons
+
+ - [Oj Strict Mode Performance](http://www.ohler.com/dev/oj_misc/performance_strict.html) compares Oj strict mode parser performance to other JSON parsers.
+
+ - [Oj Compat Mode Performance](http://www.ohler.com/dev/oj_misc/performance_compat.html) compares Oj compat mode parser performance to other JSON parsers.
+
+ - [Oj Object Mode Performance](http://www.ohler.com/dev/oj_misc/performance_object.html) compares Oj object mode parser performance to other marshallers.
+
+ - [Oj Callback Performance](http://www.ohler.com/dev/oj_misc/performance_callback.html) compares Oj callback parser performance to other JSON parsers.
+
+#### Links of Interest
+
+ - *Fast XML parser and marshaller on RubyGems*: https://rubygems.org/gems/ox
+
+ - *Fast XML parser and marshaller on GitHub*: https://github.com/ohler55/ox
+
+ - [Need for Speed](http://www.ohler.com/dev/need_for_speed/need_for_speed.html) for an overview of how Oj::Doc was designed.
+
+ - *OjC, a C JSON parser*: https://www.ohler.com/ojc also at https://github.com/ohler55/ojc
+
+ - *Agoo, a high performance Ruby web server supporting GraphQL on GitHub*: https://github.com/ohler55/agoo
+
+ - *Agoo-C, a high performance C web server supporting GraphQL on GitHub*: https://github.com/ohler55/agoo-c
+
+#### Contributing
+
++ Provide a Pull Request off the `develop` branch.
++ Report a bug
++ Suggest an idea

data/ext/oj/buf.h

@@ -0,0 +1,103 @@
+/* buf.h
+ * Copyright (c) 2011, Peter Ohler
+ * All rights reserved.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ * 
+ *  - Redistributions of source code must retain the above copyright notice, this
+ *    list of conditions and the following disclaimer.
+ * 
+ *  - Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 
+ *  - Neither the name of Peter Ohler nor the names of its contributors may be
+ *    used to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef OJ_BUF_H
+#define OJ_BUF_H
+
+#include "ruby.h"
+
+typedef struct _buf {
+    char	*head;
+    char	*end;
+    char	*tail;
+    char	base[1024];
+} *Buf;
+
+inline static void
+buf_init(Buf buf) {
+    buf->head = buf->base;
+    buf->end = buf->base + sizeof(buf->base) - 1;
+    buf->tail = buf->head;
+}
+
+inline static void
+buf_cleanup(Buf buf) {
+    if (buf->base != buf->head) {
+        xfree(buf->head);
+    }
+}
+
+inline static size_t
+buf_len(Buf buf) {
+    return buf->tail - buf->head;
+}
+
+inline static void
+buf_append_string(Buf buf, const char *s, size_t slen) {
+    if (buf->end <= buf->tail + slen) {
+	size_t	len = buf->end - buf->head;
+	size_t	toff = buf->tail - buf->head;
+	size_t	new_len = len + slen + len / 2;
+
+	if (buf->base == buf->head) {
+	    buf->head = ALLOC_N(char, new_len);
+	    memcpy(buf->head, buf->base, len);
+	} else {
+	    REALLOC_N(buf->head, char, new_len);
+	}
+	buf->tail = buf->head + toff;
+	buf->end = buf->head + new_len - 1;
+    }
+    memcpy(buf->tail, s, slen);
+    buf->tail += slen;
+}
+    
+inline static void
+buf_append(Buf buf, char c) {
+    if (buf->end <= buf->tail) {
+	size_t	len = buf->end - buf->head;
+	size_t	toff = buf->tail - buf->head;
+	size_t	new_len = len + len / 2;
+
+	if (buf->base == buf->head) {
+	    buf->head = ALLOC_N(char, new_len);
+	    memcpy(buf->head, buf->base, len);
+	} else {
+	    REALLOC_N(buf->head, char, new_len);
+	}
+	buf->tail = buf->head + toff;
+	buf->end = buf->head + new_len - 1;
+    }
+    *buf->tail = c;
+    buf->tail++;
+    //*buf->tail = '\0'; // for debugging
+}
+
+#endif /* OJ_BUF_H */

data/ext/oj/cache8.c

@@ -0,0 +1,107 @@
+
+#include <stdlib.h>
+#include <errno.h>
+#include <stdio.h>
+#include <string.h>
+#include <stdarg.h>
+
+#include "ruby.h"
+#include "cache8.h"
+
+#define BITS		4
+#define MASK		0x000000000000000FULL
+#define SLOT_CNT	16
+#define DEPTH		16
+
+typedef union {
+    struct _cache8	*child;
+    slot_t		value;
+} Bucket;
+
+struct _cache8 {
+    Bucket	buckets[SLOT_CNT];
+};
+
+static void	cache8_delete(Cache8 cache, int depth);
+static void	slot_print(Cache8 cache, sid_t key, unsigned int depth);
+
+void
+oj_cache8_new(Cache8 *cache) {
+    Bucket	*b;
+    int		i;
+    
+    *cache = ALLOC(struct _cache8);
+    for (i = SLOT_CNT, b = (*cache)->buckets; 0 < i; i--, b++) {
+	b->value = 0;
+    }
+}
+
+void
+oj_cache8_delete(Cache8 cache) {
+    cache8_delete(cache, 0);
+}
+
+static void
+cache8_delete(Cache8 cache, int depth) {
+    Bucket		*b;
+    unsigned int	i;
+
+    for (i = 0, b = cache->buckets; i < SLOT_CNT; i++, b++) {
+	if (0 != b->child) {
+	    if (DEPTH - 1 != depth) {
+		cache8_delete(b->child, depth + 1);
+	    }
+	}
+    }
+    xfree(cache);
+}
+
+slot_t
+oj_cache8_get(Cache8 cache, sid_t key, slot_t **slot) {
+    Bucket	*b;
+    int		i;
+    sid_t	k8 = (sid_t)key;
+    sid_t	k;
+    
+    for (i = 64 - BITS; 0 < i; i -= BITS) {
+	k = (k8 >> i) & MASK;
+	b = cache->buckets + k;
+	if (0 == b->child) {
+	    oj_cache8_new(&b->child);
+	}
+	cache = b->child;
+    }
+    *slot = &(cache->buckets + (k8 & MASK))->value;
+
+    return **slot;
+}
+
+void
+oj_cache8_print(Cache8 cache) {
+    /*printf("-------------------------------------------\n"); */
+    slot_print(cache, 0, 0);
+}
+
+static void
+slot_print(Cache8 c, sid_t key, unsigned int depth) {
+    Bucket		*b;
+    unsigned int	i;
+    sid_t		k8 = (sid_t)key;
+    sid_t		k;
+
+    for (i = 0, b = c->buckets; i < SLOT_CNT; i++, b++) {
+	if (0 != b->child) {
+	    k = (k8 << BITS) | i;
+	    /*printf("*** key: 0x%016llx  depth: %u  i: %u\n", k, depth, i); */
+	    if (DEPTH - 1 == depth) {
+#if IS_WINDOWS
+		printf("0x%016lx: %4lu\n", (long unsigned int)k, (long unsigned int)b->value);
+#else
+		printf("0x%016llx: %4llu\n", (long long unsigned int)k, (long long unsigned int)b->value);
+#endif
+	    } else {
+		slot_print(b->child, k, depth + 1);
+	    }
+	}
+    }
+}

data/ext/oj/cache8.h

@@ -0,0 +1,48 @@
+/* cache8.h
+ * Copyright (c) 2011, Peter Ohler
+ * All rights reserved.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ * 
+ *  - Redistributions of source code must retain the above copyright notice, this
+ *    list of conditions and the following disclaimer.
+ * 
+ *  - Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 
+ *  - Neither the name of Peter Ohler nor the names of its contributors may be
+ *    used to endorse or promote products derived from this software without
+ *    specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef OJ_CACHE8_H
+#define OJ_CACHE8_H
+
+#include "ruby.h"
+#include "stdint.h"
+
+typedef struct _cache8	*Cache8;
+typedef uint64_t	slot_t;
+typedef uint64_t	sid_t;
+
+extern void	oj_cache8_new(Cache8 *cache);
+extern void	oj_cache8_delete(Cache8 cache);
+
+extern slot_t	oj_cache8_get(Cache8 cache, sid_t key, slot_t **slot);
+
+extern void	oj_cache8_print(Cache8 cache);
+
+#endif /* OJ_CACHE8_H */

data/ext/oj/circarray.c

@@ -0,0 +1,68 @@
+/* circarray.c
+ * Copyright (c) 2012, Peter Ohler
+ * All rights reserved.
+ */
+
+#include "circarray.h"
+
+CircArray
+oj_circ_array_new() {
+    CircArray	ca;
+    
+    if (0 == (ca = ALLOC(struct _circArray))) {
+	rb_raise(rb_eNoMemError, "not enough memory\n");
+    }
+    ca->objs = ca->obj_array;
+    ca->size = sizeof(ca->obj_array) / sizeof(VALUE);
+    ca->cnt = 0;
+    
+    return ca;
+}
+
+void
+oj_circ_array_free(CircArray ca) {
+    if (ca->objs != ca->obj_array) {
+	xfree(ca->objs);
+    }
+    xfree(ca);
+}
+
+void
+oj_circ_array_set(CircArray ca, VALUE obj, unsigned long id) {
+    if (0 < id && 0 != ca) {
+	unsigned long	i;
+
+	if (ca->size < id) {
+	    unsigned long	cnt = id + 512;
+
+	    if (ca->objs == ca->obj_array) {
+		if (0 == (ca->objs = ALLOC_N(VALUE, cnt))) {
+		    rb_raise(rb_eNoMemError, "not enough memory\n");
+		}
+		memcpy(ca->objs, ca->obj_array, sizeof(VALUE) * ca->cnt);
+	    } else { 
+		REALLOC_N(ca->objs, VALUE, cnt);
+	    }
+	    ca->size = cnt;
+	}
+	id--;
+	for (i = ca->cnt; i < id; i++) {
+	    ca->objs[i] = Qnil;
+	}
+	ca->objs[id] = obj;
+	if (ca->cnt <= id) {
+	    ca->cnt = id + 1;
+	}
+    }
+}
+
+VALUE
+oj_circ_array_get(CircArray ca, unsigned long id) {
+    VALUE	obj = Qnil;
+
+    if (id <= ca->cnt && 0 != ca) {
+	obj = ca->objs[id - 1];
+    }
+    return obj;
+}
+