diff for duplicates of <20120223135614.7c4e02db.akpm@linux-foundation.org> diff --git a/a/1.txt b/N1/1.txt index 9e27f85..6243d3f 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -35,10 +35,3 @@ ick! We've been playing whack-a-mole with this search for many years. What about developing a proper data structure with which to locate a suitable-sized hole in O(log(N)) time? - --- -To unsubscribe, send a message with 'unsubscribe linux-mm' in -the body to majordomo@kvack.org. For more info on Linux MM, -see: http://www.linux-mm.org/ . -Fight unfair telecom internet charges in Canada: sign http://stopthemeter.ca/ -Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a> diff --git a/a/content_digest b/N1/content_digest index ff56672..d902d40 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -49,13 +49,6 @@ "\n" "We've been playing whack-a-mole with this search for many years. What\n" "about developing a proper data structure with which to locate a\n" - "suitable-sized hole in O(log(N)) time?\n" - "\n" - "--\n" - "To unsubscribe, send a message with 'unsubscribe linux-mm' in\n" - "the body to majordomo@kvack.org. For more info on Linux MM,\n" - "see: http://www.linux-mm.org/ .\n" - "Fight unfair telecom internet charges in Canada: sign http://stopthemeter.ca/\n" - "Don't email: <a href=mailto:\"dont@kvack.org\"> email@kvack.org </a>" + suitable-sized hole in O(log(N)) time? -404bd584a6d989027e7808a626cc14127a73af885a324236083762be6667e8dc +4aef8d52c03a465f00e00e359b680d055e4b6a88b86e9aa93496046a20e6847a
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.