Home
last modified time | relevance | path

Searched refs:n_items (Results 76 – 100 of 1730) sorted by relevance

12345678910>>...70

/dports/devel/spdlog/spdlog-1.9.2/include/spdlog/sinks/
H A Dringbuffer_sink.h24 explicit ringbuffer_sink(size_t n_items) in ringbuffer_sink() argument
25 : q_{n_items} in ringbuffer_sink()
32 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
34 ret.reserve(n_items);
35 for (size_t i = (items_available - n_items); i < items_available; i++)
46 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
48 ret.reserve(n_items);
49 for (size_t i = (items_available - n_items); i < items_available; i++)
/dports/deskutils/flameshot/flameshot-0.10.2/external/spdlog/include/spdlog/sinks/
H A Dringbuffer_sink.h24 explicit ringbuffer_sink(size_t n_items) in ringbuffer_sink() argument
25 : q_{n_items} in ringbuffer_sink()
32 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
34 ret.reserve(n_items);
35 for (size_t i = (items_available - n_items); i < items_available; i++)
46 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
48 ret.reserve(n_items);
49 for (size_t i = (items_available - n_items); i < items_available; i++)
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/spdlog/sinks/
H A Dringbuffer_sink.h24 explicit ringbuffer_sink(size_t n_items) in ringbuffer_sink() argument
25 : q_{n_items} in ringbuffer_sink()
32 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
34 ret.reserve(n_items);
35 for (size_t i = (items_available - n_items); i < items_available; i++)
46 auto n_items = lim > 0 ? (std::min)(lim, items_available) : items_available; variable
48 ret.reserve(n_items);
49 for (size_t i = (items_available - n_items); i < items_available; i++)
/dports/lang/mosml/mosml-ver-2.10.1/src/mosmllib/
H A DPolyhash.sml18 n_items : int ref}
40 n_items = ref 0
48 if (!n_items >= sz)
79 n_items := !n_items + 1;
105 n_items := !n_items + 1;
158 n_items := !n_items - 1;
163 fun numItems (HT{n_items, ...}) = !n_items
212 n_items = ref(!n_items),
223 else (n_items := !n_items - 1; filterP rest)
254 n_items = ref(!n_items),
[all …]
H A DHashset.sml37 n_items : int ref}
53 fun growTable (HT{table, n_items, ...}) =
57 if (!n_items >= sz) then
82 n_items = ref 0
95 n_items := !n_items + 1;
122 n_items = ref 0
148 set2 as HT{n_items=ref n2, ...}) =
152 fun equal (set1 as HT{n_items=ref n1, ...}, set2 as HT{n_items=ref n2, ...}) =
201 n_items := !n_items - 1
206 fun numItems (HT{n_items, ...}) = !n_items
[all …]
/dports/audio/gnome-music/gnome-music-41.0/subprojects/gfm/
H A Dgtksortlistmodel.c138 for (i = 0; i < n_items ; i++) in G_DEFINE_TYPE_WITH_CODE()
173 for (i = 0; i < n_items; i++) in gtk_sort_list_model_add_items()
199 guint n_items, start, end, start2, end2; in gtk_sort_list_model_items_changed_cb() local
216 g_list_model_items_changed (G_LIST_MODEL (self), start, n_items - added + removed, n_items); in gtk_sort_list_model_items_changed_cb()
434 guint n_items; in gtk_sort_list_model_set_sort_func() local
454 if (n_items > 1) in gtk_sort_list_model_set_sort_func()
455 g_list_model_items_changed (G_LIST_MODEL (self), 0, n_items, n_items); in gtk_sort_list_model_set_sort_func()
548 guint n_items; in gtk_sort_list_model_resort() local
555 n_items = g_list_model_get_n_items (self->model); in gtk_sort_list_model_resort()
556 if (n_items <= 1) in gtk_sort_list_model_resort()
[all …]
/dports/multimedia/pipewire/pipewire-0.3.43/src/modules/module-protocol-native/v0/
H A Dprotocol-native.c92 uint32_t i, n_items; in core_marshal_info() local
115 n_items = info->props ? info->props->n_items : 0; in core_marshal_info()
818 n_items = props ? props->n_items : 0; in registry_marshal_global()
897 uint32_t i, n_items; in module_marshal_info() local
901 n_items = info->props ? info->props->n_items : 0; in module_marshal_info()
936 n_items = info->props ? info->props->n_items : 0; in factory_marshal_info()
964 uint32_t i, n_items; in node_marshal_info() local
968 n_items = info->props ? info->props->n_items : 0; in node_marshal_info()
1051 n_items = info->props ? info->props->n_items : 0; in port_marshal_info()
1142 n_items = info->props ? info->props->n_items : 0; in client_marshal_info()
[all …]
/dports/games/nazghul/nazghul-0.7.1/src/
H A Dknapsack.c39 for (i = 0; i < prob->n_items; i++) { in dump_problem()
54 for (i = 0; i < prob->n_items; i++) { in ks_solve()
75 for (j = 0; j < prob->n_items; j++) in ks_solve()
92 for (i = 0; i < prob->n_items; i++) { in ks_solve()
106 if (!prob || prob->n_items < 0 || prob->n_items > MAX_N_ITEMS) in knapsack_solve()
110 for (i = 0; i < prob->n_items; i++) { in knapsack_solve()
/dports/sysutils/bareos-server/bareos-Release-20.0.3/core/src/droplet/libdroplet/src/
H A Dvec.c51 for (i = 0; i < vec->n_items; i++) dpl_value_free(vec->items[i]); in dpl_vec_free()
68 vec->n_items = 0; in dpl_vec_new()
103 if (vec->n_items == vec->size) { in dpl_vec_add_value()
131 vec->items[vec->n_items] = nval; in dpl_vec_add_value()
133 vec->n_items++; in dpl_vec_add_value()
184 assert(i < vec->n_items); in dpl_vec_get()
200 for (i = 0; i < vec->n_items; i++) { in dpl_vec_dup()
216 qsort(vec->items, vec->n_items, sizeof(dpl_value_t*), cmp_func); in dpl_vec_sort()
223 for (i = 0; i < vec->n_items; i++) { in dpl_vec_print()
224 int last = (i == (vec->n_items - 1)); in dpl_vec_print()
/dports/sysutils/bareos-client/bareos-Release-20.0.3/core/src/droplet/libdroplet/src/
H A Dvec.c51 for (i = 0; i < vec->n_items; i++) dpl_value_free(vec->items[i]); in dpl_vec_free()
68 vec->n_items = 0; in dpl_vec_new()
103 if (vec->n_items == vec->size) { in dpl_vec_add_value()
131 vec->items[vec->n_items] = nval; in dpl_vec_add_value()
133 vec->n_items++; in dpl_vec_add_value()
184 assert(i < vec->n_items); in dpl_vec_get()
200 for (i = 0; i < vec->n_items; i++) { in dpl_vec_dup()
216 qsort(vec->items, vec->n_items, sizeof(dpl_value_t*), cmp_func); in dpl_vec_sort()
223 for (i = 0; i < vec->n_items; i++) { in dpl_vec_print()
224 int last = (i == (vec->n_items - 1)); in dpl_vec_print()
/dports/sysutils/bareos-traymonitor/bareos-Release-20.0.3/core/src/droplet/libdroplet/src/
H A Dvec.c51 for (i = 0; i < vec->n_items; i++) dpl_value_free(vec->items[i]); in dpl_vec_free()
68 vec->n_items = 0; in dpl_vec_new()
103 if (vec->n_items == vec->size) { in dpl_vec_add_value()
131 vec->items[vec->n_items] = nval; in dpl_vec_add_value()
133 vec->n_items++; in dpl_vec_add_value()
184 assert(i < vec->n_items); in dpl_vec_get()
200 for (i = 0; i < vec->n_items; i++) { in dpl_vec_dup()
216 qsort(vec->items, vec->n_items, sizeof(dpl_value_t*), cmp_func); in dpl_vec_sort()
223 for (i = 0; i < vec->n_items; i++) { in dpl_vec_print()
224 int last = (i == (vec->n_items - 1)); in dpl_vec_print()
/dports/www/bareos-webui/bareos-Release-20.0.3/core/src/droplet/libdroplet/src/
H A Dvec.c51 for (i = 0; i < vec->n_items; i++) dpl_value_free(vec->items[i]); in dpl_vec_free()
68 vec->n_items = 0; in dpl_vec_new()
103 if (vec->n_items == vec->size) { in dpl_vec_add_value()
131 vec->items[vec->n_items] = nval; in dpl_vec_add_value()
133 vec->n_items++; in dpl_vec_add_value()
184 assert(i < vec->n_items); in dpl_vec_get()
200 for (i = 0; i < vec->n_items; i++) { in dpl_vec_dup()
216 qsort(vec->items, vec->n_items, sizeof(dpl_value_t*), cmp_func); in dpl_vec_sort()
223 for (i = 0; i < vec->n_items; i++) { in dpl_vec_print()
224 int last = (i == (vec->n_items - 1)); in dpl_vec_print()
/dports/multimedia/pipewire/pipewire-0.3.43/spa/tests/
H A Dbenchmark-dict.c57 static void gen_dict(struct spa_dict *dict, uint32_t n_items) in gen_dict() argument
61 for (i = 0; i < n_items; i++) { in gen_dict()
66 dict->n_items = n_items; in gen_dict()
76 idx = random() % dict->n_items; in test_query()
95 fprintf(stderr, "%d elapsed %"PRIu64" count %u = %"PRIu64"/sec\n", dict->n_items, in test_lookup()
103 fprintf(stderr, "%d sort elapsed %"PRIu64"\n", dict->n_items, t3 - t2); in test_lookup()
113 fprintf(stderr, "%d elapsed %"PRIu64" count %u = %"PRIu64"/sec %f speedup\n", dict->n_items, in test_lookup()
/dports/x11-toolkits/gtk-sharp20/gtk-sharp-2.12.45/gtk/
H A DStockManager.cs30 static extern void gtk_stock_add_static(ref Gtk.StockItem items, uint n_items); in gtk_stock_add_static() argument
33 public static void AddStatic(Gtk.StockItem items, uint n_items) in AddStatic() argument
35 gtk_stock_add_static(ref items, n_items); in AddStatic()
80 static extern void gtk_stock_add(ref Gtk.StockItem item, uint n_items); in gtk_stock_add() argument
83 static extern void gtk_stock_add(Gtk.StockItem[] items, uint n_items); in gtk_stock_add() argument
86 public static void Add (Gtk.StockItem items, uint n_items) in Add() argument
88 gtk_stock_add(ref items, n_items); in Add()
/dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/
H A Dgtkselectionmodel.h82 guint n_items);
91 guint n_items,
95 guint n_items);
112 guint n_items);
124 guint n_items,
129 guint n_items);
143 guint n_items);
/dports/devel/tla/tla-1.3.5/src/hackerlab/tests/hash-tests/
H A Dunit-hashtree.c78 count_depths (int * n_items, float * total_depth, struct hashtree * ht, int depth) in count_depths() argument
87 count_depths (n_items, total_depth, (struct hashtree *)ht->children[x], 1 + depth); in count_depths()
95 *n_items += 1; in count_depths()
221 int n_items; in main() local
227 n_items = 0; in main()
229 count_depths (&n_items, &total_depth, ht, 0); in main()
230 average_depth = total_depth / (float)n_items; in main()
233 average_deviation = total_deviation / (float)n_items; in main()
235 …safe_printfmt (2, "%d items, average depth %d, average depth deviation %d\n", n_items, (int)round_… in main()
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c144 u16 n_items, u16 *alloced) in brcmf_commonring_reserve_for_write_multiple() argument
160 *alloced = min_t(u16, n_items, available - 1); in brcmf_commonring_reserve_for_write_multiple()
198 u16 n_items) in brcmf_commonring_write_cancel() argument
201 commonring->w_ptr = commonring->depth - n_items; in brcmf_commonring_write_cancel()
203 commonring->w_ptr -= n_items; in brcmf_commonring_write_cancel()
208 u16 *n_items) in brcmf_commonring_get_read_ptr() argument
213 *n_items = (commonring->w_ptr >= commonring->r_ptr) ? in brcmf_commonring_get_read_ptr()
217 if (*n_items == 0) in brcmf_commonring_get_read_ptr()
226 u16 n_items) in brcmf_commonring_read_complete() argument
228 commonring->r_ptr += n_items; in brcmf_commonring_read_complete()
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c144 u16 n_items, u16 *alloced) in brcmf_commonring_reserve_for_write_multiple() argument
160 *alloced = min_t(u16, n_items, available - 1); in brcmf_commonring_reserve_for_write_multiple()
198 u16 n_items) in brcmf_commonring_write_cancel() argument
201 commonring->w_ptr = commonring->depth - n_items; in brcmf_commonring_write_cancel()
203 commonring->w_ptr -= n_items; in brcmf_commonring_write_cancel()
208 u16 *n_items) in brcmf_commonring_get_read_ptr() argument
213 *n_items = (commonring->w_ptr >= commonring->r_ptr) ? in brcmf_commonring_get_read_ptr()
217 if (*n_items == 0) in brcmf_commonring_get_read_ptr()
226 u16 n_items) in brcmf_commonring_read_complete() argument
228 commonring->r_ptr += n_items; in brcmf_commonring_read_complete()
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dcommonring.c144 u16 n_items, u16 *alloced) in brcmf_commonring_reserve_for_write_multiple() argument
160 *alloced = min_t(u16, n_items, available - 1); in brcmf_commonring_reserve_for_write_multiple()
198 u16 n_items) in brcmf_commonring_write_cancel() argument
201 commonring->w_ptr = commonring->depth - n_items; in brcmf_commonring_write_cancel()
203 commonring->w_ptr -= n_items; in brcmf_commonring_write_cancel()
208 u16 *n_items) in brcmf_commonring_get_read_ptr() argument
213 *n_items = (commonring->w_ptr >= commonring->r_ptr) ? in brcmf_commonring_get_read_ptr()
217 if (*n_items == 0) in brcmf_commonring_get_read_ptr()
226 u16 n_items) in brcmf_commonring_read_complete() argument
228 commonring->r_ptr += n_items; in brcmf_commonring_read_complete()
/dports/x11-toolkits/gtk-sharp30/gtk-sharp-2.99.3/gtk/
H A DStockManager.cs30 static extern void gtk_stock_add_static(ref Gtk.StockItem items, uint n_items); in gtk_stock_add_static() argument
33 public static void AddStatic(Gtk.StockItem items, uint n_items) in AddStatic() argument
35 gtk_stock_add_static(ref items, n_items); in AddStatic()
80 static extern void gtk_stock_add(ref Gtk.StockItem item, uint n_items); in gtk_stock_add() argument
83 static extern void gtk_stock_add(Gtk.StockItem[] items, uint n_items); in gtk_stock_add() argument
86 public static void Add (Gtk.StockItem items, uint n_items) in Add() argument
88 gtk_stock_add(ref items, n_items); in Add()
/dports/devel/dconf/dconf-0.40.0/tests/
H A Dchangeset.c33 gint n_items; in test_basic() local
39 g_assert_cmpint (n_items, ==, 0); in test_basic()
140 gint n_items; in test_describe() local
146 g_assert_cmpint (n_items, ==, 0); in test_describe()
152 g_assert_cmpint (n_items, ==, 1); in test_describe()
164 g_assert_cmpint (n_items, ==, 1); in test_describe()
174 g_assert_cmpint (n_items, ==, 1); in test_describe()
193 g_assert_cmpint (n_items, ==, i); in test_describe()
204 g_assert (keys[n_items] == NULL); in test_describe()
219 g_assert_cmpint (n_items, ==, i); in test_describe()
[all …]
/dports/devel/glib20/glib-2.70.4/gio/
H A Dgliststore.c336 gint n_items; in g_list_store_sort() local
343 n_items = g_sequence_get_length (store->items); in g_list_store_sort()
344 g_list_store_items_changed (store, 0, n_items, n_items); in g_list_store_sort()
365 guint n_items; in g_list_store_append() local
370 n_items = g_sequence_get_length (store->items); in g_list_store_append()
373 g_list_store_items_changed (store, n_items, 0, 1); in g_list_store_append()
415 guint n_items; in g_list_store_remove_all() local
419 n_items = g_sequence_get_length (store->items); in g_list_store_remove_all()
423 g_list_store_items_changed (store, 0, n_items, 0); in g_list_store_remove_all()
458 guint n_items; in g_list_store_splice() local
[all …]
/dports/multimedia/pipewire/pipewire-0.3.43/spa/include/spa/utils/
H A Ddict.h56 uint32_t n_items; member
60 #define SPA_DICT_INIT(items,n_items) (struct spa_dict) { 0, n_items, items } argument
65 (item) < &(dict)->items[(dict)->n_items]; \
77 qsort((void*)dict->items, dict->n_items, sizeof(struct spa_dict_item), in spa_dict_qsort()
90 (const void *) dict->items, dict->n_items, in spa_dict_lookup_item()
/dports/www/firefox/firefox-99.0/third_party/pipewire/spa/utils/
H A Ddict.h46 uint32_t n_items; member
50 #define SPA_DICT_INIT(items,n_items) (struct spa_dict) { 0, n_items, items } argument
55 (item) < &(dict)->items[(dict)->n_items]; \
67 qsort((void*)dict->items, dict->n_items, sizeof(struct spa_dict_item), in spa_dict_qsort()
80 (const void *) dict->items, dict->n_items, in spa_dict_lookup_item()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/pipewire/spa/utils/
H A Ddict.h46 uint32_t n_items; member
50 #define SPA_DICT_INIT(items,n_items) (struct spa_dict) { 0, n_items, items } argument
55 (item) < &(dict)->items[(dict)->n_items]; \
67 qsort((void*)dict->items, dict->n_items, sizeof(struct spa_dict_item), in spa_dict_qsort()
80 (const void *) dict->items, dict->n_items, in spa_dict_lookup_item()

12345678910>>...70