fns.c 49.6 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Random utility Lisp functions.
Karl Heuer's avatar
Karl Heuer committed
2
   Copyright (C) 1985, 86, 87, 93, 94, 95 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7

This file is part of GNU Emacs.

GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
8
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
9 10 11 12 13 14 15 16 17
any later version.

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Emacs; see the file COPYING.  If not, write to
18 19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
20 21


22
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
23 24 25 26 27 28 29 30 31 32

/* Note on some machines this defines `vector' as a typedef,
   so make sure we don't use that name in this file.  */
#undef vector
#define vector *****

#include "lisp.h"
#include "commands.h"

#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
33
#include "keyboard.h"
34
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
35

Karl Heuer's avatar
Karl Heuer committed
36 37 38 39
#ifndef NULL
#define NULL (void *)0
#endif

40 41
extern Lisp_Object Flookup_key ();

42
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
43
Lisp_Object Qyes_or_no_p_history;
44
Lisp_Object Qcursor_in_echo_area;
Jim Blandy's avatar
Jim Blandy committed
45

46
static int internal_equal ();
47

Jim Blandy's avatar
Jim Blandy committed
48 49 50 51 52 53 54 55
DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0,
  "Return the argument unchanged.")
  (arg)
     Lisp_Object arg;
{
  return arg;
}

56 57 58 59
extern long get_random ();
extern void seed_random ();
extern long time ();

Jim Blandy's avatar
Jim Blandy committed
60 61
DEFUN ("random", Frandom, Srandom, 0, 1, 0,
  "Return a pseudo-random number.\n\
62 63
All integers representable in Lisp are equally likely.\n\
  On most systems, this is 28 bits' worth.\n\
64
With positive integer argument N, return random number in interval [0,N).\n\
Jim Blandy's avatar
Jim Blandy committed
65
With argument t, set the random number seed from the current time and pid.")
66 67
  (n)
     Lisp_Object n;
Jim Blandy's avatar
Jim Blandy committed
68
{
69 70
  EMACS_INT val;
  Lisp_Object lispy_val;
71
  unsigned long denominator;
Jim Blandy's avatar
Jim Blandy committed
72

73
  if (EQ (n, Qt))
74
    seed_random (getpid () + time (NULL));
75
  if (NATNUMP (n) && XFASTINT (n) != 0)
Jim Blandy's avatar
Jim Blandy committed
76
    {
77 78 79 80
      /* Try to take our random number from the higher bits of VAL,
	 not the lower, since (says Gentzel) the low bits of `random'
	 are less random than the higher ones.  We do this by using the
	 quotient rather than the remainder.  At the high end of the RNG
81
	 it's possible to get a quotient larger than n; discarding
82
	 these values eliminates the bias that would otherwise appear
83 84
	 when using a large n.  */
      denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n);
85
      do
86
	val = get_random () / denominator;
87
      while (val >= XFASTINT (n));
Jim Blandy's avatar
Jim Blandy committed
88
    }
89
  else
90
    val = get_random ();
91 92
  XSETINT (lispy_val, val);
  return lispy_val;
Jim Blandy's avatar
Jim Blandy committed
93 94 95 96 97 98 99
}

/* Random data-structure functions */

DEFUN ("length", Flength, Slength, 1, 1, 0,
  "Return the length of vector, list or string SEQUENCE.\n\
A byte-code function object is also allowed.")
100 101
  (sequence)
     register Lisp_Object sequence;
Jim Blandy's avatar
Jim Blandy committed
102 103 104 105 106
{
  register Lisp_Object tail, val;
  register int i;

 retry:
107 108 109 110 111
  if (STRINGP (sequence))
    XSETFASTINT (val, XSTRING (sequence)->size);
  else if (VECTORP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size);
  else if (CHAR_TABLE_P (sequence))
112
    XSETFASTINT (val, CHAR_TABLE_ORDINARY_SLOTS);
113 114 115 116 117
  else if (BOOL_VECTOR_P (sequence))
    XSETFASTINT (val, XBOOL_VECTOR (sequence)->size);
  else if (COMPILEDP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size & PSEUDOVECTOR_SIZE_MASK);
  else if (CONSP (sequence))
Jim Blandy's avatar
Jim Blandy committed
118
    {
119
      for (i = 0, tail = sequence; !NILP (tail); i++)
Jim Blandy's avatar
Jim Blandy committed
120 121 122 123 124
	{
	  QUIT;
	  tail = Fcdr (tail);
	}

125
      XSETFASTINT (val, i);
Jim Blandy's avatar
Jim Blandy committed
126
    }
127
  else if (NILP (sequence))
128
    XSETFASTINT (val, 0);
Jim Blandy's avatar
Jim Blandy committed
129 130
  else
    {
131
      sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
132 133
      goto retry;
    }
134
  return val;
Jim Blandy's avatar
Jim Blandy committed
135 136
}

137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
/* This does not check for quits.  That is safe
   since it must terminate.  */

DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0,
  "Return the length of a list, but avoid error or infinite loop.\n\
This function never gets an error.  If LIST is not really a list,\n\
it returns 0.  If LIST is circular, it returns a finite value\n\
which is at least the number of distinct elements.")
 (list)
     Lisp_Object list;
{
  Lisp_Object tail, halftail, length;
  int len = 0;

  /* halftail is used to detect circular lists.  */
  halftail = list;
  for (tail = list; CONSP (tail); tail = XCONS (tail)->cdr)
    {
      if (EQ (tail, halftail) && len != 0)
156
	break;
157
      len++;
158
      if ((len & 1) == 0)
159 160 161 162 163 164 165
	halftail = XCONS (halftail)->cdr;
    }

  XSETINT (length, len);
  return length;
}

Jim Blandy's avatar
Jim Blandy committed
166 167
DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
  "T if two strings have identical contents.\n\
168
Case is significant, but text properties are ignored.\n\
Jim Blandy's avatar
Jim Blandy committed
169 170 171 172
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
173
  if (SYMBOLP (s1))
174
    XSETSTRING (s1, XSYMBOL (s1)->name);
175
  if (SYMBOLP (s2))
176
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

  if (XSTRING (s1)->size != XSTRING (s2)->size ||
      bcmp (XSTRING (s1)->data, XSTRING (s2)->data, XSTRING (s1)->size))
    return Qnil;
  return Qt;
}

DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0,
  "T if first arg string is less than second in lexicographic order.\n\
Case is significant.\n\
Symbols are also allowed; their print names are used instead.")
  (s1, s2)
     register Lisp_Object s1, s2;
{
  register int i;
  register unsigned char *p1, *p2;
  register int end;

197
  if (SYMBOLP (s1))
198
    XSETSTRING (s1, XSYMBOL (s1)->name);
199
  if (SYMBOLP (s2))
200
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234
  CHECK_STRING (s1, 0);
  CHECK_STRING (s2, 1);

  p1 = XSTRING (s1)->data;
  p2 = XSTRING (s2)->data;
  end = XSTRING (s1)->size;
  if (end > XSTRING (s2)->size)
    end = XSTRING (s2)->size;

  for (i = 0; i < end; i++)
    {
      if (p1[i] != p2[i])
	return p1[i] < p2[i] ? Qt : Qnil;
    }
  return i < XSTRING (s2)->size ? Qt : Qnil;
}

static Lisp_Object concat ();

/* ARGSUSED */
Lisp_Object
concat2 (s1, s2)
     Lisp_Object s1, s2;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[2];
  args[0] = s1;
  args[1] = s2;
  return concat (2, args, Lisp_String, 0);
#else
  return concat (2, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Richard M. Stallman's avatar
Richard M. Stallman committed
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
/* ARGSUSED */
Lisp_Object
concat3 (s1, s2, s3)
     Lisp_Object s1, s2, s3;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[3];
  args[0] = s1;
  args[1] = s2;
  args[2] = s3;
  return concat (3, args, Lisp_String, 0);
#else
  return concat (3, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Jim Blandy's avatar
Jim Blandy committed
251 252 253 254
DEFUN ("append", Fappend, Sappend, 0, MANY, 0,
  "Concatenate all the arguments and make the result a list.\n\
The result is a list whose elements are the elements of all the arguments.\n\
Each argument may be a list, vector or string.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
255
The last argument is not copied, just used as the tail of the new list.")
Jim Blandy's avatar
Jim Blandy committed
256 257 258 259 260 261 262 263 264 265
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_Cons, 1);
}

DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0,
  "Concatenate all the arguments and make the result a string.\n\
The result is a string whose elements are the elements of all the arguments.\n\
266 267 268 269 270 271
Each argument may be a string or a list or vector of characters (integers).\n\
\n\
Do not use individual integers as arguments!\n\
The behavior of `concat' in that case will be changed later!\n\
If your program passes an integer as an argument to `concat',\n\
you should change it right away not to do so.")
Jim Blandy's avatar
Jim Blandy committed
272 273 274 275 276 277 278 279 280 281 282 283 284 285 286
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_String, 0);
}

DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0,
  "Concatenate all the arguments and make the result a vector.\n\
The result is a vector whose elements are the elements of all the arguments.\n\
Each argument may be a list, vector or string.")
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
287
  return concat (nargs, args, Lisp_Vectorlike, 0);
Jim Blandy's avatar
Jim Blandy committed
288 289 290 291 292 293 294 295 296
}

DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0,
  "Return a copy of a list, vector or string.\n\
The elements of a list or vector are not copied; they are shared\n\
with the original.")
  (arg)
     Lisp_Object arg;
{
Jim Blandy's avatar
Jim Blandy committed
297
  if (NILP (arg)) return arg;
298 299 300 301 302 303 304 305

  if (CHAR_TABLE_P (arg))
    {
      int i, size;
      Lisp_Object copy;

      /* Calculate the number of extra slots.  */
      size = CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (arg));
306
      copy = Fmake_char_table (XCHAR_TABLE (arg)->purpose, Qnil);
307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
      /* Copy all the slots, including the extra ones.  */
      bcopy (XCHAR_TABLE (arg)->contents, XCHAR_TABLE (copy)->contents,
	     (XCHAR_TABLE (arg)->size & PSEUDOVECTOR_SIZE_MASK) * sizeof (Lisp_Object));

      /* Recursively copy any char-tables in the ordinary slots.  */
      for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
	if (CHAR_TABLE_P (XCHAR_TABLE (arg)->contents[i]))
	  XCHAR_TABLE (copy)->contents[i]
	    = Fcopy_sequence (XCHAR_TABLE (copy)->contents[i]);

      return copy;
    }

  if (BOOL_VECTOR_P (arg))
    {
      Lisp_Object val;
      int size_in_chars
324
	= (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR) / BITS_PER_CHAR;
325 326 327 328 329 330 331

      val = Fmake_bool_vector (Flength (arg), Qnil);
      bcopy (XBOOL_VECTOR (arg)->data, XBOOL_VECTOR (val)->data,
	     size_in_chars);
      return val;
    }

332
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365
    arg = wrong_type_argument (Qsequencep, arg);
  return concat (1, &arg, CONSP (arg) ? Lisp_Cons : XTYPE (arg), 0);
}

static Lisp_Object
concat (nargs, args, target_type, last_special)
     int nargs;
     Lisp_Object *args;
     enum Lisp_Type target_type;
     int last_special;
{
  Lisp_Object val;
  Lisp_Object len;
  register Lisp_Object tail;
  register Lisp_Object this;
  int toindex;
  register int leni;
  register int argnum;
  Lisp_Object last_tail;
  Lisp_Object prev;

  /* In append, the last arg isn't treated like the others */
  if (last_special && nargs > 0)
    {
      nargs--;
      last_tail = args[nargs];
    }
  else
    last_tail = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
366
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
367
	    || COMPILEDP (this) || BOOL_VECTOR_P (this)))
Jim Blandy's avatar
Jim Blandy committed
368
	{
369
	  if (INTEGERP (this))
370
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
371 372 373 374 375 376 377 378 379 380 381 382
	  else
	    args[argnum] = wrong_type_argument (Qsequencep, this);
	}
    }

  for (argnum = 0, leni = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
      len = Flength (this);
      leni += XFASTINT (len);
    }

383
  XSETFASTINT (len, leni);
Jim Blandy's avatar
Jim Blandy committed
384 385 386

  if (target_type == Lisp_Cons)
    val = Fmake_list (len, Qnil);
387
  else if (target_type == Lisp_Vectorlike)
Jim Blandy's avatar
Jim Blandy committed
388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
    val = Fmake_vector (len, Qnil);
  else
    val = Fmake_string (len, len);

  /* In append, if all but last arg are nil, return last arg */
  if (target_type == Lisp_Cons && EQ (val, Qnil))
    return last_tail;

  if (CONSP (val))
    tail = val, toindex = -1;		/* -1 in toindex is flag we are making a list */
  else
    toindex = 0;

  prev = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      Lisp_Object thislen;
      int thisleni;
      register int thisindex = 0;

      this = args[argnum];
      if (!CONSP (this))
	thislen = Flength (this), thisleni = XINT (thislen);

413
      if (STRINGP (this) && STRINGP (val)
414 415 416 417 418 419
	  && ! NULL_INTERVAL_P (XSTRING (this)->intervals))
	{
	  copy_text_properties (make_number (0), thislen, this,
				make_number (toindex), val, Qnil);
	}

Jim Blandy's avatar
Jim Blandy committed
420 421 422 423
      while (1)
	{
	  register Lisp_Object elt;

424 425
	  /* Fetch next element of `this' arg into `elt', or break if
             `this' is exhausted. */
Jim Blandy's avatar
Jim Blandy committed
426
	  if (NILP (this)) break;
Jim Blandy's avatar
Jim Blandy committed
427 428 429 430 431
	  if (CONSP (this))
	    elt = Fcar (this), this = Fcdr (this);
	  else
	    {
	      if (thisindex >= thisleni) break;
432
	      if (STRINGP (this))
433
		XSETFASTINT (elt, XSTRING (this)->data[thisindex++]);
434 435 436
	      else if (BOOL_VECTOR_P (this))
		{
		  int size_in_chars
437 438
		    = ((XBOOL_VECTOR (this)->size + BITS_PER_CHAR)
		       / BITS_PER_CHAR);
439
		  int byte;
440
		  byte = XBOOL_VECTOR (val)->data[thisindex / BITS_PER_CHAR];
441 442 443 444 445
		  if (byte & (1 << thisindex))
		    elt = Qt;
		  else
		    elt = Qnil;
		}
Jim Blandy's avatar
Jim Blandy committed
446 447 448 449 450 451 452 453 454 455 456
	      else
		elt = XVECTOR (this)->contents[thisindex++];
	    }

	  /* Store into result */
	  if (toindex < 0)
	    {
	      XCONS (tail)->car = elt;
	      prev = tail;
	      tail = XCONS (tail)->cdr;
	    }
457
	  else if (VECTORP (val))
Jim Blandy's avatar
Jim Blandy committed
458 459 460
	    XVECTOR (val)->contents[toindex++] = elt;
	  else
	    {
461
	      while (!INTEGERP (elt))
Jim Blandy's avatar
Jim Blandy committed
462 463 464 465 466 467 468 469 470 471 472 473 474 475
		elt = wrong_type_argument (Qintegerp, elt);
	      {
#ifdef MASSC_REGISTER_BUG
		/* Even removing all "register"s doesn't disable this bug!
		   Nothing simpler than this seems to work. */
		unsigned char *p = & XSTRING (val)->data[toindex++];
		*p = XINT (elt);
#else
		XSTRING (val)->data[toindex++] = XINT (elt);
#endif
	      }
	    }
	}
    }
Jim Blandy's avatar
Jim Blandy committed
476
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
    XCONS (prev)->cdr = last_tail;

  return val;  
}

DEFUN ("copy-alist", Fcopy_alist, Scopy_alist, 1, 1, 0,
  "Return a copy of ALIST.\n\
This is an alist which represents the same mapping from objects to objects,\n\
but does not share the alist structure with ALIST.\n\
The objects mapped (cars and cdrs of elements of the alist)\n\
are shared, however.\n\
Elements of ALIST that are not conses are also shared.")
  (alist)
     Lisp_Object alist;
{
  register Lisp_Object tem;

  CHECK_LIST (alist, 0);
Jim Blandy's avatar
Jim Blandy committed
495
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511
    return alist;
  alist = concat (1, &alist, Lisp_Cons, 0);
  for (tem = alist; CONSP (tem); tem = XCONS (tem)->cdr)
    {
      register Lisp_Object car;
      car = XCONS (tem)->car;

      if (CONSP (car))
	XCONS (tem)->car = Fcons (XCONS (car)->car, XCONS (car)->cdr);
    }
  return alist;
}

DEFUN ("substring", Fsubstring, Ssubstring, 2, 3, 0,
  "Return a substring of STRING, starting at index FROM and ending before TO.\n\
TO may be nil or omitted; then the substring runs to the end of STRING.\n\
512 513 514
If FROM or TO is negative, it counts from the end.\n\
\n\
This function allows vectors as well as strings.")
Jim Blandy's avatar
Jim Blandy committed
515 516 517 518
  (string, from, to)
     Lisp_Object string;
     register Lisp_Object from, to;
{
519
  Lisp_Object res;
520 521 522 523
  int size;

  if (! (STRINGP (string) || VECTORP (string)))
    wrong_type_argument (Qarrayp, string);
524

Jim Blandy's avatar
Jim Blandy committed
525
  CHECK_NUMBER (from, 1);
526 527 528 529 530 531

  if (STRINGP (string))
    size = XSTRING (string)->size;
  else
    size = XVECTOR (string)->size;

Jim Blandy's avatar
Jim Blandy committed
532
  if (NILP (to))
533
    to = size;
Jim Blandy's avatar
Jim Blandy committed
534 535 536 537
  else
    CHECK_NUMBER (to, 2);

  if (XINT (from) < 0)
538
    XSETINT (from, XINT (from) + size);
Jim Blandy's avatar
Jim Blandy committed
539
  if (XINT (to) < 0)
540
    XSETINT (to, XINT (to) + size);
Jim Blandy's avatar
Jim Blandy committed
541
  if (!(0 <= XINT (from) && XINT (from) <= XINT (to)
542
        && XINT (to) <= size))
Jim Blandy's avatar
Jim Blandy committed
543 544
    args_out_of_range_3 (string, from, to);

545 546 547 548 549 550 551 552 553 554
  if (STRINGP (string))
    {
      res = make_string (XSTRING (string)->data + XINT (from),
			 XINT (to) - XINT (from));
      copy_text_properties (from, to, string, make_number (0), res, Qnil);
    }
  else
    res = Fvector (XINT (to) - XINT (from),
		   XVECTOR (string)->contents + XINT (from));
		   
555
  return res;
Jim Blandy's avatar
Jim Blandy committed
556 557 558 559 560 561 562 563 564 565 566
}

DEFUN ("nthcdr", Fnthcdr, Snthcdr, 2, 2, 0,
  "Take cdr N times on LIST, returns the result.")
  (n, list)
     Lisp_Object n;
     register Lisp_Object list;
{
  register int i, num;
  CHECK_NUMBER (n, 0);
  num = XINT (n);
Jim Blandy's avatar
Jim Blandy committed
567
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
    {
      QUIT;
      list = Fcdr (list);
    }
  return list;
}

DEFUN ("nth", Fnth, Snth, 2, 2, 0,
  "Return the Nth element of LIST.\n\
N counts from zero.  If LIST is not that long, nil is returned.")
  (n, list)
     Lisp_Object n, list;
{
  return Fcar (Fnthcdr (n, list));
}

DEFUN ("elt", Felt, Selt, 2, 2, 0,
  "Return element of SEQUENCE at index N.")
586 587
  (sequence, n)
     register Lisp_Object sequence, n;
Jim Blandy's avatar
Jim Blandy committed
588 589 590 591
{
  CHECK_NUMBER (n, 0);
  while (1)
    {
592 593 594 595 596
      if (CONSP (sequence) || NILP (sequence))
	return Fcar (Fnthcdr (n, sequence));
      else if (STRINGP (sequence) || VECTORP (sequence)
	       || BOOL_VECTOR_P (sequence) || CHAR_TABLE_P (sequence))
	return Faref (sequence, n);
Jim Blandy's avatar
Jim Blandy committed
597
      else
598
	sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
599 600 601 602
    }
}

DEFUN ("member", Fmember, Smember, 2, 2, 0,
Richard M. Stallman's avatar
Richard M. Stallman committed
603
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
604 605 606 607 608 609
The value is actually the tail of LIST whose car is ELT.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
610
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
611 612 613
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
614
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
615 616 617 618 619 620 621 622 623 624 625 626 627 628
	return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("memq", Fmemq, Smemq, 2, 2, 0,
  "Return non-nil if ELT is an element of LIST.  Comparison done with EQ.\n\
The value is actually the tail of LIST whose car is ELT.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
629
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
630 631 632 633 634 635 636 637 638 639
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
640 641
  "Return non-nil if KEY is `eq' to the car of an element of LIST.\n\
The value is actually the element of LIST whose car is KEY.\n\
Jim Blandy's avatar
Jim Blandy committed
642 643 644 645 646 647
Elements of LIST that are not conses are ignored.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
648
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcar (elt);
      if (EQ (key, tem)) return elt;
      QUIT;
    }
  return Qnil;
}

/* Like Fassq but never report an error and do not allow quits.
   Use only on lists known never to be circular.  */

Lisp_Object
assq_no_quit (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
  for (tail = list; CONSP (tail); tail = Fcdr (tail))
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcar (elt);
      if (EQ (key, tem)) return elt;
    }
  return Qnil;
}

DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0,
681
  "Return non-nil if KEY is `equal' to the car of an element of LIST.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
682
The value is actually the element of LIST whose car equals KEY.")
Jim Blandy's avatar
Jim Blandy committed
683 684 685 686 687
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
688
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
689 690 691 692 693
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcar (elt), key);
Jim Blandy's avatar
Jim Blandy committed
694
      if (!NILP (tem)) return elt;
Jim Blandy's avatar
Jim Blandy committed
695 696 697 698 699 700 701 702 703 704 705 706 707
      QUIT;
    }
  return Qnil;
}

DEFUN ("rassq", Frassq, Srassq, 2, 2, 0,
  "Return non-nil if ELT is `eq' to the cdr of an element of LIST.\n\
The value is actually the element of LIST whose cdr is ELT.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
708
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
709 710 711 712 713 714 715 716 717 718
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fcdr (elt);
      if (EQ (key, tem)) return elt;
      QUIT;
    }
  return Qnil;
}
Richard M. Stallman's avatar
Richard M. Stallman committed
719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738

DEFUN ("rassoc", Frassoc, Srassoc, 2, 2, 0,
  "Return non-nil if KEY is `equal' to the cdr of an element of LIST.\n\
The value is actually the element of LIST whose cdr equals KEY.")
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcdr (elt), key);
      if (!NILP (tem)) return elt;
      QUIT;
    }
  return Qnil;
}
Jim Blandy's avatar
Jim Blandy committed
739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754

DEFUN ("delq", Fdelq, Sdelq, 2, 2, 0,
  "Delete by side effect any occurrences of ELT as a member of LIST.\n\
The modified LIST is returned.  Comparison is done with `eq'.\n\
If the first member of LIST is ELT, there is no way to remove it by side effect;\n\
therefore, write `(setq foo (delq element foo))'\n\
to be sure of changing the value of `foo'.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail, prev;
  register Lisp_Object tem;

  tail = list;
  prev = Qnil;
Jim Blandy's avatar
Jim Blandy committed
755
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
756 757 758 759
    {
      tem = Fcar (tail);
      if (EQ (elt, tem))
	{
Jim Blandy's avatar
Jim Blandy committed
760
	  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
761 762 763 764 765 766 767 768 769 770 771 772
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
773
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
Roland McGrath's avatar
Roland McGrath committed
774 775
  "Delete by side effect any occurrences of ELT as a member of LIST.\n\
The modified LIST is returned.  Comparison is done with `equal'.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
776 777 778
If the first member of LIST is ELT, deleting it is not a side effect;\n\
it is simply using a different list.\n\
Therefore, write `(setq foo (delete element foo))'\n\
Roland McGrath's avatar
Roland McGrath committed
779 780 781 782 783 784 785 786 787 788
to be sure of changing the value of `foo'.")
  (elt, list)
     register Lisp_Object elt;
     Lisp_Object list;
{
  register Lisp_Object tail, prev;
  register Lisp_Object tem;

  tail = list;
  prev = Qnil;
Jim Blandy's avatar
Jim Blandy committed
789
  while (!NILP (tail))
Roland McGrath's avatar
Roland McGrath committed
790 791
    {
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
792
      if (! NILP (Fequal (elt, tem)))
Roland McGrath's avatar
Roland McGrath committed
793
	{
Jim Blandy's avatar
Jim Blandy committed
794
	  if (NILP (prev))
Roland McGrath's avatar
Roland McGrath committed
795 796 797 798 799 800 801 802 803 804 805 806
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
807 808 809 810 811 812 813 814
DEFUN ("nreverse", Fnreverse, Snreverse, 1, 1, 0,
  "Reverse LIST by modifying cdr pointers.\n\
Returns the beginning of the reversed list.")
  (list)
     Lisp_Object list;
{
  register Lisp_Object prev, tail, next;

Jim Blandy's avatar
Jim Blandy committed
815
  if (NILP (list)) return list;
Jim Blandy's avatar
Jim Blandy committed
816 817
  prev = Qnil;
  tail = list;
Jim Blandy's avatar
Jim Blandy committed
818
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854
    {
      QUIT;
      next = Fcdr (tail);
      Fsetcdr (tail, prev);
      prev = tail;
      tail = next;
    }
  return prev;
}

DEFUN ("reverse", Freverse, Sreverse, 1, 1, 0,
  "Reverse LIST, copying.  Returns the beginning of the reversed list.\n\
See also the function `nreverse', which is used more often.")
  (list)
     Lisp_Object list;
{
  Lisp_Object length;
  register Lisp_Object *vec;
  register Lisp_Object tail;
  register int i;

  length = Flength (list);
  vec = (Lisp_Object *) alloca (XINT (length) * sizeof (Lisp_Object));
  for (i = XINT (length) - 1, tail = list; i >= 0; i--, tail = Fcdr (tail))
    vec[i] = Fcar (tail);

  return Flist (XINT (length), vec);
}

Lisp_Object merge ();

DEFUN ("sort", Fsort, Ssort, 2, 2, 0,
  "Sort LIST, stably, comparing elements using PREDICATE.\n\
Returns the sorted list.  LIST is modified by side effects.\n\
PREDICATE is called with two elements of LIST, and should return T\n\
if the first element is \"less\" than the second.")
855 856
  (list, predicate)
     Lisp_Object list, predicate;
Jim Blandy's avatar
Jim Blandy committed
857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874
{
  Lisp_Object front, back;
  register Lisp_Object len, tem;
  struct gcpro gcpro1, gcpro2;
  register int length;

  front = list;
  len = Flength (list);
  length = XINT (len);
  if (length < 2)
    return list;

  XSETINT (len, (length / 2) - 1);
  tem = Fnthcdr (len, list);
  back = Fcdr (tem);
  Fsetcdr (tem, Qnil);

  GCPRO2 (front, back);
875 876
  front = Fsort (front, predicate);
  back = Fsort (back, predicate);
Jim Blandy's avatar
Jim Blandy committed
877
  UNGCPRO;
878
  return merge (front, back, predicate);
Jim Blandy's avatar
Jim Blandy committed
879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903
}

Lisp_Object
merge (org_l1, org_l2, pred)
     Lisp_Object org_l1, org_l2;
     Lisp_Object pred;
{
  Lisp_Object value;
  register Lisp_Object tail;
  Lisp_Object tem;
  register Lisp_Object l1, l2;
  struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;

  l1 = org_l1;
  l2 = org_l2;
  tail = Qnil;
  value = Qnil;

  /* It is sufficient to protect org_l1 and org_l2.
     When l1 and l2 are updated, we copy the new values
     back into the org_ vars.  */
  GCPRO4 (org_l1, org_l2, pred, value);

  while (1)
    {
Jim Blandy's avatar
Jim Blandy committed
904
      if (NILP (l1))
Jim Blandy's avatar
Jim Blandy committed
905 906
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
907
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
908 909 910 911
	    return l2;
	  Fsetcdr (tail, l2);
	  return value;
	}
Jim Blandy's avatar
Jim Blandy committed
912
      if (NILP (l2))
Jim Blandy's avatar
Jim Blandy committed
913 914
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
915
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
916 917 918 919 920
	    return l1;
	  Fsetcdr (tail, l1);
	  return value;
	}
      tem = call2 (pred, Fcar (l2), Fcar (l1));
Jim Blandy's avatar
Jim Blandy committed
921
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
922 923 924 925 926 927 928 929 930 931 932
	{
	  tem = l1;
	  l1 = Fcdr (l1);
	  org_l1 = l1;
	}
      else
	{
	  tem = l2;
	  l2 = Fcdr (l2);
	  org_l2 = l2;
	}
Jim Blandy's avatar
Jim Blandy committed
933
      if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
934 935 936 937 938 939 940
	value = tem;
      else
	Fsetcdr (tail, tem);
      tail = tem;
    }
}

941 942

DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0,
943
  "Extract a value from a property list.\n\
944
PLIST is a property list, which is a list of the form\n\
945
\(PROP1 VALUE1 PROP2 VALUE2...).  This function returns the value\n\
946 947
corresponding to the given PROP, or nil if PROP is not\n\
one of the properties on the list.")
948 949
  (plist, prop)
     Lisp_Object plist;
Jim Blandy's avatar
Jim Blandy committed
950 951 952
     register Lisp_Object prop;
{
  register Lisp_Object tail;
953
  for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
954 955 956 957 958 959 960 961 962
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
    }
  return Qnil;
}

963 964
DEFUN ("get", Fget, Sget, 2, 2, 0,
  "Return the value of SYMBOL's PROPNAME property.\n\
965 966 967
This is the last value stored with `(put SYMBOL PROPNAME VALUE)'.")
  (symbol, propname)
     Lisp_Object symbol, propname;
968
{
969 970
  CHECK_SYMBOL (symbol, 0);
  return Fplist_get (XSYMBOL (symbol)->plist, propname);
971 972 973 974 975
}

DEFUN ("plist-put", Fplist_put, Splist_put, 3, 3, 0,
  "Change value in PLIST of PROP to VAL.\n\
PLIST is a property list, which is a list of the form\n\
976
\(PROP1 VALUE1 PROP2 VALUE2 ...).  PROP is a symbol and VAL is any object.\n\
977
If PROP is already a property on the list, its value is set to VAL,\n\
Karl Heuer's avatar
Karl Heuer committed
978
otherwise the new PROP VAL pair is added.  The new plist is returned;\n\
979 980 981 982 983 984
use `(setq x (plist-put x prop val))' to be sure to use the new value.\n\
The PLIST is modified by side effects.")
  (plist, prop, val)
    Lisp_Object plist;
    register Lisp_Object prop;
    Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
985 986 987 988
{
  register Lisp_Object tail, prev;
  Lisp_Object newcell;
  prev = Qnil;
989 990
  for (tail = plist; CONSP (tail) && CONSP (XCONS (tail)->cdr);
       tail = XCONS (XCONS (tail)->cdr)->cdr)
Jim Blandy's avatar
Jim Blandy committed
991
    {
992
      if (EQ (prop, XCONS (tail)->car))
993
	{
994
	  Fsetcar (XCONS (tail)->cdr, val);
995 996
	  return plist;
	}
Jim Blandy's avatar
Jim Blandy committed
997 998 999
      prev = tail;
    }
  newcell = Fcons (prop, Fcons (val, Qnil));
Jim Blandy's avatar
Jim Blandy committed
1000
  if (NILP (prev))
1001
    return newcell;
Jim Blandy's avatar
Jim Blandy committed
1002
  else
1003
    Fsetcdr (XCONS (prev)->cdr, newcell);
1004 1005 1006 1007 1008 1009
  return plist;
}

DEFUN ("put", Fput, Sput, 3, 3, 0,
  "Store SYMBOL's PROPNAME property with value VALUE.\n\
It can be retrieved with `(get SYMBOL PROPNAME)'.")
1010 1011
  (symbol, propname, value)
     Lisp_Object symbol, propname, value;
1012
{
1013 1014 1015 1016
  CHECK_SYMBOL (symbol, 0);
  XSYMBOL (symbol)->plist
    = Fplist_put (XSYMBOL (symbol)->plist, propname, value);
  return value;
Jim Blandy's avatar
Jim Blandy committed
1017 1018 1019 1020 1021 1022 1023
}

DEFUN ("equal", Fequal, Sequal, 2, 2, 0,
  "T if two Lisp objects have similar structure and contents.\n\
They must have the same data type.\n\
Conses are compared by comparing the cars and the cdrs.\n\
Vectors and strings are compared element by element.\n\
1024 1025 1026
Numbers are compared by value, but integers cannot equal floats.\n\
 (Use `=' if you want integers and floats to be able to be equal.)\n\
Symbols must match exactly.")
Jim Blandy's avatar
Jim Blandy committed
1027 1028 1029
  (o1, o2)
     register Lisp_Object o1, o2;
{
1030
  return internal_equal (o1, o2, 0) ? Qt : Qnil;
1031 1032
}

1033
static int
1034 1035 1036 1037 1038 1039
internal_equal (o1, o2, depth)
     register Lisp_Object o1, o2;
     int depth;
{
  if (depth > 200)
    error ("Stack overflow in equal");
1040

1041
 tail_recurse:
Jim Blandy's avatar
Jim Blandy committed
1042
  QUIT;
1043 1044 1045 1046 1047 1048 1049
  if (EQ (o1, o2))
    return 1;
  if (XTYPE (o1) != XTYPE (o2))
    return 0;

  switch (XTYPE (o1))
    {
1050
#ifdef LISP_FLOAT_TYPE
1051 1052
    case Lisp_Float:
      return (extract_float (o1) == extract_float (o2));
1053
#endif
1054 1055

    case Lisp_Cons:
1056 1057 1058 1059 1060
      if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1))
	return 0;
      o1 = XCONS (o1)->cdr;
      o2 = XCONS (o2)->cdr;
      goto tail_recurse;
1061 1062

    case Lisp_Misc:
1063
      if (XMISCTYPE (o1) != XMISCTYPE (o2))
1064
	return 0;
1065
      if (OVERLAYP (o1))
Jim Blandy's avatar
Jim Blandy committed
1066
	{
1067 1068 1069 1070
	  if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1),
			       depth + 1)
	      || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1),
				  depth + 1))
1071
	    return 0;
1072 1073 1074
	  o1 = XOVERLAY (o1)->plist;
	  o2 = XOVERLAY (o2)->plist;
	  goto tail_recurse;
Jim Blandy's avatar
Jim Blandy committed
1075
	}
1076 1077 1078 1079 1080 1081 1082 1083 1084
      if (MARKERP (o1))
	{
	  return (XMARKER (o1)->buffer == XMARKER (o2)->buffer
		  && (XMARKER (o1)->buffer == 0
		      || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos));
	}
      break;

    case Lisp_Vectorlike:
1085 1086 1087 1088 1089 1090 1091 1092
      {
	register int i, size;
	size = XVECTOR (o1)->size;
	/* Pseudovectors have the type encoded in the size field, so this test
	   actually checks that the objects have the same type as well as the
	   same size.  */
	if (XVECTOR (o2)->size != size)
	  return 0;
1093 1094 1095 1096
	/* Boolvectors are compared much like strings.  */
	if (BOOL_VECTOR_P (o1))
	  {
	    int size_in_chars
1097
	      = (XBOOL_VECTOR (o1)->size + BITS_PER_CHAR) / BITS_PER_CHAR;
1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108

	    if (XBOOL_VECTOR (o1)->size != XBOOL_VECTOR (o2)->size)
	      return 0;
	    if (bcmp (XBOOL_VECTOR (o1)->data, XBOOL_VECTOR (o2)->data,
		      size_in_chars))
	      return 0;
	    return 1;
	  }

	/* Aside from them, only true vectors, char-tables, and compiled
	   functions are sensible to compare, so eliminate the others now.  */
1109 1110
	if (size & PSEUDOVECTOR_FLAG)
	  {
1111
	    if (!(size & (PVEC_COMPILED | PVEC_CHAR_TABLE)))
1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
	      return 0;
	    size &= PSEUDOVECTOR_SIZE_MASK;
	  }
	for (i = 0; i < size; i++)
	  {
	    Lisp_Object v1, v2;
	    v1 = XVECTOR (o1)->contents [i];
	    v2 = XVECTOR (o2)->contents [i];
	    if (!internal_equal (v1, v2, depth + 1))
	      return 0;
	  }
	return 1;
      }
1125 1126 1127
      break;

    case Lisp_String:
1128 1129 1130 1131 1132
      if (XSTRING (o1)->size != XSTRING (o2)->size)
	return 0;
      if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data,
		XSTRING (o1)->size))
	return 0;
1133
#ifdef USE_TEXT_PROPERTIES
1134 1135 1136 1137 1138
      /* If the strings have intervals, verify they match;
	 if not, they are unequal.  */
      if ((XSTRING (o1)->intervals != 0 || XSTRING (o2)->intervals != 0)
	  && ! compare_string_intervals (o1, o2))
	return 0;
1139
#endif
1140
      return 1;
Jim Blandy's avatar
Jim Blandy committed
1141
    }
1142
  return 0;
Jim Blandy's avatar
Jim Blandy committed
1143 1144 1145
}

DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0,
1146 1147
  "Store each element of ARRAY with ITEM.\n\
ARRAY is a vector, string, char-table, or bool-vector.")
Jim Blandy's avatar
Jim Blandy committed
1148 1149 1150 1151 1152
  (array, item)
     Lisp_Object array, item;
{
  register int size, index, charval;
 retry:
1153
  if (VECTORP (array))
Jim Blandy's avatar
Jim Blandy committed
1154 1155 1156 1157 1158 1159
    {
      register Lisp_Object *p = XVECTOR (array)->contents;
      size = XVECTOR (array)->size;
      for (index = 0; index < size; index++)
	p[index] = item;
    }
1160 1161 1162 1163 1164 1165 1166 1167
  else if (CHAR_TABLE_P (array))
    {
      register Lisp_Object *p = XCHAR_TABLE (array)->contents;
      size = CHAR_TABLE_ORDINARY_SLOTS;
      for (index = 0; index < size; index++)
	p[index] = item;
      XCHAR_TABLE (array)->defalt = Qnil;
    }
1168
  else if (STRINGP (array))
Jim Blandy's avatar
Jim Blandy committed
1169 1170 1171 1172 1173 1174 1175 1176
    {
      register unsigned char *p = XSTRING (array)->data;
      CHECK_NUMBER (item, 1);
      charval = XINT (item);
      size = XSTRING (array)->size;
      for (index = 0; index < size; index++)
	p[index] = charval;
    }
1177 1178 1179 1180
  else if (BOOL_VECTOR_P (array))
    {
      register unsigned char *p = XBOOL_VECTOR (array)->data;
      int size_in_chars