comparison src/search.c @ 56294:aaa6a4ecea38

(match_limit, Fmatch_data, Fset_match_data): YAILOM.

56293:f27d5d17fde5

/* String search routines for GNU Emacs.
   Copyright (C) 1985, 86,87,93,94,97,98, 1999 Free Software Foundation, Inc.

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

  register int n;

  CHECK_NUMBER (num);
  n = XINT (num);
  if (n < 0)
    args_out_of_range (num, 0);
  if (search_regs.num_regs <= 0)
    error ("No match data, because no search succeeded");
  if (n >= search_regs.num_regs
      || search_regs.start[n] < 0)
    return Qnil;

	}
      else
	data[2 * i] = data [2 * i + 1] = Qnil;
    }

  if (BUFFERP(last_thing_searched)
      && ! NILP (integers))
    {
      XSETBUFFER(data[len], last_thing_searched);
      len++;
    }

  /* If REUSE is not usable, cons up the values and return them.  */
  if (! CONSP (reuse))

      }

    for (i = 0;; i++)
      {
	marker = Fcar (list);
	if (BUFFERP(marker))
	  {
	    XSETBUFFER(last_thing_searched, marker);
	    break;
	  }
	if (i >= length)
	  break;
	if (NILP (marker))

56294:aaa6a4ecea38

/* String search routines for GNU Emacs.
   Copyright (C) 1985, 86,87,93,94,97,98, 1999, 2004
             Free Software Foundation, Inc.

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

  register int n;

  CHECK_NUMBER (num);
  n = XINT (num);
  if (n < 0)
    args_out_of_range (num, make_number (0));
  if (search_regs.num_regs <= 0)
    error ("No match data, because no search succeeded");
  if (n >= search_regs.num_regs
      || search_regs.start[n] < 0)
    return Qnil;

	}
      else
	data[2 * i] = data [2 * i + 1] = Qnil;
    }

  if (BUFFERP (last_thing_searched) && !NILP (integers))
    {
      data[len] = last_thing_searched;
      len++;
    }

  /* If REUSE is not usable, cons up the values and return them.  */
  if (! CONSP (reuse))

      }

    for (i = 0;; i++)
      {
	marker = Fcar (list);
	if (BUFFERP (marker))
	  {
	    last_thing_searched = marker;
	    break;
	  }
	if (i >= length)
	  break;
	if (NILP (marker))