Buy the book!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
The bindings between input events and commands are recorded in data structures called keymaps. Each binding in a keymap associates (or binds) an individual event type either to another keymap or to a command. When an event type is bound to a keymap, that keymap is used to look up the next input event; this continues until a command is found. The whole process is called key lookup.
22.1 Keymap Terminology Definitions of terms pertaining to keymaps. 22.2 Format of Keymaps What a keymap looks like as a Lisp object. 22.3 Creating Keymaps Functions to create and copy keymaps. 22.4 Inheritance and Keymaps How one keymap can inherit the bindings of another keymap. 22.5 Prefix Keys Defining a key with a keymap as its definition. 22.6 Active Keymaps Each buffer has a local keymap to override the standard (global) bindings. A minor mode can also override them. 22.7 Key Lookup How extracting elements from keymaps works. 22.8 Functions for Key Lookup How to request key lookup. 22.9 Changing Key Bindings Redefining a key in a keymap. 22.10 Commands for Binding Keys Interactive interfaces for redefining keys. 22.11 Scanning Keymaps Looking through all keymaps, for printing help. 22.12 Menu Keymaps Defining a menu as a keymap.
|webmaster donations bookstore||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|