mirrors/emacs
1
Fork 0
mirror of git://git.sv.gnu.org/emacs.git synced 2025-12-15 10:30:25 -08:00
Code Issues Projects Releases Wiki Activity

Update cl-loaddefs.el and ibuffer.el

Browse source
This commit is contained in:
Andreas Schwab 2011-02-10 12:07:15 +01:00
parent 86361e1edc
commit 16b737dc09
2 changed files with 10 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

18
lisp/emacs-lisp/cl-loaddefs.el
View file

@ -759,7 +759,7 @@ surrounded by (block NAME ...).
;;;;;; find nsubstitute-if-not nsubstitute-if nsubstitute substitute-if-not ;;;;;; find nsubstitute-if-not nsubstitute-if nsubstitute substitute-if-not
;;;;;; substitute-if substitute delete-duplicates remove-duplicates ;;;;;; substitute-if substitute delete-duplicates remove-duplicates
;;;;;; delete-if-not delete-if delete* remove-if-not remove-if remove* ;;;;;; delete-if-not delete-if delete* remove-if-not remove-if remove*
;;;;;; replace fill reduce) "cl-seq" "cl-seq.el" "ac5c427e92a38c5a2149acaa013caad9") ;;;;;; replace fill reduce) "cl-seq" "cl-seq.el" "50667ae0688aa15dad8a585096e7144f")
;;; Generated autoloads from cl-seq.el ;;; Generated autoloads from cl-seq.el
(autoload 'reduce "cl-seq" "\ (autoload 'reduce "cl-seq" "\
@ -1085,7 +1085,7 @@ Keywords supported: :key
(autoload 'union "cl-seq" "\ (autoload 'union "cl-seq" "\
Combine LIST1 and LIST2 using a set-union operation. Combine LIST1 and LIST2 using a set-union operation.
The result list contains all items that appear in either LIST1 or LIST2. The resulting list contains all items that appear in either LIST1 or LIST2.
This is a non-destructive function; it makes a copy of the data if necessary This is a non-destructive function; it makes a copy of the data if necessary
to avoid corrupting the original LIST1 and LIST2. to avoid corrupting the original LIST1 and LIST2.
@ -1095,7 +1095,7 @@ Keywords supported: :test :test-not :key
(autoload 'nunion "cl-seq" "\ (autoload 'nunion "cl-seq" "\
Combine LIST1 and LIST2 using a set-union operation. Combine LIST1 and LIST2 using a set-union operation.
The result list contains all items that appear in either LIST1 or LIST2. The resulting list contains all items that appear in either LIST1 or LIST2.
This is a destructive function; it reuses the storage of LIST1 and LIST2 This is a destructive function; it reuses the storage of LIST1 and LIST2
whenever possible. whenever possible.
@ -1105,7 +1105,7 @@ Keywords supported: :test :test-not :key
(autoload 'intersection "cl-seq" "\ (autoload 'intersection "cl-seq" "\
Combine LIST1 and LIST2 using a set-intersection operation. Combine LIST1 and LIST2 using a set-intersection operation.
The result list contains all items that appear in both LIST1 and LIST2. The resulting list contains all items that appear in both LIST1 and LIST2.
This is a non-destructive function; it makes a copy of the data if necessary This is a non-destructive function; it makes a copy of the data if necessary
to avoid corrupting the original LIST1 and LIST2. to avoid corrupting the original LIST1 and LIST2.
@ -1115,7 +1115,7 @@ Keywords supported: :test :test-not :key
(autoload 'nintersection "cl-seq" "\ (autoload 'nintersection "cl-seq" "\
Combine LIST1 and LIST2 using a set-intersection operation. Combine LIST1 and LIST2 using a set-intersection operation.
The result list contains all items that appear in both LIST1 and LIST2. The resulting list contains all items that appear in both LIST1 and LIST2.
This is a destructive function; it reuses the storage of LIST1 and LIST2 This is a destructive function; it reuses the storage of LIST1 and LIST2
whenever possible. whenever possible.
@ -1125,7 +1125,7 @@ Keywords supported: :test :test-not :key
(autoload 'set-difference "cl-seq" "\ (autoload 'set-difference "cl-seq" "\
Combine LIST1 and LIST2 using a set-difference operation. Combine LIST1 and LIST2 using a set-difference operation.
The result list contains all items that appear in LIST1 but not LIST2. The resulting list contains all items that appear in LIST1 but not LIST2.
This is a non-destructive function; it makes a copy of the data if necessary This is a non-destructive function; it makes a copy of the data if necessary
to avoid corrupting the original LIST1 and LIST2. to avoid corrupting the original LIST1 and LIST2.
@ -1135,7 +1135,7 @@ Keywords supported: :test :test-not :key
(autoload 'nset-difference "cl-seq" "\ (autoload 'nset-difference "cl-seq" "\
Combine LIST1 and LIST2 using a set-difference operation. Combine LIST1 and LIST2 using a set-difference operation.
The result list contains all items that appear in LIST1 but not LIST2. The resulting list contains all items that appear in LIST1 but not LIST2.
This is a destructive function; it reuses the storage of LIST1 and LIST2 This is a destructive function; it reuses the storage of LIST1 and LIST2
whenever possible. whenever possible.
@ -1145,7 +1145,7 @@ Keywords supported: :test :test-not :key
(autoload 'set-exclusive-or "cl-seq" "\ (autoload 'set-exclusive-or "cl-seq" "\
Combine LIST1 and LIST2 using a set-exclusive-or operation. Combine LIST1 and LIST2 using a set-exclusive-or operation.
The result list contains all items that appear in exactly one of LIST1, LIST2. The resulting list contains all items appearing in exactly one of LIST1, LIST2.
This is a non-destructive function; it makes a copy of the data if necessary This is a non-destructive function; it makes a copy of the data if necessary
to avoid corrupting the original LIST1 and LIST2. to avoid corrupting the original LIST1 and LIST2.
@ -1155,7 +1155,7 @@ Keywords supported: :test :test-not :key
(autoload 'nset-exclusive-or "cl-seq" "\ (autoload 'nset-exclusive-or "cl-seq" "\
Combine LIST1 and LIST2 using a set-exclusive-or operation. Combine LIST1 and LIST2 using a set-exclusive-or operation.
The result list contains all items that appear in exactly one of LIST1, LIST2. The resulting list contains all items appearing in exactly one of LIST1, LIST2.
This is a destructive function; it reuses the storage of LIST1 and LIST2 This is a destructive function; it reuses the storage of LIST1 and LIST2
whenever possible. whenever possible.

2
lisp/ibuffer.el
View file

@ -2641,7 +2641,7 @@ will be inserted before the group at point."
;;;;;; ibuffer-backward-filter-group ibuffer-forward-filter-group ;;;;;; ibuffer-backward-filter-group ibuffer-forward-filter-group
;;;;;; ibuffer-toggle-filter-group ibuffer-mouse-toggle-filter-group ;;;;;; ibuffer-toggle-filter-group ibuffer-mouse-toggle-filter-group
;;;;;; ibuffer-interactive-filter-by-mode ibuffer-mouse-filter-by-mode ;;;;;; ibuffer-interactive-filter-by-mode ibuffer-mouse-filter-by-mode
;;;;;; ibuffer-auto-mode) "ibuf-ext" "ibuf-ext.el" "d98d015a69b22236de3cb1f7e456218b") ;;;;;; ibuffer-auto-mode) "ibuf-ext" "ibuf-ext.el" "f6e06ce5f548106a2ffa2f3029ce5eda")
;;; Generated autoloads from ibuf-ext.el ;;; Generated autoloads from ibuf-ext.el
(autoload 'ibuffer-auto-mode "ibuf-ext" "\ (autoload 'ibuffer-auto-mode "ibuf-ext" "\