/dports/mail/evolution/evolution-3.42.1/src/e-util/ |
H A D | e-table-subset-variable.c | 52 etss->map_table[etss->n_map++] = row; in G_DEFINE_TYPE() 75 etss->map_table[etss->n_map++] = array[i]; in etssv_add_array() 101 etss->map_table[etss->n_map++] = i; in etssv_add_all() 114 for (i = 0; i < etss->n_map; i++) { in etssv_remove() 120 (etss->n_map - i - 1) * sizeof (gint)); in etssv_remove() 121 etss->n_map--; in etssv_remove() 151 E_TABLE_SUBSET (etssv)->n_map = 0; in e_table_subset_variable_construct() 242 etss->n_map = 0; in e_table_subset_variable_clear() 257 for (i = 0; i < etss->n_map; i++) { in e_table_subset_variable_increment() 270 for (i = 0; i < etss->n_map; i++) { in e_table_subset_variable_decrement() [all …]
|
H A D | e-table-sorted.c | 165 subset->n_map = rows; in ets_proxy_model_changed() 222 if (row != etss->n_map) { in ets_proxy_model_rows_inserted() 224 for (i = 0; i < etss->n_map; i++) { in ets_proxy_model_rows_inserted() 231 etss->map_table = g_realloc (etss->map_table, (etss->n_map + count) * sizeof (gint)); in ets_proxy_model_rows_inserted() 236 i = etss->n_map; in ets_proxy_model_rows_inserted() 254 etss->n_map++; in ets_proxy_model_rows_inserted() 280 shift = row == etss->n_map - count; in ets_proxy_model_rows_deleted() 283 for (i = 0; i < etss->n_map; i++) { in ets_proxy_model_rows_deleted() 288 etss->n_map--; in ets_proxy_model_rows_deleted() 295 for (i = 0; i < etss->n_map; i++) { in ets_proxy_model_rows_deleted() [all …]
|
H A D | e-table-sorted-variable.c | 130 if (etss->n_map + 1 > etssv->n_vals_allocated) { in etsv_add() 134 i = etss->n_map; in etsv_add() 147 …utils_insert (source_model, etsv->sort_info, etsv->full_header, etss->map_table, etss->n_map, row); in etsv_add() 148 memmove (etss->map_table + i + 1, etss->map_table + i, (etss->n_map - i) * sizeof (gint)); in etsv_add() 152 etss->n_map++; in etsv_add() 172 if (etss->n_map + rows > etssv->n_vals_allocated) { in etsv_add_all() 177 etss->map_table[etss->n_map++] = i; in etsv_add_all() 232 …orting_utils_sort (source_model, etsv->sort_info, etsv->full_header, etss->map_table, etss->n_map); in etsv_sort()
|
H A D | e-table-subset.c | 35 (row >= -1 && row < table_subset->n_map) 70 const gint n = table_subset->n_map; in G_DEFINE_TYPE_WITH_CODE() 75 table_subset->n_map, in G_DEFINE_TYPE_WITH_CODE() 259 return table_subset->n_map; in table_subset_row_count() 550 table_subset->n_map = nvals; in e_table_subset_construct() 636 for (i = 0; i < table_subset->n_map; i++) { in e_table_subset_model_to_view_row() 649 if (view_row >= 0 && view_row < table_subset->n_map) in e_table_subset_view_to_model_row() 674 for (i = 0; i < table_subset->n_map; i++) { in e_table_subset_print_debugging()
|
H A D | e-tree-table-adapter.c | 73 gint n_map; member 139 etta->priv->n_map = size; in resize_map() 148 if (count <= 0 || from >= etta->priv->n_map) in move_map_elements() 175 for (i = 0; i < etta->priv->n_map; i++) in remap_indices() 345 resize_map (etta, etta->priv->n_map - to_remove); in delete_node() 493 resize_map (etta, etta->priv->n_map + size); in insert_node() 942 return etta->priv->n_map; in tree_table_adapter_row_count() 1538 resize_map (etta, etta->priv->n_map + num_children); in e_tree_table_adapter_node_set_expanded() 1582 if (row == -1 && etta->priv->n_map > 0) in e_tree_table_adapter_node_at_row() 1583 row = etta->priv->n_map - 1; in e_tree_table_adapter_node_at_row() [all …]
|
/dports/math/GiNaC/ginac-1.8.2/check/ |
H A D | exam_mod_gcd.cpp | 68 std::map<std::size_t, std::size_t> n_map; in main() local 70 n_map[10] = 256; in main() 72 n_map[100] = 32; in main() 73 std::map<std::size_t, std::size_t>::const_iterator i = n_map.begin(); in main() 74 for (; i != n_map.end(); ++i) { in main()
|
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/util/ |
H A D | _remap.pyx | 12 cdef size_t i, n_map, n_array 14 n_map = inval.shape[0] 15 for i in range(n_map):
|
/dports/lang/cparser/cparser-0.9.14/driver/ |
H A D | firm_opt.c | 263 size_t n_map = 0; in rts_map() local 267 rec[n_map].i_call.kind = INTRINSIC_CALL; in rts_map() 268 rec[n_map].i_call.i_ent = *mapper[i].ent; in rts_map() 269 rec[n_map].i_call.i_mapper = mapper[i].func; in rts_map() 270 rec[n_map].i_call.ctx = NULL; in rts_map() 271 rec[n_map].i_call.link = NULL; in rts_map() 272 ++n_map; in rts_map() 276 if (n_map > 0) in rts_map() 277 lower_intrinsics(rec, n_map, /* part_block_used=*/0); in rts_map()
|
/dports/math/dbcsr/dbcsr-2.1.0/src/mm/ |
H A D | dbcsr_mm_csr.F | 376 k_map, k_size, m_map, m_size, n_map, & local 453 DO n_map = 1, dbcsr_cfg%nn_stacks + 1 454 IF (n_map .LE. dbcsr_cfg%nn_stacks) THEN 455 n_size = most_common_n(n_map) 461 .AND. n_map .LE. dbcsr_cfg%nn_stacks) THEN 464 (k_map - 1)*dbcsr_cfg%nn_stacks + n_map 466 this%stack_map(n_map, k_map, m_map) = INT(ps_g, kind=int_1) 479 this%stack_map(n_map, k_map, m_map) = INT(default_stack, kind=int_1) 515 map_loop: DO n_map = 1, SIZE(this%stack_map, 1) 517 IF (this%stack_map(m_map, k_map, n_map) == flop_index(istack)) THEN [all …]
|
H A D | dbcsr_mm.F | 400 n_map, old_product_col_blk_offsets, old_product_col_blk_sizes, & local 752 m_map, k_vmap, n_map, matrix_c%row_blk_size) 756 CALL make_sizes_dense(matrix_c%col_blk_size, n_map, & 781 m_map, n_map) 855 k_vmap, m_map, n_map, & 863 k_vmap, m_map, n_map) 933 m_map, n_map) 958 CALL array_release(n_map)
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/mm/ |
H A D | dbcsr_mm_csr.F | 378 k_map, k_size, m_map, m_size, n_map, & local 455 DO n_map = 1, dbcsr_cfg%nn_stacks + 1 456 IF (n_map .LE. dbcsr_cfg%nn_stacks) THEN 457 n_size = most_common_n(n_map) 463 .AND. n_map .LE. dbcsr_cfg%nn_stacks) THEN 466 (k_map - 1)*dbcsr_cfg%nn_stacks + n_map 468 this%stack_map(n_map, k_map, m_map) = INT(ps_g, kind=int_1) 481 this%stack_map(n_map, k_map, m_map) = INT(default_stack, kind=int_1) 517 map_loop: DO n_map = 1, SIZE(this%stack_map, 1) 519 IF (this%stack_map(m_map, k_map, n_map) == flop_index(istack)) THEN [all …]
|
H A D | dbcsr_mm.F | 404 n_map, old_product_col_blk_offsets, old_product_col_blk_sizes, & local 746 m_map, k_vmap, n_map, matrix_c%row_blk_size) 750 CALL make_sizes_dense(matrix_c%col_blk_size, n_map, & 775 m_map, n_map) 849 k_vmap, m_map, n_map, & 857 k_vmap, m_map, n_map) 923 m_map, n_map) 948 CALL array_release(n_map)
|
/dports/graphics/gegl/gegl-0.4.34/gegl/ |
H A D | gegl-metadata.h | 160 gsize n_map); 202 gsize n_map);
|
/dports/science/nest/nest-simulator-3.1/nestkernel/ |
H A D | structural_plasticity_node.cpp | 206 std::map< Name, double > n_map; in get_synaptic_elements() local 212 n_map.insert( std::pair< Name, double >( it->first, get_synaptic_elements( it->first ) ) ); in get_synaptic_elements() 214 return n_map; in get_synaptic_elements()
|
/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 56 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) { in bfs_name_printer() argument
|
/dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
H A D | bfs-name-printer.cpp | 55 bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) {} in bfs_name_printer() argument
|
/dports/misc/mnn/MNN-1.2.0/source/backend/coreml/mlmodel/include/ |
H A D | DataStructures.pb-c.h | 60 size_t n_map; member 87 size_t n_map; member 114 size_t n_map; member 141 size_t n_map; member
|
/dports/www/firefox-legacy/firefox-52.8.0esr/media/pocketsphinx/src/ |
H A D | mdef.c | 507 int32 n_ci, n_tri, n_map, n; in mdef_init() local 543 n_map = -1; in mdef_init() 559 n_map = n; in mdef_init() 568 } while ((n_ci < 0) || (n_tri < 0) || (n_map < 0) || in mdef_init() 589 m->n_emit_state = (n_map / (n_ci + n_tri)) - 1; in mdef_init() 590 if ((m->n_emit_state + 1) * (n_ci + n_tri) != n_map) in mdef_init()
|