comparison src/minibuf.c @ 380:8626e4521993 r21-2-5

Import from CVS: tag r21-2-5
author cvs
date Mon, 13 Aug 2007 11:07:10 +0200
parents c5d627a313b1
children 74fd4e045ea6
comparison
equal deleted inserted replaced
379:76b7d63099ad 380:8626e4521993
287 } 287 }
288 return 0; 288 return 0;
289 } 289 }
290 290
291 291
292 /* #### Maybe we should allow ALIST to be a hashtable. It is wrong 292 /* #### Maybe we should allow ALIST to be a hash table. It is wrong
293 for the use of obarrays to be better-rewarded than the use of 293 for the use of obarrays to be better-rewarded than the use of
294 hashtables. By better-rewarded I mean that you can pass an obarray 294 hash tables. By better-rewarded I mean that you can pass an obarray
295 to all of the completion functions, whereas you can't do anything 295 to all of the completion functions, whereas you can't do anything
296 like that with a hashtable. 296 like that with a hash table.
297 297
298 To do so, there should probably be a 298 To do so, there should probably be a
299 map_obarray_or_alist_or_hashtable function which would be used by 299 map_obarray_or_alist_or_hash_table function which would be used by
300 both Ftry_completion and Fall_completions. But would the 300 both Ftry_completion and Fall_completions. But would the
301 additional funcalls slow things down? */ 301 additional funcalls slow things down? */
302 302
303 DEFUN ("try-completion", Ftry_completion, 2, 3, 0, /* 303 DEFUN ("try-completion", Ftry_completion, 2, 3, 0, /*
304 Return common substring of all completions of STRING in ALIST. 304 Return common substring of all completions of STRING in ALIST.