int item;
int i;
listitem_T **ptrs;
- cw_interval_T *table;
+ cw_interval_T *table = NULL;
+ size_t table_size;
cw_interval_T *cw_table_save;
size_t cw_table_size_save;
char *error = NULL;
return;
l = argvars[0].vval.v_list;
- if (l->lv_len == 0)
- {
+ table_size = (size_t)l->lv_len;
+ if (table_size == 0)
// Clearing the table.
- VIM_CLEAR(cw_table);
- cw_table_size = 0;
- goto done;
- }
+ goto update;
- ptrs = ALLOC_MULT(listitem_T *, l->lv_len);
+ ptrs = ALLOC_MULT(listitem_T *, table_size);
if (ptrs == NULL)
return;
}
// Sort the list on the first number.
- qsort((void *)ptrs, (size_t)l->lv_len, sizeof(listitem_T *), tv_nr_compare);
+ qsort((void *)ptrs, table_size, sizeof(listitem_T *), tv_nr_compare);
- table = ALLOC_MULT(cw_interval_T, l->lv_len);
+ table = ALLOC_MULT(cw_interval_T, table_size);
if (table == NULL)
{
vim_free(ptrs);
}
// Store the items in the new table.
- for (item = 0; item < l->lv_len; ++item)
+ for (item = 0; (size_t)item < table_size; ++item)
{
listitem_T *lili = ptrs[item];
varnumber_T n1;
vim_free(ptrs);
+update:
cw_table_save = cw_table;
cw_table_size_save = cw_table_size;
cw_table = table;
- cw_table_size = l->lv_len;
+ cw_table_size = table_size;
// Check that the new value does not conflict with 'listchars' or
// 'fillchars'.
}
vim_free(cw_table_save);
-done:
changed_window_setting_all();
redraw_all_later(UPD_CLEAR);
}
call assert_fails('call setcellwidths([[0x33, 0x44, 2]])', 'E1114:')
- set listchars=tab:--\\u2192
+ set listchars=tab:--\\u2192 fillchars=stl:\\u2501
call assert_fails('call setcellwidths([[0x2192, 0x2192, 2]])', 'E834:')
-
- set fillchars=stl:\\u2501
call assert_fails('call setcellwidths([[0x2501, 0x2501, 2]])', 'E835:')
+ call setcellwidths([[0x201c, 0x201d, 1]])
+ set listchars& fillchars& ambiwidth=double
+
+ set listchars=nbsp:\\u201c fillchars=vert:\\u201d
+ call assert_fails('call setcellwidths([])', 'E834:')
set listchars&
+ call assert_fails('call setcellwidths([])', 'E835:')
set fillchars&
+
call setcellwidths([])
+ set ambiwidth&
bwipe!
endfunc