divsufsort.h 2.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. #include <contrib/libs/zstd06/renames.h>
  2. /*
  3. * divsufsort.h for libdivsufsort-lite
  4. * Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
  5. *
  6. * Permission is hereby granted, free of charge, to any person
  7. * obtaining a copy of this software and associated documentation
  8. * files (the "Software"), to deal in the Software without
  9. * restriction, including without limitation the rights to use,
  10. * copy, modify, merge, publish, distribute, sublicense, and/or sell
  11. * copies of the Software, and to permit persons to whom the
  12. * Software is furnished to do so, subject to the following
  13. * conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be
  16. * included in all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  19. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
  20. * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  21. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
  22. * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
  23. * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  24. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  25. * OTHER DEALINGS IN THE SOFTWARE.
  26. */
  27. #ifndef _DIVSUFSORT_H
  28. #define _DIVSUFSORT_H 1
  29. #ifdef __cplusplus
  30. extern "C" {
  31. #endif /* __cplusplus */
  32. /*- Prototypes -*/
  33. /**
  34. * Constructs the suffix array of a given string.
  35. * @param T[0..n-1] The input string.
  36. * @param SA[0..n-1] The output array of suffixes.
  37. * @param n The length of the given string.
  38. * @param openMP enables OpenMP optimization.
  39. * @return 0 if no error occurred, -1 or -2 otherwise.
  40. */
  41. int
  42. divsufsort(const unsigned char *T, int *SA, int n, int openMP);
  43. /**
  44. * Constructs the burrows-wheeler transformed string of a given string.
  45. * @param T[0..n-1] The input string.
  46. * @param U[0..n-1] The output string. (can be T)
  47. * @param A[0..n-1] The temporary array. (can be NULL)
  48. * @param n The length of the given string.
  49. * @param num_indexes The length of secondary indexes array. (can be NULL)
  50. * @param indexes The secondary indexes array. (can be NULL)
  51. * @param openMP enables OpenMP optimization.
  52. * @return The primary index if no error occurred, -1 or -2 otherwise.
  53. */
  54. int
  55. divbwt(const unsigned char *T, unsigned char *U, int *A, int n, unsigned char * num_indexes, int * indexes, int openMP);
  56. #ifdef __cplusplus
  57. } /* extern "C" */
  58. #endif /* __cplusplus */
  59. #endif /* _DIVSUFSORT_H */