fns.c 48.7 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 18 19 20
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
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */


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

/* 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
32
#include "keyboard.h"
33
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
34

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

39 40
extern Lisp_Object Flookup_key ();

41
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
42
Lisp_Object Qyes_or_no_p_history;
Jim Blandy's avatar
Jim Blandy committed
43

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

54 55 56 57
extern long get_random ();
extern void seed_random ();
extern long time ();

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

71
  if (EQ (limit, Qt))
72
    seed_random (getpid () + time (NULL));
73
  if (NATNUMP (limit) && XFASTINT (limit) != 0)
Jim Blandy's avatar
Jim Blandy committed
74
    {
75 76 77 78 79 80 81 82 83
      /* 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
	 it's possible to get a quotient larger than limit; discarding
	 these values eliminates the bias that would otherwise appear
	 when using a large limit.  */
      denominator = ((unsigned long)1 << VALBITS) / XFASTINT (limit);
      do
84
	val = get_random () / denominator;
85
      while (val >= XFASTINT (limit));
Jim Blandy's avatar
Jim Blandy committed
86
    }
87
  else
88
    val = get_random ();
89 90
  XSETINT (lispy_val, val);
  return lispy_val;
Jim Blandy's avatar
Jim Blandy committed
91 92 93 94 95 96 97 98 99 100 101 102 103 104
}

/* 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.")
  (obj)
     register Lisp_Object obj;
{
  register Lisp_Object tail, val;
  register int i;

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

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

135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
/* 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)
154
	break;
155
      len++;
156
      if ((len & 1) == 0)
157 158 159 160 161 162 163
	halftail = XCONS (halftail)->cdr;
    }

  XSETINT (length, len);
  return length;
}

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

195
  if (SYMBOLP (s1))
196
    XSETSTRING (s1, XSYMBOL (s1)->name);
197
  if (SYMBOLP (s2))
198
    XSETSTRING (s2, XSYMBOL (s2)->name);
Jim Blandy's avatar
Jim Blandy committed
199 200 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
  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
233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248
/* 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
249 250 251 252
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
253
The last argument is not copied, just used as the tail of the new list.")
Jim Blandy's avatar
Jim Blandy committed
254 255 256 257 258 259 260 261 262 263
  (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\
264 265 266 267 268 269
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
270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
  (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;
{
285
  return concat (nargs, args, Lisp_Vectorlike, 0);
Jim Blandy's avatar
Jim Blandy committed
286 287 288 289 290 291 292 293 294
}

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
295
  if (NILP (arg)) return arg;
296 297 298 299 300 301 302 303

  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));
304
      copy = Fmake_char_table (XCHAR_TABLE (arg)->purpose, Qnil);
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321
      /* 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
322
	= (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR) / BITS_PER_CHAR;
323 324 325 326 327 328 329

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

330
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
331 332 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
    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];
364
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
365
	    || COMPILEDP (this) || BOOL_VECTOR_P (this)))
Jim Blandy's avatar
Jim Blandy committed
366
	{
367
	  if (INTEGERP (this))
368
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
369 370 371 372 373 374 375 376 377 378 379 380
	  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);
    }

381
  XSETFASTINT (len, leni);
Jim Blandy's avatar
Jim Blandy committed
382 383 384

  if (target_type == Lisp_Cons)
    val = Fmake_list (len, Qnil);
385
  else if (target_type == Lisp_Vectorlike)
Jim Blandy's avatar
Jim Blandy committed
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410
    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);

411
      if (STRINGP (this) && STRINGP (val)
412 413 414 415 416 417
	  && ! 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
418 419 420 421
      while (1)
	{
	  register Lisp_Object elt;

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

	  /* Store into result */
	  if (toindex < 0)
	    {
	      XCONS (tail)->car = elt;
	      prev = tail;
	      tail = XCONS (tail)->cdr;
	    }
455
	  else if (VECTORP (val))
Jim Blandy's avatar
Jim Blandy committed
456 457 458
	    XVECTOR (val)->contents[toindex++] = elt;
	  else
	    {
459
	      while (!INTEGERP (elt))
Jim Blandy's avatar
Jim Blandy committed
460 461 462 463 464 465 466 467 468 469 470 471 472 473
		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
474
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492
    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
493
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514
    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\
If FROM or TO is negative, it counts from the end.")
  (string, from, to)
     Lisp_Object string;
     register Lisp_Object from, to;
{
515 516
  Lisp_Object res;

Jim Blandy's avatar
Jim Blandy committed
517 518
  CHECK_STRING (string, 0);
  CHECK_NUMBER (from, 1);
Jim Blandy's avatar
Jim Blandy committed
519
  if (NILP (to))
Jim Blandy's avatar
Jim Blandy committed
520 521 522 523 524 525 526 527 528 529 530 531
    to = Flength (string);
  else
    CHECK_NUMBER (to, 2);

  if (XINT (from) < 0)
    XSETINT (from, XINT (from) + XSTRING (string)->size);
  if (XINT (to) < 0)
    XSETINT (to, XINT (to) + XSTRING (string)->size);
  if (!(0 <= XINT (from) && XINT (from) <= XINT (to)
        && XINT (to) <= XSTRING (string)->size))
    args_out_of_range_3 (string, from, to);

532 533 534 535
  res = make_string (XSTRING (string)->data + XINT (from),
		     XINT (to) - XINT (from));
  copy_text_properties (from, to, string, make_number (0), res, Qnil);
  return res;
Jim Blandy's avatar
Jim Blandy committed
536 537 538 539 540 541 542 543 544 545 546
}

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
547
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
    {
      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.")
  (seq, n)
     register Lisp_Object seq, n;
{
  CHECK_NUMBER (n, 0);
  while (1)
    {
572
      if (CONSP (seq) || NILP (seq))
Jim Blandy's avatar
Jim Blandy committed
573
	return Fcar (Fnthcdr (n, seq));
574 575
      else if (STRINGP (seq) || VECTORP (seq) || BOOL_VECTOR_P (seq)
	       || CHAR_TABLE_P (seq))
Jim Blandy's avatar
Jim Blandy committed
576 577 578 579 580 581 582
	return Faref (seq, n);
      else
	seq = wrong_type_argument (Qsequencep, seq);
    }
}

DEFUN ("member", Fmember, Smember, 2, 2, 0,
Richard M. Stallman's avatar
Richard M. Stallman committed
583
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
584 585 586 587 588 589
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
590
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
591 592 593
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
594
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
595 596 597 598 599 600 601 602 603 604 605 606 607 608
	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
609
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
610 611 612 613 614 615 616 617 618 619
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
620 621
  "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
622 623 624 625 626 627
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
628
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
    {
      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,
661
  "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
662
The value is actually the element of LIST whose car equals KEY.")
Jim Blandy's avatar
Jim Blandy committed
663 664 665 666 667
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
668
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
669 670 671 672 673
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcar (elt), key);
Jim Blandy's avatar
Jim Blandy committed
674
      if (!NILP (tem)) return elt;
Jim Blandy's avatar
Jim Blandy committed
675 676 677 678 679 680 681 682 683 684 685 686 687
      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
688
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
689 690 691 692 693 694 695 696 697 698
    {
      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
699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718

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
719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734

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
735
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
736 737 738 739
    {
      tem = Fcar (tail);
      if (EQ (elt, tem))
	{
Jim Blandy's avatar
Jim Blandy committed
740
	  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
741 742 743 744 745 746 747 748 749 750 751 752
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
753
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
Roland McGrath's avatar
Roland McGrath committed
754 755
  "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
756 757 758
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
759 760 761 762 763 764 765 766 767 768
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
769
  while (!NILP (tail))
Roland McGrath's avatar
Roland McGrath committed
770 771
    {
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
772
      if (! NILP (Fequal (elt, tem)))
Roland McGrath's avatar
Roland McGrath committed
773
	{
Jim Blandy's avatar
Jim Blandy committed
774
	  if (NILP (prev))
Roland McGrath's avatar
Roland McGrath committed
775 776 777 778 779 780 781 782 783 784 785 786
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
787 788 789 790 791 792 793 794
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
795
  if (NILP (list)) return list;
Jim Blandy's avatar
Jim Blandy committed
796 797
  prev = Qnil;
  tail = list;
Jim Blandy's avatar
Jim Blandy committed
798
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 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 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883
    {
      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.")
  (list, pred)
     Lisp_Object list, pred;
{
  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);
  front = Fsort (front, pred);
  back = Fsort (back, pred);
  UNGCPRO;
  return merge (front, back, pred);
}

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
884
      if (NILP (l1))
Jim Blandy's avatar
Jim Blandy committed
885 886
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
887
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
888 889 890 891
	    return l2;
	  Fsetcdr (tail, l2);
	  return value;
	}
Jim Blandy's avatar
Jim Blandy committed
892
      if (NILP (l2))
Jim Blandy's avatar
Jim Blandy committed
893 894
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
895
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
896 897 898 899 900
	    return l1;
	  Fsetcdr (tail, l1);
	  return value;
	}
      tem = call2 (pred, Fcar (l2), Fcar (l1));
Jim Blandy's avatar
Jim Blandy committed
901
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
902 903 904 905 906 907 908 909 910 911 912
	{
	  tem = l1;
	  l1 = Fcdr (l1);
	  org_l1 = l1;
	}
      else
	{
	  tem = l2;
	  l2 = Fcdr (l2);
	  org_l2 = l2;
	}
Jim Blandy's avatar
Jim Blandy committed
913
      if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
914 915 916 917 918 919 920
	value = tem;
      else
	Fsetcdr (tail, tem);
      tail = tem;
    }
}

921 922

DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0,
923
  "Extract a value from a property list.\n\
924
PLIST is a property list, which is a list of the form\n\
925
\(PROP1 VALUE1 PROP2 VALUE2...).  This function returns the value\n\
926 927
corresponding to the given PROP, or nil if PROP is not\n\
one of the properties on the list.")
928 929
  (plist, prop)
     Lisp_Object plist;
Jim Blandy's avatar
Jim Blandy committed
930 931 932
     register Lisp_Object prop;
{
  register Lisp_Object tail;
933
  for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
934 935 936 937 938 939 940 941 942
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
    }
  return Qnil;
}

943 944
DEFUN ("get", Fget, Sget, 2, 2, 0,
  "Return the value of SYMBOL's PROPNAME property.\n\
945 946 947
This is the last value stored with `(put SYMBOL PROPNAME VALUE)'.")
  (symbol, propname)
     Lisp_Object symbol, propname;
948
{
949 950
  CHECK_SYMBOL (symbol, 0);
  return Fplist_get (XSYMBOL (symbol)->plist, propname);
951 952 953 954 955
}

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\
956
\(PROP1 VALUE1 PROP2 VALUE2 ...).  PROP is a symbol and VAL is any object.\n\
957
If PROP is already a property on the list, its value is set to VAL,\n\
Karl Heuer's avatar
Karl Heuer committed
958
otherwise the new PROP VAL pair is added.  The new plist is returned;\n\
959 960 961 962 963 964
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
965 966 967 968
{
  register Lisp_Object tail, prev;
  Lisp_Object newcell;
  prev = Qnil;
969 970
  for (tail = plist; CONSP (tail) && CONSP (XCONS (tail)->cdr);
       tail = XCONS (XCONS (tail)->cdr)->cdr)
Jim Blandy's avatar
Jim Blandy committed
971
    {
972
      if (EQ (prop, XCONS (tail)->car))
973
	{
974
	  Fsetcar (XCONS (tail)->cdr, val);
975 976
	  return plist;
	}
Jim Blandy's avatar
Jim Blandy committed
977 978 979
      prev = tail;
    }
  newcell = Fcons (prop, Fcons (val, Qnil));
Jim Blandy's avatar
Jim Blandy committed
980
  if (NILP (prev))
981
    return newcell;
Jim Blandy's avatar
Jim Blandy committed
982
  else
983
    Fsetcdr (XCONS (prev)->cdr, newcell);
984 985 986 987 988 989
  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)'.")
990 991
  (symbol, propname, value)
     Lisp_Object symbol, propname, value;
992
{
993 994 995 996
  CHECK_SYMBOL (symbol, 0);
  XSYMBOL (symbol)->plist
    = Fplist_put (XSYMBOL (symbol)->plist, propname, value);
  return value;
Jim Blandy's avatar
Jim Blandy committed
997 998 999 1000 1001 1002 1003
}

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\
1004 1005 1006
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
1007 1008 1009
  (o1, o2)
     register Lisp_Object o1, o2;
{
1010
  return internal_equal (o1, o2, 0) ? Qt : Qnil;
1011 1012
}

1013
static int
1014 1015 1016 1017 1018 1019
internal_equal (o1, o2, depth)
     register Lisp_Object o1, o2;
     int depth;
{
  if (depth > 200)
    error ("Stack overflow in equal");
1020

1021
 tail_recurse:
Jim Blandy's avatar
Jim Blandy committed
1022
  QUIT;
1023 1024 1025 1026 1027 1028 1029
  if (EQ (o1, o2))
    return 1;
  if (XTYPE (o1) != XTYPE (o2))
    return 0;

  switch (XTYPE (o1))
    {
1030
#ifdef LISP_FLOAT_TYPE
1031 1032
    case Lisp_Float:
      return (extract_float (o1) == extract_float (o2));
1033
#endif
1034 1035

    case Lisp_Cons:
1036 1037 1038 1039 1040
      if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1))
	return 0;
      o1 = XCONS (o1)->cdr;
      o2 = XCONS (o2)->cdr;
      goto tail_recurse;
1041 1042

    case Lisp_Misc:
1043
      if (XMISCTYPE (o1) != XMISCTYPE (o2))
1044
	return 0;
1045
      if (OVERLAYP (o1))
Jim Blandy's avatar
Jim Blandy committed
1046
	{
1047 1048 1049 1050
	  if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1),
			       depth + 1)
	      || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1),
				  depth + 1))
1051
	    return 0;
1052 1053 1054
	  o1 = XOVERLAY (o1)->plist;
	  o2 = XOVERLAY (o2)->plist;
	  goto tail_recurse;
Jim Blandy's avatar
Jim Blandy committed
1055
	}
1056 1057 1058 1059 1060 1061 1062 1063 1064
      if (MARKERP (o1))
	{
	  return (XMARKER (o1)->buffer == XMARKER (o2)->buffer
		  && (XMARKER (o1)->buffer == 0
		      || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos));
	}
      break;

    case Lisp_Vectorlike:
1065 1066 1067 1068 1069 1070 1071 1072
      {
	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;
1073 1074 1075 1076
	/* Boolvectors are compared much like strings.  */
	if (BOOL_VECTOR_P (o1))
	  {
	    int size_in_chars
1077
	      = (XBOOL_VECTOR (o1)->size + BITS_PER_CHAR) / BITS_PER_CHAR;
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088

	    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.  */
1089 1090
	if (size & PSEUDOVECTOR_FLAG)
	  {
1091
	    if (!(size & (PVEC_COMPILED | PVEC_CHAR_TABLE)))
1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104
	      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;
      }
1105 1106 1107
      break;

    case Lisp_String:
1108 1109 1110 1111 1112
      if (XSTRING (o1)->size != XSTRING (o2)->size)
	return 0;
      if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data,
		XSTRING (o1)->size))
	return 0;
1113
#ifdef USE_TEXT_PROPERTIES
1114 1115 1116 1117 1118
      /* 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;
1119
#endif
1120
      return 1;
Jim Blandy's avatar
Jim Blandy committed
1121
    }
1122
  return 0;
Jim Blandy's avatar
Jim Blandy committed
1123 1124 1125
}

DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0,
1126 1127
  "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
1128 1129 1130 1131 1132
  (array, item)
     Lisp_Object array, item;
{
  register int size, index, charval;
 retry:
1133
  if (VECTORP (array))
Jim Blandy's avatar
Jim Blandy committed
1134 1135 1136 1137 1138 1139
    {
      register Lisp_Object *p = XVECTOR (array)->contents;
      size = XVECTOR (array)->size;
      for (index = 0; index < size; index++)
	p[index] = item;
    }
1140 1141 1142 1143 1144 1145 1146 1147
  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;
    }
1148
  else if (STRINGP (array))
Jim Blandy's avatar
Jim Blandy committed
1149 1150 1151 1152 1153 1154 1155 1156
    {
      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;
    }
1157 1158 1159 1160
  else if (BOOL_VECTOR_P (array))
    {
      register unsigned char *p = XBOOL_VECTOR (array)->data;
      int size_in_chars
1161
	= (XBOOL_VECTOR (array)->size + BITS_PER_CHAR) / BITS_PER_CHAR;
1162 1163 1164 1165 1166

      charval = (! NILP (item) ? -1 : 0);
      for (index = 0; index < size_in_chars; index++)
	p[index] = charval;
    }
Jim Blandy's avatar
Jim Blandy committed
1167 1168 1169 1170 1171 1172 1173 1174
  else
    {
      array = wrong_type_argument (Qarrayp, array);
      goto retry;
    }
  return array;
}

1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185
DEFUN ("char-table-subtype", Fchar_table_subtype, Schar_table_subtype,
       1, 1, 0,
  "Return the subtype of char-table CHAR-TABLE.   The value is a symbol.")
  (chartable)
     Lisp_Object chartable;
{
  CHECK_CHAR_TABLE (chartable, 0);  

  return XCHAR_TABLE (chartable)->purpose;
}

1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211
DEFUN ("char-table-parent", Fchar_table_parent, Schar_table_parent,
       1, 1, 0,
  "Return the parent char-table of CHAR-TABLE.\n\
The value is either nil or another char-table.\n\
If CHAR-TABLE holds nil for a given character,\n\
then the actual applicable value is inherited from the parent char-table\n\
\(or from its parents, if necessary).")
  (chartable)
     Lisp_Object chartable;
{
  CHECK_CHAR_TABLE (chartable, 0);  

  return XCHAR_TABLE (chartable)->parent;
}

DEFUN ("set-char-table-parent", Fset_char_table_parent, Sset_char_table_parent,
       2, 2, 0,
  "Set the parent char-table of CHAR-TABLE to PARENT.\n\
PARENT must be either nil or another char-table.")
  (chartable, parent)
     Lisp_Object chartable, parent;
{
  Lisp_Object temp;

  CHECK_CHAR_TABLE (chartable, 0);  

1212 1213 1214 1215 1216 1217 1218 1219
  if (!NILP (parent))
    {
      CHECK_CHAR_TABLE (parent, 0);  

      for (temp = parent; !NILP (temp); temp = XCHAR_TABLE (temp)->parent)
	if (EQ (temp, chartable))
	  error ("Attempt to make a chartable be its own parent");
    }
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256

  XCHAR_TABLE (chartable)->parent = parent;

  return parent;
}

DEFUN ("char-table-extra-slot", Fchar_table_extra_slot, Schar_table_extra_slot,
       2, 2, 0,
  "Return the value in extra-slot number N of char-table CHAR-TABLE.")
  (chartable, n)
     Lisp_Object chartable, n;
{
  CHECK_CHAR_TABLE (chartable, 1);
  CHECK_NUMBER (n, 2);
  if (XINT (n) < 0
      || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (chartable)))
    args_out_of_range (chartable, n);

  return XCHAR_TABLE (chartable)->extras[XINT (n)];
}

DEFUN ("set-char-table-extra-slot", Fset_char_table_extra_slot,
       Sset_char_table_extra_slot,
       3, 3, 0,
  "Set extra-slot number N of CHAR-TABLE to VALUE.")
  (chartable, n, value)
     Lisp_Object chartable, n, value;
{
  CHECK_CHAR_TABLE (chartable, 1);
  CHECK_NUMBER (n, 2);
  if (XINT (n) < 0
      || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (chartable)))
    args_out_of_range (chartable, n);

  return XCHAR_TABLE (chartable)->extras[XINT (n)] = value;
}

1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287
DEFUN ("char-table-range", Fchar_table_range, Schar_table_range,
       2, 2, 0,
  "Return the value in CHARTABLE for a range of characters RANGE.\n\
RANGE should be t (for all characters), nil (for the default value)\n\
a vector which identifies a character set or a row of a character set,\n\
or a character code.")
  (chartable, range)
     Lisp_Object chartable, range;
{
  int i;

  CHECK_CHAR_TABLE (chartable, 0);
  
  if (EQ (range, Qnil))
    return XCHAR_TABLE (chartable)->defalt;
  else if (INTEGERP (range))
    return Faref (chartable, range);
  else if (VECTORP (range))
    {
      for (i = 0; i < XVECTOR (range)->size - 1; i++)
	chartable = Faref (chartable, XVECTOR (range)->contents[i]);

      if (EQ (XVECTOR (range)->contents[i], Qnil))
	return XCHAR_TABLE (chartable)->defalt;
      else
	return Faref (chartable, XVECTOR (range)->contents[i]);
    }
  else
    error ("Invalid RANGE argument to `char-table-range'");
}

1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323
DEFUN ("set-char-table-range", Fset_char_table_range, Sset_char_table_range,
       3, 3, 0,
  "Set the value in CHARTABLE for a range of characters RANGE to VALUE.\n\
RANGE should be t (for all characters), nil (for the default value)\n\
a vector which identifies a character set or a row of a character set,\n\
or a character code.")
  (chartable, range, value)
     Lisp_Object chartable, range, value;
{
  int i;

  CHECK_CHAR_TABLE (chartable, 0);
  
  if (EQ (range, Qt))
    for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
      XCHAR_TABLE (chartable)->contents[i] = value;
  else if (EQ (range, Qnil))
    XCHAR_TABLE (chartable)->defalt = value;
  else if (INTEGERP (range))
    Faset (chartable, range, value);
  else if (VECTORP (range))
    {
      for (i = 0; i < XVECTOR (range)->size - 1; i++)
	chartable = Faref (chartable, XVECTOR (range)->contents[i]);

      if (EQ (XVECTOR (range)->contents[i], Qnil))
	XCHAR_TABLE (chartable)->defalt = value;
      else
	Faset (chartable, XVECTOR (range)->contents[i], value);
    }
  else
    error ("Invalid RANGE argument to `set-char-table-range'");

  return value;
}

1324 1325 1326 1327 1328 1329 1330 1331 1332
/* Map C_FUNCTION or FUNCTION over CHARTABLE, calling it for each
   character or group of characters that share a value.
   DEPTH is the current depth in the originally specified
   chartable, and INDICES contains the vector indices
   for the levels our callers have descended.  */

void
map_char_table (c_function, function, chartable, depth, indices)
     Lisp_Object (*c_function) (), function, chartable, depth, *indices;
1333 1334
{
  int i;
1335
  int size = CHAR_TABLE_ORDINARY_SLOTS;
1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350

  /* Make INDICES longer if we are about to fill it up.  */
  if ((depth % 10) == 9)
    {
      Lisp_Object *new_indices
	= (Lisp_Object *) alloca ((depth += 10) * sizeof (Lisp_Object));
      bcopy (indices, new_indices, depth * sizeof (Lisp_Object));
      indices = new_indices;
    }

  for (i = 0; i < size; i++)
    {
      Lisp_Object elt;
      indices[depth] = i;
      elt = XCHAR_TABLE (chartable)->contents[i];
1351 1352 1353 1354
      if (CHAR_TABLE_P (elt))
	map_char_table (chartable, c_function, function, depth + 1, indices);
      else if (c_function)
	(*c_function) (depth + 1, indices, elt);
1355 1356 1357 1358 1359
      /* Here we should handle all cases where the range is a single character
	 by passing that character as a number.  Currently, that is
	 all the time, but with the MULE code this will have to be changed.  */
      else if (depth == 0)
	call2 (function, make_number (i), elt);
1360
      else
1361
	call2 (function, Fvector (depth + 1, indices), elt);
1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375
    }
}

DEFUN ("map-char-table", Fmap_char_table, Smap_char_table,
  2, 2, 0,
  "Call FUNCTION for each range of like characters in CHARTABLE.\n\
FUNCTION is called with two arguments--a key and a value.\n\
The key is always a possible RANGE argument to `set-char-table-range'.")
  (function, chartable)
     Lisp_Object function, chartable;
{
  Lisp_Object keyvec;
  Lisp_Object *indices = (Lisp_Object *) alloca (10 * sizeof (Lisp_Object));

1376
  map_char_table (NULL, function, chartable, 0, indices);
1377 1378 1379
  return Qnil;
}

Jim Blandy's avatar
Jim Blandy committed
1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409
/* ARGSUSED */
Lisp_Object
nconc2 (s1, s2)
     Lisp_Object s1, s2;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[2];
  args[0] = s1;
  args[1] = s2;
  return Fnconc (2, args);
#else
  return Fnconc (2, &s1);
#endif /* NO_ARG_ARRAY */
}

DEFUN ("nconc", Fnconc, Snconc, 0, MANY, 0,
  "Concatenate any number of lists by altering them.\n\
Only the last argument is not altered, and need not be a list.")
  (nargs, args)
     int nargs;
     Lisp_Object *args;
{
  register int argnum;
  register Lisp_Object tail, tem, val;

  val = Qnil;

  for (argnum = 0; argnum < nargs; argnum++)
    {
      tem = args[argnum];
Jim Blandy's avatar
Jim Blandy committed
1410
      if (NILP (tem)) continue;
Jim Blandy's avatar
Jim Blandy committed
1411

Jim Blandy's avatar
Jim Blandy committed
1412
      if (NILP (val))
Jim Blandy's avatar
Jim Blandy committed
1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428
	val = tem;

      if (argnum + 1 == nargs) break;

      if (!CONSP (tem))
	tem = wrong_type_argument (Qlistp, tem);

      while (CONSP (tem))
	{
	  tail = tem;
	  tem = Fcdr (tail);
	  QUIT;
	}

      tem = args[argnum + 1];
      Fsetcdr (tail, tem);
Jim Blandy's avatar
Jim Blandy committed
1429
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461
	args[argnum + 1] = tail;
    }

  return val;
}

/* This is the guts of all mapping functions.
 Apply fn to each element of seq, one by one,
 storing the results into elements of vals, a C vector of Lisp_Objects.
 leni is the length of vals, which should also be the length of seq. */

static void
mapcar1 (leni, vals, fn, seq)
     int leni;
     Lisp_Object *vals;
     Lisp_Object fn, seq;
{
  register Lisp_Object tail;
  Lisp_Object dummy;
  register int i;
  struct gcpro gcpro1, gcpro2, gcpro3;

  /* Don't let vals contain any garbage when GC happens.  */
  for (i = 0; i < leni; i++)
    vals[i] = Qnil;

  GCPRO3 (dummy, fn, seq);
  gcpro1.var = vals;
  gcpro1.nvars = leni;
  /* We need not explicitly protect `tail' because it is used only on lists, and
    1) lists are not relocated and 2) the list is marked via `seq' so will not be freed */

1462
  if (VECTORP (seq))
Jim Blandy's avatar
Jim Blandy committed
1463 1464 1465 1466 1467 1468 1469
    {
      for (i = 0; i < leni; i++)
	{
	  dummy = XVECTOR (seq)->contents[i];
	  vals[i] = call1 (fn, dummy);
	}
    }
1470
  else if (STRINGP (seq))
Jim Blandy's avatar
Jim Blandy committed
1471 1472 1473
    {
      for (i = 0; i < leni; i++)
	{
1474
	  XSETFASTINT (dummy, XSTRING (seq)->data[i]);
Jim Blandy's avatar
Jim Blandy committed
1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493
	  vals[i] = call1 (fn, dummy);
	}
    }
  else   /* Must be a list, since Flength did not get an error */
    {
      tail = seq;
      for (i = 0; i < leni; i++)
	{
	  vals[i] = call1 (fn, Fcar (tail));
	  tail = Fcdr (tail);
	}
    }

  UNGCPRO;
}

DEFUN ("mapconcat", Fmapconcat, Smapconcat, 3, 3, 0,
  "Apply FN to each element of SEQ, and concat the results as strings.\n\
In between each pair of results, stick in SEP.\n\
Richard M. Stallman's avatar
Richard M. Stallman committed
1494
Thus, \" \" as SEP results in spaces between the values returned by FN.")
Jim Blandy's avatar
Jim Blandy committed
1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520