2 @c This is part of the GNU Emacs Lisp Reference Manual.
3 @c Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1998 Free Software Foundation, Inc.
4 @c See the file elisp.texi for copying conditions.
5 @setfilename ../info/strings
6 @node Strings and Characters, Lists, Numbers, Top
7 @comment node-name, next, previous, up
8 @chapter Strings and Characters
10 @cindex character arrays
14 A string in Emacs Lisp is an array that contains an ordered sequence
15 of characters. Strings are used as names of symbols, buffers, and
16 files; to send messages to users; to hold text being copied between
17 buffers; and for many other purposes. Because strings are so important,
18 Emacs Lisp has many functions expressly for manipulating them. Emacs
19 Lisp programs use strings more often than individual characters.
21 @xref{Strings of Events}, for special considerations for strings of
22 keyboard character events.
25 * Basics: String Basics. Basic properties of strings and characters.
26 * Predicates for Strings:: Testing whether an object is a string or char.
27 * Creating Strings:: Functions to allocate new strings.
28 * Modifying Strings:: Altering the contents of an existing string.
29 * Text Comparison:: Comparing characters or strings.
30 * String Conversion:: Converting to and from characters and strings.
31 * Formatting Strings:: @code{format}: Emacs's analogue of @code{printf}.
32 * Case Conversion:: Case conversion functions.
33 * Case Tables:: Customizing case conversion.
37 @section String and Character Basics
39 Characters are represented in Emacs Lisp as integers;
40 whether an integer is a character or not is determined only by how it is
41 used. Thus, strings really contain integers.
43 The length of a string (like any array) is fixed, and cannot be
44 altered once the string exists. Strings in Lisp are @emph{not}
45 terminated by a distinguished character code. (By contrast, strings in
46 C are terminated by a character with @sc{ascii} code 0.)
48 Since strings are arrays, and therefore sequences as well, you can
49 operate on them with the general array and sequence functions.
50 (@xref{Sequences Arrays Vectors}.) For example, you can access or
51 change individual characters in a string using the functions @code{aref}
52 and @code{aset} (@pxref{Array Functions}).
54 There are two text representations for non-@sc{ascii} characters in
55 Emacs strings (and in buffers): unibyte and multibyte (@pxref{Text
56 Representations}). An @sc{ascii} character always occupies one byte in a
57 string; in fact, when a string is all @sc{ascii}, there is no real
58 difference between the unibyte and multibyte representations.
59 For most Lisp programming, you don't need to be concerned with these two
62 Sometimes key sequences are represented as strings. When a string is
63 a key sequence, string elements in the range 128 to 255 represent meta
64 characters (which are large integers) rather than character
65 codes in the range 128 to 255.
67 Strings cannot hold characters that have the hyper, super or alt
68 modifiers; they can hold @sc{ascii} control characters, but no other
69 control characters. They do not distinguish case in @sc{ascii} control
70 characters. If you want to store such characters in a sequence, such as
71 a key sequence, you must use a vector instead of a string.
72 @xref{Character Type}, for more information about the representation of meta
73 and other modifiers for keyboard input characters.
75 Strings are useful for holding regular expressions. You can also
76 match regular expressions against strings (@pxref{Regexp Search}). The
77 functions @code{match-string} (@pxref{Simple Match Data}) and
78 @code{replace-match} (@pxref{Replacing Match}) are useful for
79 decomposing and modifying strings based on regular expression matching.
81 Like a buffer, a string can contain text properties for the characters
82 in it, as well as the characters themselves. @xref{Text Properties}.
83 All the Lisp primitives that copy text from strings to buffers or other
84 strings also copy the properties of the characters being copied.
86 @xref{Text}, for information about functions that display strings or
87 copy them into buffers. @xref{Character Type}, and @ref{String Type},
88 for information about the syntax of characters and strings.
89 @xref{Non-ASCII Characters}, for functions to convert between text
90 representations and to encode and decode character codes.
92 @node Predicates for Strings
93 @section The Predicates for Strings
95 For more information about general sequence and array predicates,
96 see @ref{Sequences Arrays Vectors}, and @ref{Arrays}.
99 This function returns @code{t} if @var{object} is a string, @code{nil}
103 @defun char-or-string-p object
104 This function returns @code{t} if @var{object} is a string or a
105 character (i.e., an integer), @code{nil} otherwise.
108 @node Creating Strings
109 @section Creating Strings
111 The following functions create strings, either from scratch, or by
112 putting strings together, or by taking them apart.
114 @defun make-string count character
115 This function returns a string made up of @var{count} repetitions of
116 @var{character}. If @var{count} is negative, an error is signaled.
125 Other functions to compare with this one include @code{char-to-string}
126 (@pxref{String Conversion}), @code{make-vector} (@pxref{Vectors}), and
127 @code{make-list} (@pxref{Building Lists}).
130 @defun string &rest characters
132 This returns a string containing the characters @var{characters}.
140 @defun substring string start &optional end
141 This function returns a new string which consists of those characters
142 from @var{string} in the range from (and including) the character at the
143 index @var{start} up to (but excluding) the character at the index
144 @var{end}. The first character is at index zero.
148 (substring "abcdefg" 0 3)
154 Here the index for @samp{a} is 0, the index for @samp{b} is 1, and the
155 index for @samp{c} is 2. Thus, three letters, @samp{abc}, are copied
156 from the string @code{"abcdefg"}. The index 3 marks the character
157 position up to which the substring is copied. The character whose index
158 is 3 is actually the fourth character in the string.
160 A negative number counts from the end of the string, so that @minus{}1
161 signifies the index of the last character of the string. For example:
165 (substring "abcdefg" -3 -1)
171 In this example, the index for @samp{e} is @minus{}3, the index for
172 @samp{f} is @minus{}2, and the index for @samp{g} is @minus{}1.
173 Therefore, @samp{e} and @samp{f} are included, and @samp{g} is excluded.
175 When @code{nil} is used as an index, it stands for the length of the
180 (substring "abcdefg" -3 nil)
185 Omitting the argument @var{end} is equivalent to specifying @code{nil}.
186 It follows that @code{(substring @var{string} 0)} returns a copy of all
191 (substring "abcdefg" 0)
197 But we recommend @code{copy-sequence} for this purpose (@pxref{Sequence
200 If the characters copied from @var{string} have text properties, the
201 properties are copied into the new string also. @xref{Text Properties}.
203 @code{substring} also accepts a vector for the first argument.
207 (substring [a b (c) "d"] 1 3)
211 A @code{wrong-type-argument} error is signaled if either @var{start} or
212 @var{end} is not an integer or @code{nil}. An @code{args-out-of-range}
213 error is signaled if @var{start} indicates a character following
214 @var{end}, or if either integer is out of range for @var{string}.
216 Contrast this function with @code{buffer-substring} (@pxref{Buffer
217 Contents}), which returns a string containing a portion of the text in
218 the current buffer. The beginning of a string is at index 0, but the
219 beginning of a buffer is at index 1.
222 @defun concat &rest sequences
223 @cindex copying strings
224 @cindex concatenating strings
225 This function returns a new string consisting of the characters in the
226 arguments passed to it (along with their text properties, if any). The
227 arguments may be strings, lists of numbers, or vectors of numbers; they
228 are not themselves changed. If @code{concat} receives no arguments, it
229 returns an empty string.
232 (concat "abc" "-def")
234 (concat "abc" (list 120 121) [122])
236 ;; @r{@code{nil} is an empty sequence.}
237 (concat "abc" nil "-def")
239 (concat "The " "quick brown " "fox.")
240 @result{} "The quick brown fox."
246 The @code{concat} function always constructs a new string that is
247 not @code{eq} to any existing string.
249 When an argument is an integer (not a sequence of integers), it is
250 converted to a string of digits making up the decimal printed
251 representation of the integer. @strong{Don't use this feature; we plan
252 to eliminate it. If you already use this feature, change your programs
253 now!} The proper way to convert an integer to its decimal printed form
254 is with @code{format} (@pxref{Formatting Strings}) or
255 @code{number-to-string} (@pxref{String Conversion}).
266 For information about other concatenation functions, see the
267 description of @code{mapconcat} in @ref{Mapping Functions},
268 @code{vconcat} in @ref{Vectors}, and @code{append} in @ref{Building
272 @defun split-string string separators
274 This function splits @var{string} into substrings at matches for the regular
275 expression @var{separators}. Each match for @var{separators} defines a
276 splitting point; the substrings between the splitting points are made
277 into a list, which is the value returned by @code{split-string}.
278 If @var{separators} is @code{nil} (or omitted),
279 the default is @code{"[ \f\t\n\r\v]+"}.
284 (split-string "Soup is good food" "o")
285 @result{} ("S" "up is g" "" "d f" "" "d")
286 (split-string "Soup is good food" "o+")
287 @result{} ("S" "up is g" "d f" "d")
290 When there is a match adjacent to the beginning or end of the string,
291 this does not cause a null string to appear at the beginning or end
295 (split-string "out to moo" "o+")
296 @result{} ("ut t" " m")
299 Empty matches do count, when not adjacent to another match:
302 (split-string "Soup is good food" "o*")
303 @result{}("S" "u" "p" " " "i" "s" " " "g" "d" " " "f" "d")
304 (split-string "Nice doggy!" "")
305 @result{}("N" "i" "c" "e" " " "d" "o" "g" "g" "y" "!")
309 @node Modifying Strings
310 @section Modifying Strings
312 The most basic way to alter the contents of an existing string is with
313 @code{aset} (@pxref{Array Functions}). @code{(aset @var{string}
314 @var{idx} @var{char})} stores @var{char} into @var{string} at index
315 @var{idx}. Each character occupies one or more bytes, and if @var{char}
316 needs a different number of bytes from the character already present at
317 that index, @code{aset} signals an error.
319 A more powerful function is @code{store-substring}:
321 @defun store-substring string idx obj
322 @tindex store-substring
323 This function alters part of the contents of the string @var{string}, by
324 storing @var{obj} starting at index @var{idx}. The argument @var{obj}
325 may be either a character or a (smaller) string.
327 Since it is impossible to change the length of an existing string, it is
328 an error if @var{obj} doesn't fit within @var{string}'s actual length,
329 or if any new character requires a different number of bytes from the
330 character currently present at that point in @var{string}.
334 @node Text Comparison
335 @section Comparison of Characters and Strings
336 @cindex string equality
338 @defun char-equal character1 character2
339 This function returns @code{t} if the arguments represent the same
340 character, @code{nil} otherwise. This function ignores differences
341 in case if @code{case-fold-search} is non-@code{nil}.
346 (let ((case-fold-search nil))
352 @defun string= string1 string2
353 This function returns @code{t} if the characters of the two strings
355 Case is always significant, regardless of @code{case-fold-search}.
358 (string= "abc" "abc")
360 (string= "abc" "ABC")
366 The function @code{string=} ignores the text properties of the two
367 strings. When @code{equal} (@pxref{Equality Predicates}) compares two
368 strings, it uses @code{string=}.
370 If the strings contain non-@sc{ascii} characters, and one is unibyte
371 while the other is multibyte, then they cannot be equal. @xref{Text
375 @defun string-equal string1 string2
376 @code{string-equal} is another name for @code{string=}.
379 @cindex lexical comparison
380 @defun string< string1 string2
381 @c (findex string< causes problems for permuted index!!)
382 This function compares two strings a character at a time. It
383 scans both the strings at the same time to find the first pair of corresponding
384 characters that do not match. If the lesser character of these two is
385 the character from @var{string1}, then @var{string1} is less, and this
386 function returns @code{t}. If the lesser character is the one from
387 @var{string2}, then @var{string1} is greater, and this function returns
388 @code{nil}. If the two strings match entirely, the value is @code{nil}.
390 Pairs of characters are compared according to their character codes.
391 Keep in mind that lower case letters have higher numeric values in the
392 @sc{ascii} character set than their upper case counterparts; digits and
393 many punctuation characters have a lower numeric value than upper case
394 letters. An @sc{ascii} character is less than any non-@sc{ascii}
395 character; a unibyte non-@sc{ascii} character is always less than any
396 multibyte non-@sc{ascii} character (@pxref{Text Representations}).
400 (string< "abc" "abd")
402 (string< "abd" "abc")
404 (string< "123" "abc")
409 When the strings have different lengths, and they match up to the
410 length of @var{string1}, then the result is @code{t}. If they match up
411 to the length of @var{string2}, the result is @code{nil}. A string of
412 no characters is less than any other string.
430 @defun string-lessp string1 string2
431 @code{string-lessp} is another name for @code{string<}.
434 @defun compare-strings string1 start1 end1 string2 start2 end2 &optional ignore-case
435 @tindex compare-strings
436 This function compares the specified part of @var{string1} with the
437 specified part of @var{string2}. The specified part of @var{string1}
438 runs from index @var{start1} up to index @var{end1} (@code{nil} means
439 the end of the string). The specified part of @var{string2} runs from
440 index @var{start2} up to index @var{end2} (@code{nil} means the end of
443 The strings are both converted to multibyte for the comparison
444 (@pxref{Text Representations}) so that a unibyte string can be equal to
445 a multibyte string. If @var{ignore-case} is non-@code{nil}, then case
446 is ignored, so that upper case letters can be equal to lower case letters.
448 If the specified portions of the two strings match, the value is
449 @code{t}. Otherwise, the value is an integer which indicates how many
450 leading characters agree, and which string is less. Its absolute value
451 is one plus the number of characters that agree at the beginning of the
452 two strings. The sign is negative if @var{string1} (or its specified
456 @defun assoc-ignore-case key alist
457 @tindex assoc-ignore-case
458 This function works like @code{assoc}, except that @var{key} must be a
459 string, and comparison is done using @code{compare-strings}.
460 Case differences are ignored in this comparison.
463 @defun assoc-ignore-representation key alist
464 @tindex assoc-ignore-representation
465 This function works like @code{assoc}, except that @var{key} must be a
466 string, and comparison is done using @code{compare-strings}.
467 Case differences are significant.
470 See also @code{compare-buffer-substrings} in @ref{Comparing Text}, for
471 a way to compare text in buffers. The function @code{string-match},
472 which matches a regular expression against a string, can be used
473 for a kind of string comparison; see @ref{Regexp Search}.
475 @node String Conversion
476 @comment node-name, next, previous, up
477 @section Conversion of Characters and Strings
478 @cindex conversion of strings
480 This section describes functions for conversions between characters,
481 strings and integers. @code{format} and @code{prin1-to-string}
482 (@pxref{Output Functions}) can also convert Lisp objects into strings.
483 @code{read-from-string} (@pxref{Input Functions}) can ``convert'' a
484 string representation of a Lisp object into an object. The functions
485 @code{string-make-multibyte} and @code{string-make-unibyte} convert the
486 text representation of a string (@pxref{Converting Representations}).
488 @xref{Documentation}, for functions that produce textual descriptions
489 of text characters and general input events
490 (@code{single-key-description} and @code{text-char-description}). These
491 functions are used primarily for making help messages.
493 @defun char-to-string character
494 @cindex character to string
495 This function returns a new string containing one character,
496 @var{character}. This function is semi-obsolete because the function
497 @code{string} is more general. @xref{Creating Strings}.
500 @defun string-to-char string
501 @cindex string to character
502 This function returns the first character in @var{string}. If the
503 string is empty, the function returns 0. The value is also 0 when the
504 first character of @var{string} is the null character, @sc{ascii} code
508 (string-to-char "ABC")
510 (string-to-char "xyz")
515 (string-to-char "\000")
520 This function may be eliminated in the future if it does not seem useful
524 @defun number-to-string number
525 @cindex integer to string
526 @cindex integer to decimal
527 This function returns a string consisting of the printed base-ten
528 representation of @var{number}, which may be an integer or a floating
529 point number. The returned value starts with a minus sign if the argument is
533 (number-to-string 256)
535 (number-to-string -23)
537 (number-to-string -23.5)
541 @cindex int-to-string
542 @code{int-to-string} is a semi-obsolete alias for this function.
544 See also the function @code{format} in @ref{Formatting Strings}.
547 @defun string-to-number string &optional base
548 @cindex string to number
549 This function returns the numeric value of the characters in
550 @var{string}. If @var{base} is non-@code{nil}, integers are converted
551 in that base. If @var{base} is @code{nil}, then base ten is used.
552 Floating point conversion always uses base ten; we have not implemented
553 other radices for floating point numbers, because that would be much
554 more work and does not seem useful.
556 The parsing skips spaces and tabs at the beginning of @var{string}, then
557 reads as much of @var{string} as it can interpret as a number. (On some
558 systems it ignores other whitespace at the beginning, not just spaces
559 and tabs.) If the first character after the ignored whitespace is
560 neither a digit, nor a plus or minus sign, nor the leading dot of a
561 floating point number, this function returns 0.
564 (string-to-number "256")
566 (string-to-number "25 is a perfect square.")
568 (string-to-number "X256")
570 (string-to-number "-4.5")
574 @findex string-to-int
575 @code{string-to-int} is an obsolete alias for this function.
578 Here are some other functions that can convert to or from a string:
582 @code{concat} can convert a vector or a list into a string.
583 @xref{Creating Strings}.
586 @code{vconcat} can convert a string into a vector. @xref{Vector
590 @code{append} can convert a string into a list. @xref{Building Lists}.
593 @node Formatting Strings
594 @comment node-name, next, previous, up
595 @section Formatting Strings
596 @cindex formatting strings
597 @cindex strings, formatting them
599 @dfn{Formatting} means constructing a string by substitution of
600 computed values at various places in a constant string. This constant string
601 controls how the other values are printed, as well as where they appear;
602 it is called a @dfn{format string}.
604 Formatting is often useful for computing messages to be displayed. In
605 fact, the functions @code{message} and @code{error} provide the same
606 formatting feature described here; they differ from @code{format} only
607 in how they use the result of formatting.
609 @defun format string &rest objects
610 This function returns a new string that is made by copying
611 @var{string} and then replacing any format specification
612 in the copy with encodings of the corresponding @var{objects}. The
613 arguments @var{objects} are the computed values to be formatted.
615 The characters in @var{string}, other than the format specifications,
616 are copied directly into the output; starting in Emacs 21, if they have
617 text properties, these are copied into the output also.
620 @cindex @samp{%} in format
621 @cindex format specification
622 A format specification is a sequence of characters beginning with a
623 @samp{%}. Thus, if there is a @samp{%d} in @var{string}, the
624 @code{format} function replaces it with the printed representation of
625 one of the values to be formatted (one of the arguments @var{objects}).
630 (format "The value of fill-column is %d." fill-column)
631 @result{} "The value of fill-column is 72."
635 If @var{string} contains more than one format specification, the
636 format specifications correspond to successive values from
637 @var{objects}. Thus, the first format specification in @var{string}
638 uses the first such value, the second format specification uses the
639 second such value, and so on. Any extra format specifications (those
640 for which there are no corresponding values) cause unpredictable
641 behavior. Any extra values to be formatted are ignored.
643 Certain format specifications require values of particular types. If
644 you supply a value that doesn't fit the requirements, an error is
647 Here is a table of valid format specifications:
651 Replace the specification with the printed representation of the object,
652 made without quoting (that is, using @code{princ}, not
653 @code{prin1}---@pxref{Output Functions}). Thus, strings are represented
654 by their contents alone, with no @samp{"} characters, and symbols appear
655 without @samp{\} characters.
657 Starting in Emacs 21, if the object is a string, its text properties are
658 copied into the output. The text properties of the @samp{%s} itself
659 are also copied, but those of the object take priority.
661 If there is no corresponding object, the empty string is used.
664 Replace the specification with the printed representation of the object,
665 made with quoting (that is, using @code{prin1}---@pxref{Output
666 Functions}). Thus, strings are enclosed in @samp{"} characters, and
667 @samp{\} characters appear where necessary before special characters.
669 If there is no corresponding object, the empty string is used.
672 @cindex integer to octal
673 Replace the specification with the base-eight representation of an
677 Replace the specification with the base-ten representation of an
681 @cindex integer to hexadecimal
682 Replace the specification with the base-sixteen representation of an
686 Replace the specification with the character which is the value given.
689 Replace the specification with the exponential notation for a floating
693 Replace the specification with the decimal-point notation for a floating
697 Replace the specification with notation for a floating point number,
698 using either exponential notation or decimal-point notation, whichever
702 Replace the specification with a single @samp{%}. This format specification is
703 unusual in that it does not use a value. For example, @code{(format "%%
704 %d" 30)} returns @code{"% 30"}.
707 Any other format character results in an @samp{Invalid format
710 Here are several examples:
714 (format "The name of this buffer is %s." (buffer-name))
715 @result{} "The name of this buffer is strings.texi."
717 (format "The buffer object prints as %s." (current-buffer))
718 @result{} "The buffer object prints as strings.texi."
720 (format "The octal value of %d is %o,
721 and the hex value is %x." 18 18 18)
722 @result{} "The octal value of 18 is 22,
723 and the hex value is 12."
727 @cindex numeric prefix
730 All the specification characters allow an optional numeric prefix
731 between the @samp{%} and the character. The optional numeric prefix
732 defines the minimum width for the object. If the printed representation
733 of the object contains fewer characters than this, then it is padded.
734 The padding is on the left if the prefix is positive (or starts with
735 zero) and on the right if the prefix is negative. The padding character
736 is normally a space, but if the numeric prefix starts with a zero, zeros
737 are used for padding. Here are some examples of padding:
740 (format "%06d is padded on the left with zeros" 123)
741 @result{} "000123 is padded on the left with zeros"
743 (format "%-6d is padded on the right" 123)
744 @result{} "123 is padded on the right"
747 @code{format} never truncates an object's printed representation, no
748 matter what width you specify. Thus, you can use a numeric prefix to
749 specify a minimum spacing between columns with no risk of losing
752 In the following three examples, @samp{%7s} specifies a minimum width
753 of 7. In the first case, the string inserted in place of @samp{%7s} has
754 only 3 letters, so 4 blank spaces are inserted for padding. In the
755 second case, the string @code{"specification"} is 13 letters wide but is
756 not truncated. In the third case, the padding is on the right.
760 (format "The word `%7s' actually has %d letters in it."
761 "foo" (length "foo"))
762 @result{} "The word ` foo' actually has 3 letters in it."
766 (format "The word `%7s' actually has %d letters in it."
767 "specification" (length "specification"))
768 @result{} "The word `specification' actually has 13 letters in it."
772 (format "The word `%-7s' actually has %d letters in it."
773 "foo" (length "foo"))
774 @result{} "The word `foo ' actually has 3 letters in it."
778 @node Case Conversion
779 @comment node-name, next, previous, up
780 @section Case Conversion in Lisp
783 @cindex character case
784 @cindex case conversion in Lisp
786 The character case functions change the case of single characters or
787 of the contents of strings. The functions normally convert only
788 alphabetic characters (the letters @samp{A} through @samp{Z} and
789 @samp{a} through @samp{z}, as well as non-@sc{ascii} letters); other
790 characters are not altered. You can specify a different case
791 conversion mapping by specifying a case table (@pxref{Case Tables}).
793 These functions do not modify the strings that are passed to them as
796 The examples below use the characters @samp{X} and @samp{x} which have
797 @sc{ascii} codes 88 and 120 respectively.
799 @defun downcase string-or-char
800 This function converts a character or a string to lower case.
802 When the argument to @code{downcase} is a string, the function creates
803 and returns a new string in which each letter in the argument that is
804 upper case is converted to lower case. When the argument to
805 @code{downcase} is a character, @code{downcase} returns the
806 corresponding lower case character. This value is an integer. If the
807 original character is lower case, or is not a letter, then the value
808 equals the original character.
811 (downcase "The cat in the hat")
812 @result{} "the cat in the hat"
819 @defun upcase string-or-char
820 This function converts a character or a string to upper case.
822 When the argument to @code{upcase} is a string, the function creates
823 and returns a new string in which each letter in the argument that is
824 lower case is converted to upper case.
826 When the argument to @code{upcase} is a character, @code{upcase}
827 returns the corresponding upper case character. This value is an integer.
828 If the original character is upper case, or is not a letter, then the
829 value returned equals the original character.
832 (upcase "The cat in the hat")
833 @result{} "THE CAT IN THE HAT"
840 @defun capitalize string-or-char
841 @cindex capitalization
842 This function capitalizes strings or characters. If
843 @var{string-or-char} is a string, the function creates and returns a new
844 string, whose contents are a copy of @var{string-or-char} in which each
845 word has been capitalized. This means that the first character of each
846 word is converted to upper case, and the rest are converted to lower
849 The definition of a word is any sequence of consecutive characters that
850 are assigned to the word constituent syntax class in the current syntax
851 table (@pxref{Syntax Class Table}).
853 When the argument to @code{capitalize} is a character, @code{capitalize}
854 has the same result as @code{upcase}.
857 (capitalize "The cat in the hat")
858 @result{} "The Cat In The Hat"
860 (capitalize "THE 77TH-HATTED CAT")
861 @result{} "The 77th-Hatted Cat"
870 @defun upcase-initials string
871 This function capitalizes the initials of the words in @var{string},
872 without altering any letters other than the initials. It returns a new
873 string whose contents are a copy of @var{string}, in which each word has
874 had its initial letter converted to upper case.
876 The definition of a word is any sequence of consecutive characters that
877 are assigned to the word constituent syntax class in the current syntax
878 table (@pxref{Syntax Class Table}).
882 (upcase-initials "The CAT in the hAt")
883 @result{} "The CAT In The HAt"
888 @xref{Text Comparison}, for functions that compare strings; some of
889 them ignore case differences, or can optionally ignore case differences.
892 @section The Case Table
894 You can customize case conversion by installing a special @dfn{case
895 table}. A case table specifies the mapping between upper case and lower
896 case letters. It affects both the case conversion functions for Lisp
897 objects (see the previous section) and those that apply to text in the
898 buffer (@pxref{Case Changes}). Each buffer has a case table; there is
899 also a standard case table which is used to initialize the case table
902 A case table is a char-table (@pxref{Char-Tables}) whose subtype is
903 @code{case-table}. This char-table maps each character into the
904 corresponding lower case character. It has three extra slots, which
909 The upcase table maps each character into the corresponding upper
912 The canonicalize table maps all of a set of case-related characters
913 into a particular member of that set.
915 The equivalences table maps each one of a set of case-related characters
916 into the next character in that set.
919 In simple cases, all you need to specify is the mapping to lower-case;
920 the three related tables will be calculated automatically from that one.
922 For some languages, upper and lower case letters are not in one-to-one
923 correspondence. There may be two different lower case letters with the
924 same upper case equivalent. In these cases, you need to specify the
925 maps for both lower case and upper case.
927 The extra table @var{canonicalize} maps each character to a canonical
928 equivalent; any two characters that are related by case-conversion have
929 the same canonical equivalent character. For example, since @samp{a}
930 and @samp{A} are related by case-conversion, they should have the same
931 canonical equivalent character (which should be either @samp{a} for both
932 of them, or @samp{A} for both of them).
934 The extra table @var{equivalences} is a map that cyclicly permutes
935 each equivalence class (of characters with the same canonical
936 equivalent). (For ordinary @sc{ascii}, this would map @samp{a} into
937 @samp{A} and @samp{A} into @samp{a}, and likewise for each set of
938 equivalent characters.)
940 When you construct a case table, you can provide @code{nil} for
941 @var{canonicalize}; then Emacs fills in this slot from the lower case
942 and upper case mappings. You can also provide @code{nil} for
943 @var{equivalences}; then Emacs fills in this slot from
944 @var{canonicalize}. In a case table that is actually in use, those
945 components are non-@code{nil}. Do not try to specify @var{equivalences}
946 without also specifying @var{canonicalize}.
948 Here are the functions for working with case tables:
950 @defun case-table-p object
951 This predicate returns non-@code{nil} if @var{object} is a valid case
955 @defun set-standard-case-table table
956 This function makes @var{table} the standard case table, so that it will
957 be used in any buffers created subsequently.
960 @defun standard-case-table
961 This returns the standard case table.
964 @defun current-case-table
965 This function returns the current buffer's case table.
968 @defun set-case-table table
969 This sets the current buffer's case table to @var{table}.
972 The following three functions are convenient subroutines for packages
973 that define non-@sc{ascii} character sets. They modify the specified
974 case table @var{case-table}; they also modify the standard syntax table.
975 @xref{Syntax Tables}. Normally you would use these functions to change
976 the standard case table.
978 @defun set-case-syntax-pair uc lc case-table
979 This function specifies a pair of corresponding letters, one upper case
983 @defun set-case-syntax-delims l r case-table
984 This function makes characters @var{l} and @var{r} a matching pair of
985 case-invariant delimiters.
988 @defun set-case-syntax char syntax case-table
989 This function makes @var{char} case-invariant, with syntax
993 @deffn Command describe-buffer-case-table
994 This command displays a description of the contents of the current