morpheus-base

morpheus base system
git clone git://git.2f30.org/morpheus-base.git
Log | Files | Refs

runetype.c (1635B)


      1 /* MIT/X Consortium Copyright (c) 2012 Connor Lane Smith <cls@lubutu.com>
      2  *
      3  * Permission is hereby granted, free of charge, to any person obtaining a
      4  * copy of this software and associated documentation files (the "Software"),
      5  * to deal in the Software without restriction, including without limitation
      6  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
      7  * and/or sell copies of the Software, and to permit persons to whom the
      8  * Software is furnished to do so, subject to the following conditions:
      9  *
     10  * The above copyright notice and this permission notice shall be included in
     11  * all copies or substantial portions of the Software.
     12  *
     13  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
     14  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
     15  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
     16  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
     17  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
     18  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
     19  * DEALINGS IN THE SOFTWARE.
     20  */
     21 #include <stdlib.h>
     22 #include "../utf.h"
     23 
     24 #define nelem(x)  (sizeof (x) / sizeof *(x))
     25 
     26 static int rune1cmp(const void *, const void *);
     27 static int rune2cmp(const void *, const void *);
     28 
     29 #include "../runetypebody.h"
     30 
     31 int
     32 rune1cmp(const void *v1, const void *v2)
     33 {
     34 	Rune r1 = *(Rune *)v1, r2 = *(Rune *)v2;
     35 
     36 	return r1 - r2;
     37 }
     38 
     39 int
     40 rune2cmp(const void *v1, const void *v2)
     41 {
     42 	Rune r = *(Rune *)v1, *p = (Rune *)v2;
     43 
     44 	if(r >= p[0] && r <= p[1])
     45 		return 0;
     46 	else
     47 		return r - p[0];
     48 }