diff options
| author | Jim Blandy | 1992-09-23 12:48:12 +0000 |
|---|---|---|
| committer | Jim Blandy | 1992-09-23 12:48:12 +0000 |
| commit | ff462f26fd1dcf45c26cf0cdc5345dc04b52daf8 (patch) | |
| tree | b5e63bb77f3d8df4485e97c36612fca0ae00cced /src | |
| parent | f5b79c1c36da2b7d5b61920a074798a6a542b613 (diff) | |
| download | emacs-ff462f26fd1dcf45c26cf0cdc5345dc04b52daf8.tar.gz emacs-ff462f26fd1dcf45c26cf0cdc5345dc04b52daf8.zip | |
* xmenu.c (single_keymap_panes): Comment out the code which
tries to handle a dense keymap's table; it uses keymap_table, and
the rest of the code never uses the table contents anyway.
Diffstat (limited to 'src')
| -rw-r--r-- | src/xmenu.c | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/xmenu.c b/src/xmenu.c index 1e6dd98624f..592f8cc574a 100644 --- a/src/xmenu.c +++ b/src/xmenu.c | |||
| @@ -468,6 +468,7 @@ single_keymap_panes (keymap, panes, vector, names, items, | |||
| 468 | /* Get the length of the list level of the keymap. */ | 468 | /* Get the length of the list level of the keymap. */ |
| 469 | i = XFASTINT (Flength (keymap)); | 469 | i = XFASTINT (Flength (keymap)); |
| 470 | 470 | ||
| 471 | #if 0 | ||
| 471 | /* If the keymap has a dense table, put it in TABLE, | 472 | /* If the keymap has a dense table, put it in TABLE, |
| 472 | and leave only the list level in KEYMAP. | 473 | and leave only the list level in KEYMAP. |
| 473 | Include the length of the dense table in I. */ | 474 | Include the length of the dense table in I. */ |
| @@ -477,6 +478,7 @@ single_keymap_panes (keymap, panes, vector, names, items, | |||
| 477 | i += XFASTINT (Flength (table)); | 478 | i += XFASTINT (Flength (table)); |
| 478 | keymap = XCONS (XCONS (keymap)->cdr)->cdr; | 479 | keymap = XCONS (XCONS (keymap)->cdr)->cdr; |
| 479 | } | 480 | } |
| 481 | #endif | ||
| 480 | 482 | ||
| 481 | /* Create vectors for the names and values of the items in the pane. | 483 | /* Create vectors for the names and values of the items in the pane. |
| 482 | I is an upper bound for the number of items. */ | 484 | I is an upper bound for the number of items. */ |