fns.c 39.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 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
  else if (COMPILEDP (obj))
    XSETFASTINT (val, XVECTOR (obj)->size & PSEUDOVECTOR_SIZE_MASK);
Jim Blandy's avatar
Jim Blandy committed
111 112
  else if (CONSP (obj))
    {
113
      for (i = 0, tail = obj; !NILP (tail); i++)
Jim Blandy's avatar
Jim Blandy committed
114 115 116 117 118
	{
	  QUIT;
	  tail = Fcdr (tail);
	}

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

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

  XSETINT (length, len);
  return length;
}

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

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

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
294
  if (NILP (arg)) return arg;
295
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328
    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];
329 330
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
	    || COMPILEDP (this)))
Jim Blandy's avatar
Jim Blandy committed
331
	{
332
	  if (INTEGERP (this))
333
            args[argnum] = Fnumber_to_string (this);
Jim Blandy's avatar
Jim Blandy committed
334 335 336 337 338 339 340 341 342 343 344 345
	  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);
    }

346
  XSETFASTINT (len, leni);
Jim Blandy's avatar
Jim Blandy committed
347 348 349

  if (target_type == Lisp_Cons)
    val = Fmake_list (len, Qnil);
350
  else if (target_type == Lisp_Vectorlike)
Jim Blandy's avatar
Jim Blandy committed
351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375
    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);

376
      if (STRINGP (this) && STRINGP (val)
377 378 379 380 381 382
	  && ! 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
383 384 385 386
      while (1)
	{
	  register Lisp_Object elt;

387 388
	  /* Fetch next element of `this' arg into `elt', or break if
             `this' is exhausted. */
Jim Blandy's avatar
Jim Blandy committed
389
	  if (NILP (this)) break;
Jim Blandy's avatar
Jim Blandy committed
390 391 392 393 394
	  if (CONSP (this))
	    elt = Fcar (this), this = Fcdr (this);
	  else
	    {
	      if (thisindex >= thisleni) break;
395
	      if (STRINGP (this))
396
		XSETFASTINT (elt, XSTRING (this)->data[thisindex++]);
Jim Blandy's avatar
Jim Blandy committed
397 398 399 400 401 402 403 404 405 406 407
	      else
		elt = XVECTOR (this)->contents[thisindex++];
	    }

	  /* Store into result */
	  if (toindex < 0)
	    {
	      XCONS (tail)->car = elt;
	      prev = tail;
	      tail = XCONS (tail)->cdr;
	    }
408
	  else if (VECTORP (val))
Jim Blandy's avatar
Jim Blandy committed
409 410 411
	    XVECTOR (val)->contents[toindex++] = elt;
	  else
	    {
412
	      while (!INTEGERP (elt))
Jim Blandy's avatar
Jim Blandy committed
413 414 415 416 417 418 419 420 421 422 423 424 425 426
		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
427
  if (!NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
    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
446
  if (NILP (alist))
Jim Blandy's avatar
Jim Blandy committed
447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467
    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;
{
468 469
  Lisp_Object res;

Jim Blandy's avatar
Jim Blandy committed
470 471
  CHECK_STRING (string, 0);
  CHECK_NUMBER (from, 1);
Jim Blandy's avatar
Jim Blandy committed
472
  if (NILP (to))
Jim Blandy's avatar
Jim Blandy committed
473 474 475 476 477 478 479 480 481 482 483 484
    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);

485 486 487 488
  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
489 490 491 492 493 494 495 496 497 498 499
}

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
500
  for (i = 0; i < num && !NILP (list); i++)
Jim Blandy's avatar
Jim Blandy committed
501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524
    {
      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)
    {
525
      if (CONSP (seq) || NILP (seq))
Jim Blandy's avatar
Jim Blandy committed
526
	return Fcar (Fnthcdr (n, seq));
527
      else if (STRINGP (seq) || VECTORP (seq))
Jim Blandy's avatar
Jim Blandy committed
528 529 530 531 532 533 534
	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
535
  "Return non-nil if ELT is an element of LIST.  Comparison done with `equal'.\n\
Jim Blandy's avatar
Jim Blandy committed
536 537 538 539 540 541
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
542
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
543 544 545
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
546
      if (! NILP (Fequal (elt, tem)))
Jim Blandy's avatar
Jim Blandy committed
547 548 549 550 551 552 553 554 555 556 557 558 559 560
	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
561
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
562 563 564 565 566 567 568 569 570 571
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (elt, tem)) return tail;
      QUIT;
    }
  return Qnil;
}

DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
572 573
  "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
574 575 576 577 578 579
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
580
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612
    {
      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,
613
  "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
614
The value is actually the element of LIST whose car equals KEY.")
Jim Blandy's avatar
Jim Blandy committed
615 616 617 618 619
  (key, list)
     register Lisp_Object key;
     Lisp_Object list;
{
  register Lisp_Object tail;
Jim Blandy's avatar
Jim Blandy committed
620
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
621 622 623 624 625
    {
      register Lisp_Object elt, tem;
      elt = Fcar (tail);
      if (!CONSP (elt)) continue;
      tem = Fequal (Fcar (elt), key);
Jim Blandy's avatar
Jim Blandy committed
626
      if (!NILP (tem)) return elt;
Jim Blandy's avatar
Jim Blandy committed
627 628 629 630 631 632 633 634 635 636 637 638 639
      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
640
  for (tail = list; !NILP (tail); tail = Fcdr (tail))
Jim Blandy's avatar
Jim Blandy committed
641 642 643 644 645 646 647 648 649 650
    {
      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
651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670

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
671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686

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
687
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
688 689 690 691
    {
      tem = Fcar (tail);
      if (EQ (elt, tem))
	{
Jim Blandy's avatar
Jim Blandy committed
692
	  if (NILP (prev))
Jim Blandy's avatar
Jim Blandy committed
693 694 695 696 697 698 699 700 701 702 703 704
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
705
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
Roland McGrath's avatar
Roland McGrath committed
706 707
  "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
708 709 710
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
711 712 713 714 715 716 717 718 719 720
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
721
  while (!NILP (tail))
Roland McGrath's avatar
Roland McGrath committed
722 723
    {
      tem = Fcar (tail);
Jim Blandy's avatar
Jim Blandy committed
724
      if (! NILP (Fequal (elt, tem)))
Roland McGrath's avatar
Roland McGrath committed
725
	{
Jim Blandy's avatar
Jim Blandy committed
726
	  if (NILP (prev))
Roland McGrath's avatar
Roland McGrath committed
727 728 729 730 731 732 733 734 735 736 737 738
	    list = Fcdr (tail);
	  else
	    Fsetcdr (prev, Fcdr (tail));
	}
      else
	prev = tail;
      tail = Fcdr (tail);
      QUIT;
    }
  return list;
}

Jim Blandy's avatar
Jim Blandy committed
739 740 741 742 743 744 745 746
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
747
  if (NILP (list)) return list;
Jim Blandy's avatar
Jim Blandy committed
748 749
  prev = Qnil;
  tail = list;
Jim Blandy's avatar
Jim Blandy committed
750
  while (!NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 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
    {
      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
836
      if (NILP (l1))
Jim Blandy's avatar
Jim Blandy committed
837 838
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
839
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
840 841 842 843
	    return l2;
	  Fsetcdr (tail, l2);
	  return value;
	}
Jim Blandy's avatar
Jim Blandy committed
844
      if (NILP (l2))
Jim Blandy's avatar
Jim Blandy committed
845 846
	{
	  UNGCPRO;
Jim Blandy's avatar
Jim Blandy committed
847
	  if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
848 849 850 851 852
	    return l1;
	  Fsetcdr (tail, l1);
	  return value;
	}
      tem = call2 (pred, Fcar (l2), Fcar (l1));
Jim Blandy's avatar
Jim Blandy committed
853
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
854 855 856 857 858 859 860 861 862 863 864
	{
	  tem = l1;
	  l1 = Fcdr (l1);
	  org_l1 = l1;
	}
      else
	{
	  tem = l2;
	  l2 = Fcdr (l2);
	  org_l2 = l2;
	}
Jim Blandy's avatar
Jim Blandy committed
865
      if (NILP (tail))
Jim Blandy's avatar
Jim Blandy committed
866 867 868 869 870 871 872
	value = tem;
      else
	Fsetcdr (tail, tem);
      tail = tem;
    }
}

873 874 875 876

DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0,
       "Extract a value from a property list.\n\
PLIST is a property list, which is a list of the form\n\
877
\(PROP1 VALUE1 PROP2 VALUE2...).  This function returns the value\n\
878 879 880 881
corresponding to the given PROP, or nil if PROP is not\n\
one of the properties on the list.")
  (val, prop)
     Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
882 883 884
     register Lisp_Object prop;
{
  register Lisp_Object tail;
885
  for (tail = val; !NILP (tail); tail = Fcdr (Fcdr (tail)))
Jim Blandy's avatar
Jim Blandy committed
886 887 888 889 890 891 892 893 894
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
    }
  return Qnil;
}

895 896
DEFUN ("get", Fget, Sget, 2, 2, 0,
  "Return the value of SYMBOL's PROPNAME property.\n\
897 898 899
This is the last value stored with `(put SYMBOL PROPNAME VALUE)'.")
  (symbol, propname)
     Lisp_Object symbol, propname;
900
{
901 902
  CHECK_SYMBOL (symbol, 0);
  return Fplist_get (XSYMBOL (symbol)->plist, propname);
903 904 905 906 907
}

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\
908
\(PROP1 VALUE1 PROP2 VALUE2 ...).  PROP is a symbol and VAL is any object.\n\
909
If PROP is already a property on the list, its value is set to VAL,\n\
Karl Heuer's avatar
Karl Heuer committed
910
otherwise the new PROP VAL pair is added.  The new plist is returned;\n\
911 912 913 914 915 916
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
917 918 919 920
{
  register Lisp_Object tail, prev;
  Lisp_Object newcell;
  prev = Qnil;
921 922
  for (tail = plist; CONSP (tail) && CONSP (XCONS (tail)->cdr);
       tail = XCONS (XCONS (tail)->cdr)->cdr)
Jim Blandy's avatar
Jim Blandy committed
923
    {
924
      if (EQ (prop, XCONS (tail)->car))
925
	{
926
	  Fsetcar (XCONS (tail)->cdr, val);
927 928
	  return plist;
	}
Jim Blandy's avatar
Jim Blandy committed
929 930 931
      prev = tail;
    }
  newcell = Fcons (prop, Fcons (val, Qnil));
Jim Blandy's avatar
Jim Blandy committed
932
  if (NILP (prev))
933
    return newcell;
Jim Blandy's avatar
Jim Blandy committed
934
  else
935
    Fsetcdr (XCONS (prev)->cdr, newcell);
936 937 938 939 940 941
  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)'.")
942 943
  (symbol, propname, value)
     Lisp_Object symbol, propname, value;
944
{
945 946 947 948
  CHECK_SYMBOL (symbol, 0);
  XSYMBOL (symbol)->plist
    = Fplist_put (XSYMBOL (symbol)->plist, propname, value);
  return value;
Jim Blandy's avatar
Jim Blandy committed
949 950 951 952 953 954 955
}

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\
956 957 958
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
959 960 961
  (o1, o2)
     register Lisp_Object o1, o2;
{
962
  return internal_equal (o1, o2, 0) ? Qt : Qnil;
963 964
}

965
static int
966 967 968 969 970 971
internal_equal (o1, o2, depth)
     register Lisp_Object o1, o2;
     int depth;
{
  if (depth > 200)
    error ("Stack overflow in equal");
972

973
 tail_recurse:
Jim Blandy's avatar
Jim Blandy committed
974
  QUIT;
975 976 977 978 979 980 981
  if (EQ (o1, o2))
    return 1;
  if (XTYPE (o1) != XTYPE (o2))
    return 0;

  switch (XTYPE (o1))
    {
982
#ifdef LISP_FLOAT_TYPE
983 984
    case Lisp_Float:
      return (extract_float (o1) == extract_float (o2));
985
#endif
986 987

    case Lisp_Cons:
988 989 990 991 992
      if (!internal_equal (XCONS (o1)->car, XCONS (o2)->car, depth + 1))
	return 0;
      o1 = XCONS (o1)->cdr;
      o2 = XCONS (o2)->cdr;
      goto tail_recurse;
993 994

    case Lisp_Misc:
995
      if (XMISCTYPE (o1) != XMISCTYPE (o2))
996
	return 0;
997
      if (OVERLAYP (o1))
Jim Blandy's avatar
Jim Blandy committed
998
	{
999 1000 1001 1002
	  if (!internal_equal (OVERLAY_START (o1), OVERLAY_START (o1),
			       depth + 1)
	      || !internal_equal (OVERLAY_END (o1), OVERLAY_END (o1),
				  depth + 1))
1003
	    return 0;
1004 1005 1006
	  o1 = XOVERLAY (o1)->plist;
	  o2 = XOVERLAY (o2)->plist;
	  goto tail_recurse;
Jim Blandy's avatar
Jim Blandy committed
1007
	}
1008 1009 1010 1011 1012 1013 1014 1015 1016
      if (MARKERP (o1))
	{
	  return (XMARKER (o1)->buffer == XMARKER (o2)->buffer
		  && (XMARKER (o1)->buffer == 0
		      || XMARKER (o1)->bufpos == XMARKER (o2)->bufpos));
	}
      break;

    case Lisp_Vectorlike:
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042
      {
	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;
	/* But only true vectors and compiled functions are actually sensible
	   to compare, so eliminate the others now.  */
	if (size & PSEUDOVECTOR_FLAG)
	  {
	    if (!(size & PVEC_COMPILED))
	      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;
      }
1043 1044 1045
      break;

    case Lisp_String:
1046 1047 1048 1049 1050
      if (XSTRING (o1)->size != XSTRING (o2)->size)
	return 0;
      if (bcmp (XSTRING (o1)->data, XSTRING (o2)->data,
		XSTRING (o1)->size))
	return 0;
1051
#ifdef USE_TEXT_PROPERTIES
1052 1053 1054 1055 1056
      /* 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;
1057
#endif
1058
      return 1;
Jim Blandy's avatar
Jim Blandy committed
1059
    }
1060
  return 0;
Jim Blandy's avatar
Jim Blandy committed
1061 1062 1063 1064 1065 1066 1067 1068 1069
}

DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0,
  "Store each element of ARRAY with ITEM.  ARRAY is a vector or string.")
  (array, item)
     Lisp_Object array, item;
{
  register int size, index, charval;
 retry:
1070
  if (VECTORP (array))
Jim Blandy's avatar
Jim Blandy committed
1071 1072 1073 1074 1075 1076
    {
      register Lisp_Object *p = XVECTOR (array)->contents;
      size = XVECTOR (array)->size;
      for (index = 0; index < size; index++)
	p[index] = item;
    }
1077
  else if (STRINGP (array))
Jim Blandy's avatar
Jim Blandy committed
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123
    {
      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;
    }
  else
    {
      array = wrong_type_argument (Qarrayp, array);
      goto retry;
    }
  return array;
}

/* 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
1124
      if (NILP (tem)) continue;
Jim Blandy's avatar
Jim Blandy committed
1125

Jim Blandy's avatar
Jim Blandy committed
1126
      if (NILP (val))
Jim Blandy's avatar
Jim Blandy committed
1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
	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
1143
      if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175
	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 */

1176
  if (VECTORP (seq))
Jim Blandy's avatar
Jim Blandy committed
1177 1178 1179 1180 1181 1182 1183
    {
      for (i = 0; i < leni; i++)
	{
	  dummy = XVECTOR (seq)->contents[i];
	  vals[i] = call1 (fn, dummy);
	}
    }
1184
  else if (STRINGP (seq))
Jim Blandy's avatar
Jim Blandy committed
1185 1186 1187
    {
      for (i = 0; i < leni; i++)
	{
1188
	  XSETFASTINT (dummy, XSTRING (seq)->data[i]);
Jim Blandy's avatar
Jim Blandy committed
1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207
	  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
1208
Thus, \" \" as SEP results in spaces between the values returned by FN.")
Jim Blandy's avatar
Jim Blandy committed
1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 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 1257 1258 1259 1260 1261 1262
  (fn, seq, sep)
     Lisp_Object fn, seq, sep;
{
  Lisp_Object len;
  register int leni;
  int nargs;
  register Lisp_Object *args;
  register int i;
  struct gcpro gcpro1;

  len = Flength (seq);
  leni = XINT (len);
  nargs = leni + leni - 1;
  if (nargs < 0) return build_string ("");

  args = (Lisp_Object *) alloca (nargs * sizeof (Lisp_Object));

  GCPRO1 (sep);
  mapcar1 (leni, args, fn, seq);
  UNGCPRO;

  for (i = leni - 1; i >= 0; i--)
    args[i + i] = args[i];
      
  for (i = 1; i < nargs; i += 2)
    args[i] = sep;

  return Fconcat (nargs, args);
}

DEFUN ("mapcar", Fmapcar, Smapcar, 2, 2, 0,
  "Apply FUNCTION to each element of SEQUENCE, and make a list of the results.\n\
The result is a list just as long as SEQUENCE.\n\
SEQUENCE may be a list, a vector or a string.")
  (fn, seq)
     Lisp_Object fn, seq;
{
  register Lisp_Object len;
  register int leni;
  register Lisp_Object *args;

  len = Flength (seq);
  leni = XFASTINT (len);
  args = (Lisp_Object *) alloca (leni * sizeof (Lisp_Object));

  mapcar1 (leni, args, fn, seq);

  return Flist (leni, args);
}

/* Anything that calls this function must protect from GC!  */

DEFUN ("y-or-n-p", Fy_or_n_p, Sy_or_n_p, 1, 1, 0,
  "Ask user a \"y or n\" question.  Return t if answer is \"y\".\n\
1263 1264
Takes one argument, which is the string to display to ask the question.\n\
It should end in a space; `y-or-n-p' adds `(y or n) ' to it.\n\
Jim Blandy's avatar
Jim Blandy committed
1265 1266 1267 1268 1269
No confirmation of the answer is requested; a single character is enough.\n\
Also accepts Space to mean yes, or Delete to mean no.")
  (prompt)
     Lisp_Object prompt;
{
1270 1271
  register Lisp_Object obj, key, def, answer_string, map;
  register int answer;
Jim Blandy's avatar
Jim Blandy committed
1272 1273 1274 1275 1276
  Lisp_Object xprompt;
  Lisp_Object args[2];
  int ocech = cursor_in_echo_area;
  struct gcpro gcpro1, gcpro2;

1277 1278
  map = Fsymbol_value (intern ("query-replace-map"));

Jim Blandy's avatar
Jim Blandy committed
1279 1280 1281 1282 1283 1284
  CHECK_STRING (prompt, 0);
  xprompt = prompt;
  GCPRO2 (prompt, xprompt);

  while (1)
    {
1285
#ifdef HAVE_X_MENU
1286 1287
      if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event))
	  && using_x_p ())
1288 1289
	{
	  Lisp_Object pane, menu;
1290
	  redisplay_preserve_echo_area ();
1291 1292 1293
	  pane = Fcons (Fcons (build_string ("Yes"), Qt),
			Fcons (Fcons (build_string ("No"), Qnil),
			       Qnil));
1294
	  menu = Fcons (prompt, pane);