1
92%
main: 92%

Ran 01 Aug 2024 01:09AM UTC

Files 892

Run time 33s

Badge

Embed ▾

Committed 01 Aug 2024 01:06AM UTC coverage: 57.892% (+0.1%) from 57.763%

Job # 10190114717.1

Build Type

push

github

Committed by

web-flow

Commit Message

Data Structure: Dynamic Array (#841)

Create a new data structure for a basic growable indexable array,
supporting the features you'd normally expect such as insert (at, last,
first), remove (at, last, first), and get (at, last, first). Internally
all data is stored in an appropriately sized array that can directly be
returned to the caller as a C array of the data type provided. The array
grows by powers of two, and has optimizations for head and tail
removals.

Array modifications can be risky (e.g. wrong reallocation sizes,
mis-sized memory moves, out-of-bounds access), so it makes sense to have
standardized code that is well tested.

The arrays used by the dns record parser / writer have been converted to
the new array data structure as have a few other instances.

Authored-By: Brad House (@bradh352)

Coverage Stats

21603 of 37316 relevant lines covered (57.89%)

59564.39 hits per line

c-ares / c-ares / 10190114717 / 1
92%
main: 92%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 10190114717.1

c-ares / c-ares / 10190114717 / 1 92% main: 92%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 10190114717.1

c-ares / c-ares / 10190114717 / 1
92%
main: 92%

README BADGES
x