ffutil.c

Go to the documentation of this file.

/*
 * finflect - Algorithms and tools for inflecting Finnish nouns
 * Copyright (C) 2004, 2005  The FinFlect Team
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *
 * For the complete legal text of the GNU Lesser General Public License,
 * see the file LICENSE. For a complete list of authors and copyright
 * holders, see the file AUTHORS.
 */

/**
 * @file ffutil.c Implements the utility functions (declared in ffutil.c).
 */

#include <stdlib.h>

#include "fftypes.h"
#include "ffutil.h"

static const char* v_low = "aeiouyåäö";
static const char* v_upp = "AEIOUYÅÄÖ";
static const char* c_low = "bcdfghjklmnpqrstvwxz";
static const char* c_upp = "BCDFGHJKLMNPQRSTVWXZ";
static const ffuint32 v_len = 9;
static const ffuint32 c_len = 20;

ffbool ffpriv_is_vowel(const char letter) {
  const char* i = v_low;

  for (;i < v_low+v_len; ++i) {
    if (letter == *i ) {
      return 1;
    }
  }

  i = v_upp;
  for (;i < v_upp+v_len; ++i) {
    if (letter == *i ) {
      return 1;
    }
  }

  return 0;
}

ffbool ffpriv_is_consonant(const char letter) {
  const char* i = c_low;

  for (;i < c_low+c_len; ++i) {
    if (letter == *i ) {
      return 1;
    }
  }

  i = c_upp;
  for (;i < c_upp+c_len; ++i) {
    if (letter == *i ) {
      return 1;
    }
  }

  return 0;
}

ffchar* ffpriv_vowel_harmony(const ffstring* string, ffchar* back, ffchar* front) {
  ffint32 i = string->len -1;
  ffchar c;
  for (; i >= 0; i--) {
    c = string->str[i];
    if (c == 'a' || c == 'A' || c == 'o' || c == 'O' || c == 'u' || c == 'U' ) {
      return back;
    } else if (c == 'ä' || c == 'Ä' || c == 'ö' || c == 'Ö' || c == 'y' || c == 'Y' ) {
      return front;
    }
  }
  return front;
}

ffuint32 ffutil_tolower(const ffstring* source, ffstring* target) {
  ffuint32 i = 0;
  ffchar c;

  ffstring_copy(source, target);

  for (;i < source->len; i++) {
    c = source->str[i];

    if (c >= 'A' && c <= 'Z' ) {
      target->str[i] = c + ('a' - 'A');
      continue;
    }
    switch (c) {
    case 'Ä':
      target->str[i] = 'ä';
      break;
    case 'Ö':
      target->str[i] = 'ö';
      break;
    case 'Å':
      target->str[i] = 'å';
      break;
    }
  }
  return 0;
}

ffuint32 ffutil_toupper(const ffstring* source, ffstring* target) {
  ffuint32 i = 0;
  ffchar c;

  ffstring_copy(source, target);
  for (;i < source->len; i++) {
    c = source->str[i];

    if (c >= 'a' && c <= 'z' ) {
      target->str[i] = c - ('a' - 'A');
      continue;
    }
    switch (c) {
    case 'ä':
      target->str[i] = 'Ä';
      break;
    case 'ö':
      target->str[i] = 'Ö';
      break;
    case 'å':
      target->str[i] = 'Å';
      break;
    }
  }
  return 0;
}


ffchar ffutil_ffchar_tolower(ffchar c) {
  if (c >= 'A' && c <= 'Z' ) {
    return c + ('a' - 'A');
  }

  switch (c) {
  case 'Ä':
    return 'ä';
  case 'Ö':
    return 'ö';
  case 'Å':
    return 'å';
  }
  return c;
}

---