pyhfst 1.1.0__tar.gz

pyhfst-1.1.0/LICENCE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2023 Rootroo Ltd
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

pyhfst-1.1.0/PKG-INFO

@@ -0,0 +1,58 @@
+Metadata-Version: 2.1
+Name: pyhfst
+Version: 1.1.0
+Summary: A pure Python implementation of HFST for using HFST optimized lookup transducers (with or without weights)
+Home-page: https://github.com/Rootroo-ltd/pyhfst
+Author: Khalid Alnajjar and Mika Hämäläinen
+Author-email: hello@rootroo.com
+License: Apache-2.0
+Project-URL: Bug Reports, https://github.com/Rootroo-ltd/pyhfst/issues
+Project-URL: Developer, https://rootroo.com/
+Keywords: hfst,fst,optimized lookup,hfstol,transducers
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Text Processing :: Linguistic
+Classifier: Programming Language :: Python :: 3
+Description-Content-Type: text/markdown
+License-File: LICENCE
+
+# Pyhfst
+
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.7791470.svg)](https://doi.org/10.5281/zenodo.7791470)
+
+Pyhfst is a pure Python implementation of HFST. The library makes it possible to use HFST optimized lookup FSTs without any C dependencies. Both weighted and unweighted FSTs are supported.
+
+The library will run on all operting systems that support Python 3.
+
+# Installation
+
+    pip install pyhfst
+    
+Pyhfst can run way faster if you have Cython installed. After installing Cython, you must reinstall Pyhfst
+
+    pip install cython
+    pip install --upgrade --force-reinstall pyhfst
+
+# Usage
+
+    import pyhfst
+    
+    input_stream = pyhfst.HfstInputStream("./analyser")
+    tr = input_stream.read()
+    print(tr.lookup("voi"))
+    
+    >> [['voida+V+Act+Ind+Prs+Sg3', 0.0], ['voida+V+Act+Ind+Prs+ConNeg', 0.0], ['voida+V+Act+Ind+Prt+Sg3', 0.0], ['voida+V+Act+Imprt+Prs+ConNeg+Sg2', 0.0], ['voida+V+Act+Imprt+Sg2', 0.0], ['voi+N+Sg+Nom', 0.0], ['voi+Pcle', 0.0], ['voi+Interj', 0.0]]
+
+# Citation
+
+Please cite the library as follows:
+
+Hämäläinen, Mika, & Alnajjar, Khalid. (2023). Pyhfst: A Pure Python Implementation of HFST. Zenodo. https://doi.org/10.5281/zenodo.7791470
+
+    @article{pyhfst_2023, 
+        title={Pyhfst: A Pure Python Implementation of HFST}, 
+        DOI={10.5281/zenodo.7791470}, 
+        publisher={Zenodo}, 
+        author={Hämäläinen, Mika and Alnajjar, Khalid}, 
+        year={2023} 
+    }

pyhfst-1.1.0/README.md

@@ -0,0 +1,40 @@
+# Pyhfst
+
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.7791470.svg)](https://doi.org/10.5281/zenodo.7791470)
+
+Pyhfst is a pure Python implementation of HFST. The library makes it possible to use HFST optimized lookup FSTs without any C dependencies. Both weighted and unweighted FSTs are supported.
+
+The library will run on all operting systems that support Python 3.
+
+# Installation
+
+    pip install pyhfst
+    
+Pyhfst can run way faster if you have Cython installed. After installing Cython, you must reinstall Pyhfst
+
+    pip install cython
+    pip install --upgrade --force-reinstall pyhfst
+
+# Usage
+
+    import pyhfst
+    
+    input_stream = pyhfst.HfstInputStream("./analyser")
+    tr = input_stream.read()
+    print(tr.lookup("voi"))
+    
+    >> [['voida+V+Act+Ind+Prs+Sg3', 0.0], ['voida+V+Act+Ind+Prs+ConNeg', 0.0], ['voida+V+Act+Ind+Prt+Sg3', 0.0], ['voida+V+Act+Imprt+Prs+ConNeg+Sg2', 0.0], ['voida+V+Act+Imprt+Sg2', 0.0], ['voi+N+Sg+Nom', 0.0], ['voi+Pcle', 0.0], ['voi+Interj', 0.0]]
+
+# Citation
+
+Please cite the library as follows:
+
+Hämäläinen, Mika, & Alnajjar, Khalid. (2023). Pyhfst: A Pure Python Implementation of HFST. Zenodo. https://doi.org/10.5281/zenodo.7791470
+
+    @article{pyhfst_2023, 
+        title={Pyhfst: A Pure Python Implementation of HFST}, 
+        DOI={10.5281/zenodo.7791470}, 
+        publisher={Zenodo}, 
+        author={Hämäläinen, Mika and Alnajjar, Khalid}, 
+        year={2023} 
+    }

pyhfst-1.1.0/c_pyhfst/__init__.pyx

@@ -0,0 +1,22 @@
+from typing import Union, List
+from pathlib import Path
+from io import BufferedReader
+from .transducer_header cimport TransducerHeader
+from .transducer_alphabet cimport TransducerAlphabet
+from .transducer cimport Transducer as Transducer
+from .analyzer import Analyzer
+
+cpdef Transducer get_transducer(transducer_path: Union[str, Path]):
+    """
+    Creates a Transducer instance from the given transducer file path.
+
+    :param transducer_path: The path to the transducer file.
+    :return: A Transducer instance.
+    """
+    with open(transducer_path, "rb") as transducer_file:
+        char_stream = BufferedReader(transducer_file)
+        transducer_header = TransducerHeader(char_stream)
+        transducer_alphabet = TransducerAlphabet(
+            char_stream, transducer_header.get_symbol_count()
+        )
+        return Transducer(char_stream, transducer_header, transducer_alphabet, is_weighted=transducer_header.is_weighted())

pyhfst-1.1.0/c_pyhfst/analyzer.pxd

@@ -0,0 +1,30 @@
+# cython: language_level=3
+from .common cimport *
+from .flag_diacritic_operation cimport FlagDiacriticOperation
+from .transducer import Transducer
+import cython
+
+
+cdef class Analyzer:
+    cdef Transducer transducer
+    cdef str input_str
+    cdef State state
+
+
+    cpdef cython.longlong pivot(self, cython.longlong i)
+    cpdef void try_epsilon_indices(self, cython.longlong index)
+    cpdef void try_epsilon_transitions(self, cython.longlong index)
+    cpdef void find_index(self, cython.longlong index)
+    cpdef void handle_epsilon_transition(self, cython.longlong index)
+    cpdef void find_transitions(self, cython.longlong index)
+    cpdef void get_analyses(self, cython.longlong idx)
+    cpdef void update_output_string(self, cython.longlong output_symbol)
+    cpdef void handle_end_of_input_string(self, cython.longlong index, bint is_transition)
+    cpdef void reset_output_pointer(self)
+    cpdef tuple get_final_and_weight(self, cython.longlong index, bint is_transition)
+    cpdef void update_and_note_analysis(self, float weight)
+    cpdef list get_symbols(self)
+    cpdef void note_analysis(self)
+    cpdef list get_alphabet(self)
+    cpdef public list analyze(self)
+    cpdef bint push_state(self, FlagDiacriticOperation flag)

pyhfst-1.1.0/c_pyhfst/analyzer.pyx

@@ -0,0 +1,293 @@
+# cython: language_level=3
+from .common cimport *
+from .flag_diacritic_operation cimport FlagDiacriticOperation, FlagDiacriticOperator
+from .transducer import Transducer
+
+cdef class Analyzer:
+
+    def __cinit__(self, transducer: Transducer, input_str: str):
+        self.transducer = transducer
+        self.input_str = input_str
+        self.state = State(input_str, self.transducer)
+
+    cpdef cython.longlong pivot(self, cython.longlong i):
+        """
+        Computes the pivot for the given index.
+
+        :param i: The index to compute the pivot for.
+        :return: The pivot value.
+        """
+        if i >= TRANSITION_TARGET_TABLE_START:
+            return (i - TRANSITION_TARGET_TABLE_START) % TRANSITION_TARGET_TABLE_START
+        return i
+
+    cpdef void try_epsilon_indices(self, cython.longlong index):
+        """
+        Tries epsilon indices for the given index and state.
+
+        :param index: The index to try epsilon indices for.
+        :param state: The current state of the transducer.
+        """
+        if self.transducer.index_table.get_input(index) == 0:
+            self.try_epsilon_transitions(self.pivot(
+                self.transducer.index_table.get_target(index)))
+
+    cpdef void try_epsilon_transitions(self, cython.longlong index):
+        """
+        Tries epsilon transitions for the given index and state.
+
+        :param index: The index to try epsilon transitions for.
+        :param state: The current state of the transducer.
+        """
+        cdef cython.longlong input_symbol
+
+        while True:
+            input_symbol = self.transducer.transition_table.get_input(index)
+            if self.transducer.operations.get(input_symbol):
+                if self.push_state(self.transducer.operations[input_symbol]):
+                    self.handle_epsilon_transition(index)
+                index += 1
+                self.state.state_stack.pop()
+                continue
+            elif input_symbol == 0:
+                self.handle_epsilon_transition(index)
+                index += 1
+                continue
+            else:
+                break
+
+    cpdef void find_index(self, cython.longlong index):
+        """
+        Finds the index in the transducer for the given index and state.
+
+        :param index: The index to find in the transducer.
+        :param state: The current state of the transducer.
+        """
+        if self.transducer.index_table.get_input(index + (self.state.input_string[self.state.input_pointer - 1])) == self.state.input_string[self.state.input_pointer - 1]:
+            self.find_transitions(self.pivot(self.transducer.index_table.get_target(
+                index + self.state.input_string[self.state.input_pointer - 1])))
+
+    cpdef void handle_epsilon_transition(self, cython.longlong index):
+        """
+        Handles epsilon transitions for the given index and state.
+
+        :param index: The index to handle epsilon transitions for.
+        :param state: The current state of the transducer.
+        """
+        self.update_output_string(self.transducer.transition_table.get_output(index))
+        self.state.output_pointer += 1
+
+        if self.transducer.is_weighted:
+            self.state.current_weight += self.transducer.transition_table.get_weight(index)
+
+        self.get_analyses(self.transducer.transition_table.get_target(index))
+
+        if self.transducer.is_weighted:
+            self.state.current_weight -= self.transducer.transition_table.get_weight(index)
+
+        self.state.output_pointer -= 1
+
+    cpdef void find_transitions(self, cython.longlong index):
+        """
+        Finds the transitions in the transducer for the given index and state.
+
+        :param index: The index to find transitions for.
+        :param state: The current state of the transducer.
+        """
+        for idx in range(index, self.transducer.transition_table.size()):
+            input_symbol = self.transducer.transition_table.get_input(idx)
+            if input_symbol == NO_SYMBOL_NUMBER:
+                break
+
+            if input_symbol == self.state.input_string[self.state.input_pointer - 1]:
+                self.update_output_string(self.transducer.transition_table.get_output(idx))
+                self.state.output_pointer += 1
+
+                if self.transducer.is_weighted:
+                    self.state.current_weight += self.transducer.transition_table.get_weight(
+                        idx)
+
+                self.get_analyses(self.transducer.transition_table.get_target(idx))
+
+                if self.transducer.is_weighted:
+                    self.state.current_weight -= self.transducer.transition_table.get_weight(
+                        idx)
+
+                self.state.output_pointer -= 1
+
+    cpdef void get_analyses(self, cython.longlong idx):
+        """
+        Gets the analyses for the given index and state.
+
+        :param idx: The index to get the analyses for.
+        :param state: The current state of the transducer.
+        """
+        cdef cython.longlong index = self.pivot(idx)
+        is_transition = idx >= TRANSITION_TARGET_TABLE_START
+        if is_transition:
+            self.try_epsilon_transitions(index + 1)
+        else:
+            self.try_epsilon_indices(index + 1)
+
+        if self.state.input_string[self.state.input_pointer] == NO_SYMBOL_NUMBER:
+            self.handle_end_of_input_string(index, is_transition)
+            return
+
+        self.state.input_pointer += 1
+
+        if is_transition:
+            self.find_transitions(index + 1)
+        else:
+            self.find_index(index + 1)
+
+        self.state.input_pointer -= 1
+        self.reset_output_pointer()
+
+    cpdef void update_output_string(self, cython.longlong output_symbol):
+        """
+        Updates the output string in the state based on the output symbol.
+
+        :param state: The current state of the transducer.
+        :param output_symbol: The output symbol to append or update in the output string.
+        """
+        if self.state.output_pointer == len(self.state.output_string):
+            self.state.output_string.append(output_symbol)
+        else:
+            self.state.output_string[self.state.output_pointer] = output_symbol
+
+    cpdef void handle_end_of_input_string(self, cython.longlong index, bint is_transition):
+        """
+        Handles the end of the input string.
+
+        :param state: The current state of the transducer.
+        :param index: The index being processed.
+        :param is_transition: A boolean indicating whether it's a transition table or an index table.
+        """
+        self.reset_output_pointer()
+
+        is_final, weight = self.get_final_and_weight(index, is_transition)
+        if is_final:
+            self.update_and_note_analysis(weight)
+
+    cpdef void reset_output_pointer(self):
+        """
+        Resets the output pointer in the state.
+
+        :param state: The current state of the transducer.
+        """
+        if self.state.output_pointer == len(self.state.output_string):
+            self.state.output_string.append(NO_SYMBOL_NUMBER)
+        else:
+            self.state.output_string[self.state.output_pointer] = NO_SYMBOL_NUMBER
+
+    cpdef tuple get_final_and_weight(self, cython.longlong index, bint is_transition):
+        """
+        Gets the final state and weight based on the index and transition flag.
+
+        :param index: The index being processed.
+        :param is_transition: A boolean indicating whether it's a transition table or an index table.
+        :return: A tuple containing a boolean for final state and a float for the weight.
+        """
+        if is_transition:
+            is_final = self.transducer.transition_table.size(
+            ) > index and self.transducer.transition_table.is_final(index)
+            weight = self.transducer.transition_table.get_weight(
+                index) if self.transducer.is_weighted else 0
+        else:
+            is_final = self.transducer.index_table.is_final(index)
+            weight = self.transducer.index_table.get_final_weight(
+                index) if self.transducer.is_weighted else 0
+
+        return is_final, weight
+
+    cpdef void update_and_note_analysis(self, float weight):
+        """
+        Updates the state's current weight and notes the analysis.
+
+        :param state: The current state of the transducer.
+        :param weight: The weight to be
+        """
+        if self.transducer.is_weighted:
+            self.state.current_weight += weight
+        self.note_analysis()
+        if self.transducer.is_weighted:
+            self.state.current_weight -= weight
+
+    cpdef list get_symbols(self):
+        """
+        Gets the symbols for the given state.
+
+        :param state: The current state of the transducer.
+        :return: A list of symbols.
+        """
+        symbols = [self.transducer.alphabet.keyTable[self.state.output_string[i]] for i in range(
+            len(self.state.output_string)) if self.state.output_string[i] != NO_SYMBOL_NUMBER]
+        return symbols
+
+    cpdef void note_analysis(self):
+        """
+        Notes the analysis for the given state.
+
+        :param state: The current state of the transducer.
+        """
+        self.state.display_vector.append(Result(self.get_symbols(), self.state.current_weight if self.transducer.is_weighted else 1.0))
+
+    cpdef list get_alphabet(self):
+        """
+        Gets the alphabet of the transducer.
+
+        :return: A list of alphabet symbols.
+        """
+        return self.transducer.alphabet.keyTable
+
+    cpdef public list analyze(self):
+        if self.state.input_string[0] == NO_SYMBOL_NUMBER:
+            return []
+        else:
+            self.get_analyses(0)
+            return self.state.display_vector
+
+    cpdef bint push_state(self, FlagDiacriticOperation flag):
+        cdef dict top = self.state.state_stack[-1]
+        if flag.op == FlagDiacriticOperator.P:  # positive set
+            self.state.state_stack.append(top)
+            self.state.state_stack[-1][flag.feature] = flag.value
+            return True
+        elif flag.op == FlagDiacriticOperator.N:  # negative set
+            self.state.state_stack.append(top)
+            self.state.state_stack[-1][flag.feature] = -1 * flag.value
+            return True
+        elif flag.op == FlagDiacriticOperator.R:  # require
+            if flag.value == 0:  # empty require
+                if self.state.state_stack[-1][flag.feature] == 0:
+                    return False
+                else:
+                    self.state.state_stack.append(top)
+                    return True
+            elif self.state.state_stack[-1][flag.feature] == flag.value:
+                self.state.state_stack.append(top)
+                return True
+            return False
+        elif flag.op == FlagDiacriticOperator.D:  # disallow
+            if flag.value == 0:  # empty disallow
+                if self.state.state_stack[-1][flag.feature] != 0:
+                    return False
+                else:
+                    self.state.state_stack.append(top)
+                    return True
+            elif self.state.state_stack[-1][flag.feature] == flag.value:
+                return False
+            else:
+                self.state.state_stack.append(top)
+                return True
+        elif flag.op == FlagDiacriticOperator.C:  # clear
+            self.state.state_stack.append(top)
+            self.state.state_stack[-1][flag.feature] = 0
+            return True
+        elif flag.op == FlagDiacriticOperator.U:  # unification
+            if (self.state.state_stack[-1][flag.feature] == 0) or (self.state.state_stack[-1][flag.feature] == flag.value) or (self.state.state_stack[-1][flag.feature] != flag.value and self.state.state_stack[-1][flag.feature] < 0):
+                self.state.state_stack.append(top)
+                self.state.state_stack[-1][flag.feature] = flag.value
+                return True
+            return False
+        return False  # compiler sanity

pyhfst-1.1.0/c_pyhfst/byte_array.pxd

@@ -0,0 +1,18 @@
+# cython: language_level=3
+
+from libc.stdint cimport uint8_t, uint16_t, uint32_t
+
+cdef class ByteArray:
+
+    cdef bytearray bytes
+    cdef int size
+    cdef int index
+
+    cpdef public int get_size(self)
+    cpdef public bytes get(self, int i)
+    cpdef public bytearray get_bytes(self)
+    cpdef public uint8_t get_ubyte(self)
+    cpdef public uint16_t get_ushort(self)
+    cpdef public uint32_t get_uint(self)
+    cpdef public bint get_bool(self)
+    cpdef public float get_float(self)