pnx/tree-sitter-dotenv
1
0
Fork 0
mirror of https://github.com/pnx/tree-sitter-dotenv synced 2026-11-15 19:26:46 +01:00
Code Releases Activity

Merge pull request #29 from pnx/dependabot/npm_and_yarn/npm-7faec5b2a1

Browse source 
build(deps): bump tree-sitter-cli from 0.27.1 to 0.27.2 in the npm group
This commit is contained in:
Henrik Hautakoski 2026-11-15 14:38:07 +01:00 • committed by GitHub
commit 7dbfffac3c
Signed by: GitHub
GPG key ID: B5690EEEBB952194
3 changed files with 30 additions and 24 deletions
Download patch file Download diff file Expand all files Collapse all files

12
package-lock.json generated
View file

@ -1,12 +1,12 @@
{
"name": "tree-sitter-dotenv",
"version": "1.1.2",
"version": "1.1.3",
"lockfileVersion": 3,
"requires": true,
"packages": {
"": {
"name": "tree-sitter-dotenv",
"version": "1.1.2",
"version": "1.1.3",
"hasInstallScript": true,
"license": "MIT",
"dependencies": {
@ -15,7 +15,7 @@
},
"devDependencies": {
"prebuildify": "^6.0.1",
"tree-sitter-cli": "^0.27.1"
"tree-sitter-cli": "^0.27.2"
},
"peerDependencies": {
"tree-sitter": "^0.21.1"
@ -338,9 +338,9 @@
}
},
"node_modules/tree-sitter-cli": {
"version": "0.27.1",
"resolved": "https://registry.npmjs.org/tree-sitter-cli/-/tree-sitter-cli-0.27.1.tgz",
"integrity": "sha512-WFPEjxwscCjZP9uYj0rxT2TyGBkDcXUkGTthrMpxZFGvzXEYsbC3J0633Ps8dd2mMsdsbU8oVwmQ148lLHI7Xw==",
"version": "0.27.2",
"resolved": "https://registry.npmjs.org/tree-sitter-cli/-/tree-sitter-cli-0.27.2.tgz",
"integrity": "sha512-uuqW/tbzkGaV5pJeNYI0OwixzpXg3Ozx3XH3DXhnSz8DCrvQp5JACLr4/0y9C5AfmL6irfLoTkvN1338m8UGYw==",
"dev": true,
"hasInstallScript": true,
"license": "MIT",

2
package.json
View file

@ -27,7 +27,7 @@
},
"devDependencies": {
"prebuildify": "^6.0.1",
"tree-sitter-cli": "^0.27.1"
"tree-sitter-cli": "^0.27.2"
},
"peerDependencies": {
"tree-sitter": "^0.21.1"

40
src/tree_sitter/array.h generated
View file

@ -50,12 +50,18 @@ extern "C" {
/// memory allocated for the array's contents.
#define array_clear(self) ((self)->size = 0)
#ifdef __cplusplus
#define _array__cast(self, expr) (decltype((self)->contents))(expr)
#else
#define _array__cast(self, expr) (expr)
#endif
/// Reserve `new_capacity` elements of space in the array. If `new_capacity` is
/// less than the array's current capacity, this function has no effect.
#define array_reserve(self, new_capacity) \
((self)->contents = _array__reserve( \
(void *)(self)->contents, &(self)->capacity, \
array_elem_size(self), new_capacity) \
#define array_reserve(self, new_capacity) \
((self)->contents = _array__cast(self, _array__reserve( \
(void *)(self)->contents, &(self)->capacity, \
array_elem_size(self), new_capacity)) \
)
/// Free any memory allocated for this array. Note that this does not free any
@ -71,10 +77,10 @@ extern "C" {
/// Push a new `element` onto the end of the array.
#define array_push(self, element) \
do { \
(self)->contents = _array__grow( \
(self)->contents = _array__cast(self, _array__grow( \
(void *)(self)->contents, (self)->size, &(self)->capacity, \
1, array_elem_size(self) \
); \
)); \
(self)->contents[(self)->size++] = (element); \
} while(0)
@ -83,10 +89,10 @@ extern "C" {
#define array_grow_by(self, count) \
do { \
if ((count) == 0) break; \
(self)->contents = _array__grow( \
(self)->contents = _array__cast(self, _array__grow( \
(self)->contents, (self)->size, &(self)->capacity, \
count, array_elem_size(self) \
); \
)); \
memset((self)->contents + (self)->size, 0, (count) * array_elem_size(self)); \
(self)->size += (count); \
} while (0)
@ -98,26 +104,26 @@ extern "C" {
/// Append `count` elements to the end of the array, reading their values from the
/// `contents` pointer.
#define array_extend(self, count, other_contents) \
(self)->contents = _array__splice( \
((self)->contents = _array__cast(self, _array__splice( \
(void*)(self)->contents, &(self)->size, &(self)->capacity, \
array_elem_size(self), (self)->size, 0, count, other_contents \
)
)))
/// Remove `old_count` elements from the array starting at the given `index`. At
/// the same index, insert `new_count` new elements, reading their values from the
/// `new_contents` pointer.
#define array_splice(self, _index, old_count, new_count, new_contents) \
(self)->contents = _array__splice( \
((self)->contents = _array__cast(self, _array__splice( \
(void *)(self)->contents, &(self)->size, &(self)->capacity, \
array_elem_size(self), _index, old_count, new_count, new_contents \
)
)))
/// Insert one `element` into the array at the given `index`.
#define array_insert(self, _index, element) \
(self)->contents = _array__splice( \
((self)->contents = _array__cast(self, _array__splice( \
(void *)(self)->contents, &(self)->size, &(self)->capacity, \
array_elem_size(self), _index, 0, 1, &(element) \
)
)))
/// Remove one element from the array at the given `index`.
#define array_erase(self, _index) \
@ -128,17 +134,17 @@ extern "C" {
/// Assign the contents of one array to another, reallocating if necessary.
#define array_assign(self, other) \
(self)->contents = _array__assign( \
((self)->contents = _array__cast(self, _array__assign( \
(void *)(self)->contents, &(self)->size, &(self)->capacity, \
(const void *)(other)->contents, (other)->size, array_elem_size(self) \
)
)))
/// Swap one array with another
#define array_swap(self, other) \
do { \
void *_array_swap_tmp = (void *)(self)->contents; \
(self)->contents = (other)->contents; \
(other)->contents = _array_swap_tmp; \
(other)->contents = _array__cast(other, _array_swap_tmp); \
_array__swap(&(self)->size, &(self)->capacity, \
&(other)->size, &(other)->capacity); \
} while (0)