/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
- * Copyright (c) 2009 by Matthew Backes, Symas Corp.
+ * Copyright (c) 2009 by Emily Backes, Symas Corp.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* <http://www.OpenLDAP.org/license.html>.
*/
/* ACKNOWLEDGEMENTS:
- * This work was initially developed by Matthew Backes for inclusion
+ * This work was initially developed by Emily Backes for inclusion
* in OpenLDAP software.
*/
* <http://www.OpenLDAP.org/license.html>.
*/
/* ACKNOWLEDGEMENTS: GNUTLS support written by Howard Chu and
- * Matt Backes; sponsored by The Written Word (thewrittenword.com)
+ * Emily Backes; sponsored by The Written Word (thewrittenword.com)
* and Stanford University (stanford.edu).
*/
/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
- * Copyright (c) 2009 by Matthew Backes, Symas Corp.
+ * Copyright (c) 2009 by Emily Backes, Symas Corp.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* <http://www.OpenLDAP.org/license.html>.
*/
/* ACKNOWLEDGEMENTS:
- * This work was initially developed by Matthew Backes for inclusion
+ * This work was initially developed by Emily Backes for inclusion
* in OpenLDAP software.
*/
* <http://www.OpenLDAP.org/license.html>.
*/
/* ACKNOWLEDGEMENTS:
- * This work was initially developed by Matthew Backes at Symas
+ * This work was initially developed by Emily Backes at Symas
* Corporation for inclusion in OpenLDAP Software.
*/
* <http://www.OpenLDAP.org/license.html>.
*/
/* ACKNOWLEDGEMENTS:
- * This work was initially developed by Matthew Backes at Symas
+ * This work was initially developed by Emily Backes at Symas
* Corporation for inclusion in OpenLDAP Software.
*/
/* 8 bit Radix sort + insertion sort
*
* based on code from http://www.cubic.org/docs/radix.htm
- * with improvements by mbackes@symas.com and hyc@symas.com
+ * with improvements by ebackes@symas.com and hyc@symas.com
*
* This code is O(n) but has a relatively high constant factor. For lists
* up to ~50 Quicksort is slightly faster; up to ~100 they are even.
/* 8 bit Radix sort + insertion sort
*
* based on code from http://www.cubic.org/docs/radix.htm
- * with improvements by mbackes@symas.com and hyc@symas.com
+ * with improvements by ebackes@symas.com and hyc@symas.com
*
* This code is O(n) but has a relatively high constant factor. For lists
* up to ~50 Quicksort is slightly faster; up to ~100 they are even.
/* ACKNOWLEDGEMENTS:
* This work was initially developed by Symas Corporation for
* inclusion in OpenLDAP Software, with subsequent enhancements by
- * Matthew Backes at Symas Corporation. This work was sponsored by
+ * Emily Backes at Symas Corporation. This work was sponsored by
* Hewlett-Packard.
*/