ffpriv_exterior_local_cases.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 ffpriv_exterior_local_cases.c Implements functions for inflecting words
 * in exterior local cases. They're declared in ffpriv_exterior_local_cases.h.
 */

#include "ffpriv_exterior_local_cases.h"
#include "ffpriv_genitive_stem.h"
#include "ffpriv_plural_stem.h"
#include "ffutil.h"
#include "ffcase.h"
#include "ffpriv_single_letter.h"

ffint32 ffpriv_adessive_singular(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ADESSIVE, FFCOUNT_SINGULAR);
  }

  if ((err = ffpriv_genitive_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "lla", "llä"));
}

ffint32 ffpriv_adessive_plural(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ADESSIVE, FFCOUNT_PLURAL);
  }

  word->metadata.cg = 0;
  if ((err = ffpriv_plural_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "lla", "llä"));
}

ffint32 ffpriv_ablative_singular(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ABLATIVE, FFCOUNT_SINGULAR);
  }

  if ((err = ffpriv_genitive_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "lta", "ltä"));
}

ffint32 ffpriv_ablative_plural(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ABLATIVE, FFCOUNT_PLURAL);
  }

  word->metadata.cg = 0;
  if ((err = ffpriv_plural_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data, ffpriv_vowel_harmony(&word->data, "lta", "ltä"));
}

ffint32 ffpriv_allative_singular(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ALLATIVE, FFCOUNT_SINGULAR);
  }

  if ((err = ffpriv_genitive_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data,"lle");
}

ffint32 ffpriv_allative_plural(ffword* word) {
  ffint32 err;

  if (word->data.len < 2) {
    return ffpriv_single_letter(word, FFCASE_ALLATIVE, FFCOUNT_PLURAL);
  }

  word->metadata.cg = 0;
  if ((err = ffpriv_plural_stem(word))) {
    return err;
  }

  return ffstring_append(&word->data, "lle");
}

---