localization updates

1 files changed, 4 insertions, 4 deletions

diff --git a/intl/tsearch.h b/intl/tsearch.h
index f08e4a91..3d3fd14c 100644
--- a/intl/tsearch.h
+++ b/intl/tsearch.h
@@ -47,18 +47,18 @@ VISIT;
    If one is found, it is returned.  Otherwise, a new element equal to KEY
    is inserted in the tree and is returned.  */
 extern void * tsearch (const void *key, void **vrootp,
-		       int (*compar) (const void *, const void *));
+                       int (*compar) (const void *, const void *));
 
 /* Searches an element in the tree *VROOTP that compares equal to KEY.
    If one is found, it is returned.  Otherwise, NULL is returned.  */
 extern void * tfind (const void *key, void *const *vrootp,
-		     int (*compar) (const void *, const void *));
+                     int (*compar) (const void *, const void *));
 
 /* Searches an element in the tree *VROOTP that compares equal to KEY.
    If one is found, it is removed from the tree, and its parent node is
    returned.  Otherwise, NULL is returned.  */
 extern void * tdelete (const void *key, void **vrootp,
-		       int (*compar) (const void *, const void *));
+                       int (*compar) (const void *, const void *));
 
 /* Perform a depth-first, left-to-right traversal of the tree VROOT.
    The ACTION function is called:
@@ -72,7 +72,7 @@ extern void * tdelete (const void *key, void **vrootp,
      2. an indicator which visit of the node this is,
      3. the level of the node in the tree (0 for the root).  */
 extern void twalk (const void *vroot,
-		   void (*action) (const void *, VISIT, int));
+                   void (*action) (const void *, VISIT, int));
 
 #ifdef __cplusplus
 }