Subject | Hash | Author | Date (UTC) |
---|---|---|---|
DynamicArray_sorted instert function bug fix | 7677fded3f22300d92a497d787b135a2e7ac988a | Your Name | 2019-11-20 21:25:15 |
moved doxygen search path | 245fc569f64ae36e7fc8ab93ea954e98696512ed | Your Name | 2019-11-20 19:02:23 |
renamed jtl to jlib and namespace jl | 343794453e4b4643cb53d01d8fde4a2e75d6bdc1 | Your Name | 2019-11-20 18:53:58 |
disabled doxygen sorting | e23e48587d14715bc4b2b44ac5d0016525bc1a0d | Your Name | 2019-11-20 18:45:03 |
documentation improved by tags | 63f7874b0f9d9864a39f408478f56fc5a3c114d2 | Your Name | 2019-11-20 18:10:30 |
added doxygen to gitignore | 7dff94b8d776d61b9a48b1fbbd8cd6116ec600c0 | Your Name | 2019-11-20 00:20:22 |
doxygen documentation | 8d1302091cb159975bee74ab8d011d2d21e6ade2 | Your Name | 2019-11-20 00:13:57 |
this file no need | 571e8c3919e7aef0b7a6d5c1ddccb115d76eb238 | Your Name | 2019-11-20 00:13:41 |
fixed forgotten args for call | 08bc90ed1322b77548e8693188663ac7c49b5953 | Your Name | 2019-11-19 20:55:46 |
dynamic array modifications | e072bcf5cb0e9a95f097b6186db845ed5dec0e16 | Your Name | 2019-11-19 17:42:59 |
removed CallInfo | e75341700184671df5d87b4d09fdbc51f338b9e7 | Your Name | 2019-11-19 17:42:39 |
binary search functions | df03aebc3f0c64a1406277d98153faf646780707 | Your Name | 2019-11-19 17:41:11 |
jtl allocate | b6168118b52e446bdf2f8bfe9506783c8ce9be1c | Your Name | 2019-11-19 08:51:51 |
added CallMod enums typedefs to cleaner argument view | 3ad1e61b19a1522c92a7f5ff6f8d5c08e4f7b13c | Your Name | 2019-11-18 22:03:37 |
dynamic array implementetion | f429fe93ff11825a70e81e067888d53d63fb4996 | Your Name | 2019-11-18 21:56:58 |
initial commit | 81aeda457c9a462c50b2a441b6ca1296bf6e20d3 | Your Name | 2019-11-18 16:40:21 |
File | Lines added | Lines deleted |
---|---|---|
include/jlib/dynamic_array_mods.h | 1 | 1 |
File include/jlib/dynamic_array_mods.h changed (mode: 100644) (index 25749ad..14e2f0b) | |||
... | ... | namespace jl | |
85 | 85 | return false; | return false; |
86 | 86 | ||
87 | 87 | T *p_closest = binary_search_first_ge(this->begin(), this->end(), value); | T *p_closest = binary_search_first_ge(this->begin(), this->end(), value); |
88 | for (T *p = &this->last(); p > p_closest; ++p) | ||
88 | for (T *p = this->end(); p > p_closest; --p) | ||
89 | 89 | *p = *(p-1); | *p = *(p-1); |
90 | 90 | *p_closest = value; | *p_closest = value; |
91 | 91 | this->p_end += sizeof(T); | this->p_end += sizeof(T); |