(setq truncate-lines t)
(setq buffer-read-only t)
;; Force L2R direction, to avoid messing the display if the first
- ;; buffer in the list happens to begin with a string R2L character.
+ ;; buffer in the list happens to begin with a strong R2L character.
(setq bidi-paragraph-direction 'left-to-right))
(define-obsolete-variable-alias 'buffer-menu-mode-hook
(erase-buffer)
(setq standard-output (current-buffer))
;; Force L2R direction, to avoid messing the display if the
- ;; first buffer in the list happens to begin with a string R2L
+ ;; first buffer in the list happens to begin with a strong R2L
;; character.
(setq bidi-paragraph-direction 'left-to-right)
(unless Buffer-menu-use-header-line
int level, bidi_dir_t override)
{
bidi_it->stack_idx++;
- if (bidi_it->stack_idx >= BIDI_MAXLEVEL)
- abort ();
+ xassert (bidi_it->stack_idx < BIDI_MAXLEVEL);
bidi_it->level_stack[bidi_it->stack_idx].level = level;
bidi_it->level_stack[bidi_it->stack_idx].override = override;
}
/* Push the bidi iterator state in preparation for reordering a
different object, e.g. display string found at certain buffer
- position. Pushing the bidi iterator boils to saving its entire
- state on the cache and starting a new cache "stacked" on top of the
- current cache. */
+ position. Pushing the bidi iterator boils down to saving its
+ entire state on the cache and starting a new cache "stacked" on top
+ of the current cache. */
void
bidi_push_it (struct bidi_it *bidi_it)
{
memcpy (&bidi_cache[bidi_cache_idx++], bidi_it, sizeof (struct bidi_it));
/* Push the current cache start onto the stack. */
- if (bidi_cache_sp >= IT_STACK_SIZE)
- abort ();
+ xassert (bidi_cache_sp < IT_STACK_SIZE);
bidi_cache_start_stack[bidi_cache_sp++] = bidi_cache_start;
/* Start a new level of cache, and make it empty. */
}
/* The code below can call eval, and thus cause GC. If we are
- iterating a Lisp string, make sure it won't GCed. */
+ iterating a Lisp string, make sure it won't be GCed. */
if (STRINGP (bidi_it->string.lstring))
GCPRO1 (bidi_it->string.lstring);