HomeSort by: relevance | last modified time | path
    Searched refs:reordering (Results 1 - 4 of 4) sorted by relevancy

  /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/
bidiapi.txt 8 Unicode BiDi algorithm. It currently provides only implicit reordering and
9 does not yet support explicit reordering codes that the Unicode BiDi algorithm
10 supports. In addition to reordering, the PGBA includes cursor movement
README 10 bidirectional reordering algorithm. To use it, you will need to get the
72 results as the Unicode BiDi algorithm for implicit reordering. Included are
76 for implicit reordering. To make this useful for an application, it probably
116 5. Added a default overall direction parameter to the reordering function for
129 2. Fixed a problem with the bidi algorithm starting the reordering correctly.
134 4. Fixed a problem with the bidi algorithm reordering weak (digits and number
api.txt 98 This function decomposes an input string and does canonical reordering of
  /src/external/mit/isl/dist/
isl_polynomial.c 1673 int *reordering = NULL; local
1690 reordering = isl_alloc_array(qp->div->ctx, int, len);
1691 if (!array || !pos || !at || !reordering)
1705 reordering[i] = i;
1729 reordering[div_pos + array[i].row] = div_pos + i - skip;
1732 qp->poly = reorder(qp->poly, reordering);
1740 free(reordering);
1747 free(reordering);
2537 int *reordering; local
2555 reordering = isl_alloc_array(ctx, int, div_pos + qp->div->n_row)
2919 int *reordering = NULL; local
3546 int *reordering; local
3585 int *reordering; local
    [all...]

Completed in 40 milliseconds