Create Arrays: */
| 2604 | |
| 2605 | /* Create Arrays: */ |
| 2606 | CJSON_PUBLIC(cJSON *) cJSON_CreateIntArray(const int *numbers, int count) |
| 2607 | { |
| 2608 | size_t i = 0; |
| 2609 | cJSON *n = NULL; |
| 2610 | cJSON *p = NULL; |
| 2611 | cJSON *a = NULL; |
| 2612 | |
| 2613 | if ((count < 0) || (numbers == NULL)) |
| 2614 | { |
| 2615 | return NULL; |
| 2616 | } |
| 2617 | |
| 2618 | a = cJSON_CreateArray(); |
| 2619 | |
| 2620 | for(i = 0; a && (i < (size_t)count); i++) |
| 2621 | { |
| 2622 | n = cJSON_CreateNumber(numbers[i]); |
| 2623 | if (!n) |
| 2624 | { |
| 2625 | cJSON_Delete(a); |
| 2626 | return NULL; |
| 2627 | } |
| 2628 | if(!i) |
| 2629 | { |
| 2630 | a->child = n; |
| 2631 | } |
| 2632 | else |
| 2633 | { |
| 2634 | suffix_object(p, n); |
| 2635 | } |
| 2636 | p = n; |
| 2637 | } |
| 2638 | |
| 2639 | if (a && a->child) { |
| 2640 | a->child->prev = n; |
| 2641 | } |
| 2642 | |
| 2643 | return a; |
| 2644 | } |
| 2645 | |
| 2646 | CJSON_PUBLIC(cJSON *) cJSON_CreateFloatArray(const float *numbers, int count) |
| 2647 | { |
searching dependent graphs…