Mercurial > hg > xemacs-beta
view man/lispref/range-tables.texi @ 1298:1b4bc72f433e
[xemacs-hg @ 2003-02-14 12:05:06 by ben]
speedups to build process
autoload.el: Factor out common code in generate-{c-,}file-autoloads-1 into new
function generate-autoload-ish-1. \(I was originally going to use
this for custom as well but ended up thinking better of it.)
cus-dep.el: Cache the old computed values in custom-load.el and reuse them as
necessary, to speed up running cus-dep (which would take 25-30
seconds to do all files in lisp/*, lisp/*/* on my Pentium III
700). Use `message' not `princ' to get correct newline behavior.
Output messages showing each file we do actually process.
update-elc-2.el: Rewrite algorithm to be much faster -- cache calls to
directory-files and don't make needless calls to file-exists-p,
file-directory-p because they're way way slow.
Autoload early and only when update-elc has told us to.
update-elc.el: If no files need byte compilation, signal to update-elc-2 to do
any necessary autoload updating (using the file REBUILD_AUTOLOADS)
rather than doing it ourselves, which would be way slow. Ignore
updates to custom-load.el and auto-autoloads.el when checking to
see whether autoloads need updating. Optimize out many
unnecessary calls to file-exists-p to speed it up somewhat. (####
The remaining time is 50% or more in locate-file; this is
presumably because, even though it has a cache, it's still
statting each file to determine it's actually there. By calling
directory-files ourselves, building a tree, and then looking in
that tree, we could drastically shorten the time needed to do the
locate operation.)
author | ben |
---|---|
date | Fri, 14 Feb 2003 12:05:07 +0000 |
parents | 576fb035e263 |
children | ab71ad6ff3dd |
line wrap: on
line source
@c -*-texinfo-*- @c This is part of the XEmacs Lisp Reference Manual. @c Copyright (C) 1996 Ben Wing. @c See the file lispref.texi for copying conditions. @setfilename ../../info/range-tables.info @node Range Tables, Databases, Hash Tables, top @chapter Range Tables @cindex Range Tables A range table is a table that efficiently associated values with ranges of integers. Note that range tables have a read syntax, like this: @example #s(range-table data ((-3 2) foo (5 20) bar)) @end example This maps integers in the range (-3, 2) to @code{foo} and integers in the range (5, 20) to @code{bar}. @defun range-table-p object Return non-@code{nil} if @var{object} is a range table. @end defun @menu * Introduction to Range Tables:: Range tables efficiently map ranges of integers to values. * Working With Range Tables:: Range table functions. @end menu @node Introduction to Range Tables @section Introduction to Range Tables @defun make-range-table Make a new, empty range table. @end defun @defun copy-range-table range-table This function returns a new range table which contains the same values for the same ranges as @var{range-table}. The values will not themselves be copied. @end defun @node Working With Range Tables @section Working With Range Tables @defun get-range-table pos range-table &optional default This function finds value for position @var{pos} in @var{range-table}. If there is no corresponding value, return @var{default} (defaults to @code{nil}). @end defun @defun put-range-table start end value range-table This function sets the value for range (@var{start}, @var{end}) to be @var{value} in @var{range-table}. @end defun @defun remove-range-table start end range-table This function removes the value for range (@var{start}, @var{end}) in @var{range-table}. @end defun @defun clear-range-table range-table This function flushes @var{range-table}. @end defun @defun map-range-table function range-table This function maps @var{function} over entries in @var{range-table}, calling it with three args, the beginning and end of the range and the corresponding value. @end defun