| find.c (41398) | find.c (41399) |
|---|---|
| 1/*- 2 * Copyright (c) 1991, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Cimarron D. Taylor of the University of California, Berkeley. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 41 unchanged lines hidden (view full) --- 50 51#include "find.h" 52 53static int find_compare __P((const FTSENT **s1, const FTSENT **s2)); 54 55/* 56 * find_compare -- 57 * tell fts_open() how to order the traversal of the hierarchy. | 1/*- 2 * Copyright (c) 1991, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Cimarron D. Taylor of the University of California, Berkeley. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 41 unchanged lines hidden (view full) --- 50 51#include "find.h" 52 53static int find_compare __P((const FTSENT **s1, const FTSENT **s2)); 54 55/* 56 * find_compare -- 57 * tell fts_open() how to order the traversal of the hierarchy. |
| 58 * This variant gives lexicographical order in each directory. | 58 * This variant gives lexicographical order, i.e., alphabetical 59 * order within each directory. |
| 59 */ 60static int 61find_compare(s1, s2) 62 const FTSENT **s1, **s2; 63{ 64 65 return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 66} --- 152 unchanged lines hidden --- | 60 */ 61static int 62find_compare(s1, s2) 63 const FTSENT **s1, **s2; 64{ 65 66 return (strcoll((*s1)->fts_name, (*s2)->fts_name)); 67} --- 152 unchanged lines hidden --- |