readapt 0.8.0 → 0.8.1

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: 660628a66dff5d1b46364c85d7ef3f115693463c1a94b18854ca79c7521a5b86
4
- data.tar.gz: 4cbbffc522a4907d1819846262c473add5e76404f04bb3c654829301c704e821
3
+ metadata.gz: 3a783dd879a972485872f13d31e299c02b223a3bea89c3be764f9b21448a5fd7
4
+ data.tar.gz: 52776a0cfc2befe9215b2da2f828c9d82f7c8858fcad29ff4c052aef4fc70cc5
5
5
  SHA512:
6
- metadata.gz: 5f36dd16bf2e1a396eda01205e80fa5bf0d6ff3a12064297cbd6cba2f2f3643fb527a31c76c659bd4c49c32ae620d7dba72ede08ba677d0187cef0ba9b6b0ec5
7
- data.tar.gz: 1e21ac739a23df49966a15a7b99477c5e0e795a8bc9600f779a9cd9c9ff58aa3c11b5a57fb4c9fb9732cf04287fa8614a99ecc561526fc6d20d9b73b4a305690
6
+ metadata.gz: be0687dddd12bcee0d2529262f3bae3f859da3c3d17fe3fdebd1b3631f47cd51ad2b09493ea1f6172af74dae41c0eae4ee91918d5eb89da7314620271ada51b5
7
+ data.tar.gz: 5152ece20452deea044bd6864e7f8092d2cb0c9d39bc8d89e15c3f5c9782cf67d35db9c5ca3f5cd81496724c839dd3d2dc98a2efde32258ca094c9a59c57de21
data/.gitignore CHANGED
@@ -7,6 +7,7 @@
7
7
  /spec/reports/
8
8
  /tmp/
9
9
  *.so
10
+ *.bundle
10
11
  /.vscode/
11
12
  Gemfile.lock
12
13
 
@@ -7,6 +7,10 @@ rvm:
7
7
  - 2.4
8
8
  - 2.5
9
9
  - 2.6
10
+ matrix:
11
+ include:
12
+ - rvm: 2.6
13
+ os: osx
10
14
  before_script:
11
15
  - bundle install
12
16
  - rake compile
@@ -1,3 +1,6 @@
1
+ # 0.8.1 - November 14, 2019
2
+ - Header name conflict in MacOS (#4)
3
+
1
4
  # 0.8.0 - November 9, 2019
2
5
  - Multiple frames
3
6
  - Flush output on disconnect
@@ -8,9 +8,9 @@
8
8
  * e.g., `sizeof(some_struct)`. The optional `free_func` argument is a pointer
9
9
  * to a function that will be called when an element is popped off the stack.
10
10
  */
11
- stack_t *stack_alloc(size_t elem_size, void (*free_func)(void *))
11
+ readapt_stack_t *stack_alloc(size_t elem_size, void (*free_func)(void *))
12
12
  {
13
- stack_t *s = malloc(sizeof(stack_t));
13
+ readapt_stack_t *s = malloc(sizeof(readapt_stack_t));
14
14
  s->elem_size = elem_size;
15
15
  s->free_func = free_func;
16
16
  s->size = 0;
@@ -21,7 +21,7 @@ stack_t *stack_alloc(size_t elem_size, void (*free_func)(void *))
21
21
  /**
22
22
  * Add an element to the end of the stack
23
23
  */
24
- void stack_push(stack_t *stack, void *element)
24
+ void stack_push(readapt_stack_t *stack, void *element)
25
25
  {
26
26
  if (stack->size == stack->capacity)
27
27
  {
@@ -43,7 +43,7 @@ void stack_push(stack_t *stack, void *element)
43
43
  /**
44
44
  * Get a pointer to the last element in the stack.
45
45
  */
46
- void *stack_peek(stack_t *stack)
46
+ void *stack_peek(readapt_stack_t *stack)
47
47
  {
48
48
  return stack->size == 0 ? NULL : stack->elements[stack->size - 1];
49
49
  }
@@ -51,7 +51,7 @@ void *stack_peek(stack_t *stack)
51
51
  /**
52
52
  * Pop the last element off the stack and pass it to free_func.
53
53
  */
54
- void stack_pop(stack_t *stack)
54
+ void stack_pop(readapt_stack_t *stack)
55
55
  {
56
56
  void *e;
57
57
 
@@ -71,7 +71,7 @@ void stack_pop(stack_t *stack)
71
71
  * Free the stack from memory. If it still contains any elements, pass them to
72
72
  * free_func.
73
73
  */
74
- void stack_free(stack_t *stack)
74
+ void stack_free(readapt_stack_t *stack)
75
75
  {
76
76
  int i;
77
77
 
@@ -3,18 +3,18 @@
3
3
 
4
4
  #include "stddef.h"
5
5
 
6
- typedef struct stack_struct {
6
+ typedef struct readapt_stack_struct {
7
7
  int size;
8
8
  size_t elem_size;
9
9
  void (*free_func)(void *);
10
10
  int capacity;
11
11
  void **elements;
12
- } stack_t;
12
+ } readapt_stack_t;
13
13
 
14
- stack_t *stack_alloc(size_t elem_size, void(*free_func)(void*));
15
- void stack_push(stack_t *stack, void *element);
16
- void *stack_peek(stack_t *stack);
17
- void stack_pop(stack_t *stack);
18
- void stack_free(stack_t *stack);
14
+ readapt_stack_t *stack_alloc(size_t elem_size, void(*free_func)(void*));
15
+ void stack_push(readapt_stack_t *stack, void *element);
16
+ void *stack_peek(readapt_stack_t *stack);
17
+ void stack_pop(readapt_stack_t *stack);
18
+ void stack_free(readapt_stack_t *stack);
19
19
 
20
20
  #endif
@@ -10,7 +10,7 @@ typedef struct thread_reference_struct {
10
10
  int cursor;
11
11
  int depth;
12
12
  ID control;
13
- stack_t *frames;
13
+ readapt_stack_t *frames;
14
14
  } thread_reference_t;
15
15
 
16
16
  void initialize_threads(VALUE);
@@ -1,3 +1,3 @@
1
1
  module Readapt
2
- VERSION = "0.8.0"
2
+ VERSION = "0.8.1"
3
3
  end
metadata CHANGED
@@ -1,14 +1,14 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: readapt
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.8.0
4
+ version: 0.8.1
5
5
  platform: ruby
6
6
  authors:
7
7
  - Fred Snyder
8
8
  autorequire:
9
9
  bindir: exe
10
10
  cert_chain: []
11
- date: 2019-11-09 00:00:00.000000000 Z
11
+ date: 2019-11-14 00:00:00.000000000 Z
12
12
  dependencies:
13
13
  - !ruby/object:Gem::Dependency
14
14
  name: backport