aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorAndreas Schwab2011-02-10 12:07:15 +0100
committerAndreas Schwab2011-02-10 12:07:15 +0100
commit16b737dc09bfb9cce1f3b0f8e51ace7d6f4e651a (patch)
tree33bfe2fd2efa62f513301c9459f16c5331478775
parent86361e1edcf4ae6a602a32ee32dba16a3470f407 (diff)
downloademacs-16b737dc09bfb9cce1f3b0f8e51ace7d6f4e651a.tar.gz
emacs-16b737dc09bfb9cce1f3b0f8e51ace7d6f4e651a.zip
Update cl-loaddefs.el and ibuffer.el
-rw-r--r--lisp/emacs-lisp/cl-loaddefs.el18
-rw-r--r--lisp/ibuffer.el2
2 files changed, 10 insertions, 10 deletions
diff --git a/lisp/emacs-lisp/cl-loaddefs.el b/lisp/emacs-lisp/cl-loaddefs.el
index e6ede1ed6d4..badfdcc70b6 100644
--- a/lisp/emacs-lisp/cl-loaddefs.el
+++ b/lisp/emacs-lisp/cl-loaddefs.el
@@ -759,7 +759,7 @@ surrounded by (block NAME ...).
759;;;;;; find nsubstitute-if-not nsubstitute-if nsubstitute substitute-if-not 759;;;;;; find nsubstitute-if-not nsubstitute-if nsubstitute substitute-if-not
760;;;;;; substitute-if substitute delete-duplicates remove-duplicates 760;;;;;; substitute-if substitute delete-duplicates remove-duplicates
761;;;;;; delete-if-not delete-if delete* remove-if-not remove-if remove* 761;;;;;; delete-if-not delete-if delete* remove-if-not remove-if remove*
762;;;;;; replace fill reduce) "cl-seq" "cl-seq.el" "ac5c427e92a38c5a2149acaa013caad9") 762;;;;;; replace fill reduce) "cl-seq" "cl-seq.el" "50667ae0688aa15dad8a585096e7144f")
763;;; Generated autoloads from cl-seq.el 763;;; Generated autoloads from cl-seq.el
764 764
765(autoload 'reduce "cl-seq" "\ 765(autoload 'reduce "cl-seq" "\
@@ -1085,7 +1085,7 @@ Keywords supported: :key
1085 1085
1086(autoload 'union "cl-seq" "\ 1086(autoload 'union "cl-seq" "\
1087Combine LIST1 and LIST2 using a set-union operation. 1087Combine LIST1 and LIST2 using a set-union operation.
1088The result list contains all items that appear in either LIST1 or LIST2. 1088The resulting list contains all items that appear in either LIST1 or LIST2.
1089This is a non-destructive function; it makes a copy of the data if necessary 1089This is a non-destructive function; it makes a copy of the data if necessary
1090to avoid corrupting the original LIST1 and LIST2. 1090to avoid corrupting the original LIST1 and LIST2.
1091 1091
@@ -1095,7 +1095,7 @@ Keywords supported: :test :test-not :key
1095 1095
1096(autoload 'nunion "cl-seq" "\ 1096(autoload 'nunion "cl-seq" "\
1097Combine LIST1 and LIST2 using a set-union operation. 1097Combine LIST1 and LIST2 using a set-union operation.
1098The result list contains all items that appear in either LIST1 or LIST2. 1098The resulting list contains all items that appear in either LIST1 or LIST2.
1099This is a destructive function; it reuses the storage of LIST1 and LIST2 1099This is a destructive function; it reuses the storage of LIST1 and LIST2
1100whenever possible. 1100whenever possible.
1101 1101
@@ -1105,7 +1105,7 @@ Keywords supported: :test :test-not :key
1105 1105
1106(autoload 'intersection "cl-seq" "\ 1106(autoload 'intersection "cl-seq" "\
1107Combine LIST1 and LIST2 using a set-intersection operation. 1107Combine LIST1 and LIST2 using a set-intersection operation.
1108The result list contains all items that appear in both LIST1 and LIST2. 1108The resulting list contains all items that appear in both LIST1 and LIST2.
1109This is a non-destructive function; it makes a copy of the data if necessary 1109This is a non-destructive function; it makes a copy of the data if necessary
1110to avoid corrupting the original LIST1 and LIST2. 1110to avoid corrupting the original LIST1 and LIST2.
1111 1111
@@ -1115,7 +1115,7 @@ Keywords supported: :test :test-not :key
1115 1115
1116(autoload 'nintersection "cl-seq" "\ 1116(autoload 'nintersection "cl-seq" "\
1117Combine LIST1 and LIST2 using a set-intersection operation. 1117Combine LIST1 and LIST2 using a set-intersection operation.
1118The result list contains all items that appear in both LIST1 and LIST2. 1118The resulting list contains all items that appear in both LIST1 and LIST2.
1119This is a destructive function; it reuses the storage of LIST1 and LIST2 1119This is a destructive function; it reuses the storage of LIST1 and LIST2
1120whenever possible. 1120whenever possible.
1121 1121
@@ -1125,7 +1125,7 @@ Keywords supported: :test :test-not :key
1125 1125
1126(autoload 'set-difference "cl-seq" "\ 1126(autoload 'set-difference "cl-seq" "\
1127Combine LIST1 and LIST2 using a set-difference operation. 1127Combine LIST1 and LIST2 using a set-difference operation.
1128The result list contains all items that appear in LIST1 but not LIST2. 1128The resulting list contains all items that appear in LIST1 but not LIST2.
1129This is a non-destructive function; it makes a copy of the data if necessary 1129This is a non-destructive function; it makes a copy of the data if necessary
1130to avoid corrupting the original LIST1 and LIST2. 1130to avoid corrupting the original LIST1 and LIST2.
1131 1131
@@ -1135,7 +1135,7 @@ Keywords supported: :test :test-not :key
1135 1135
1136(autoload 'nset-difference "cl-seq" "\ 1136(autoload 'nset-difference "cl-seq" "\
1137Combine LIST1 and LIST2 using a set-difference operation. 1137Combine LIST1 and LIST2 using a set-difference operation.
1138The result list contains all items that appear in LIST1 but not LIST2. 1138The resulting list contains all items that appear in LIST1 but not LIST2.
1139This is a destructive function; it reuses the storage of LIST1 and LIST2 1139This is a destructive function; it reuses the storage of LIST1 and LIST2
1140whenever possible. 1140whenever possible.
1141 1141
@@ -1145,7 +1145,7 @@ Keywords supported: :test :test-not :key
1145 1145
1146(autoload 'set-exclusive-or "cl-seq" "\ 1146(autoload 'set-exclusive-or "cl-seq" "\
1147Combine LIST1 and LIST2 using a set-exclusive-or operation. 1147Combine LIST1 and LIST2 using a set-exclusive-or operation.
1148The result list contains all items that appear in exactly one of LIST1, LIST2. 1148The resulting list contains all items appearing in exactly one of LIST1, LIST2.
1149This is a non-destructive function; it makes a copy of the data if necessary 1149This is a non-destructive function; it makes a copy of the data if necessary
1150to avoid corrupting the original LIST1 and LIST2. 1150to avoid corrupting the original LIST1 and LIST2.
1151 1151
@@ -1155,7 +1155,7 @@ Keywords supported: :test :test-not :key
1155 1155
1156(autoload 'nset-exclusive-or "cl-seq" "\ 1156(autoload 'nset-exclusive-or "cl-seq" "\
1157Combine LIST1 and LIST2 using a set-exclusive-or operation. 1157Combine LIST1 and LIST2 using a set-exclusive-or operation.
1158The result list contains all items that appear in exactly one of LIST1, LIST2. 1158The resulting list contains all items appearing in exactly one of LIST1, LIST2.
1159This is a destructive function; it reuses the storage of LIST1 and LIST2 1159This is a destructive function; it reuses the storage of LIST1 and LIST2
1160whenever possible. 1160whenever possible.
1161 1161
diff --git a/lisp/ibuffer.el b/lisp/ibuffer.el
index 5113a34e268..d6b4feb1613 100644
--- a/lisp/ibuffer.el
+++ b/lisp/ibuffer.el
@@ -2641,7 +2641,7 @@ will be inserted before the group at point."
2641;;;;;; ibuffer-backward-filter-group ibuffer-forward-filter-group 2641;;;;;; ibuffer-backward-filter-group ibuffer-forward-filter-group
2642;;;;;; ibuffer-toggle-filter-group ibuffer-mouse-toggle-filter-group 2642;;;;;; ibuffer-toggle-filter-group ibuffer-mouse-toggle-filter-group
2643;;;;;; ibuffer-interactive-filter-by-mode ibuffer-mouse-filter-by-mode 2643;;;;;; ibuffer-interactive-filter-by-mode ibuffer-mouse-filter-by-mode
2644;;;;;; ibuffer-auto-mode) "ibuf-ext" "ibuf-ext.el" "d98d015a69b22236de3cb1f7e456218b") 2644;;;;;; ibuffer-auto-mode) "ibuf-ext" "ibuf-ext.el" "f6e06ce5f548106a2ffa2f3029ce5eda")
2645;;; Generated autoloads from ibuf-ext.el 2645;;; Generated autoloads from ibuf-ext.el
2646 2646
2647(autoload 'ibuffer-auto-mode "ibuf-ext" "\ 2647(autoload 'ibuffer-auto-mode "ibuf-ext" "\