When run on a buffer, syntax_prefix_flag_p is taken into account when
determined inword flag. */
bool inbuffer;
- /* Conceptually, this denotes whether we are inside of a word except
- that if flag is CASE_UP it’s always false and if flag is CASE_DOWN
- this is always true. */
+ /* Whether we are inside of a word. */
bool inword;
};
{
ctx->flag = flag;
ctx->inbuffer = inbuffer;
- ctx->inword = flag == CASE_DOWN;
+ ctx->inword = false;
ctx->titlecase_char_table = (int)flag < (int)CASE_CAPITALIZE ? Qnil :
uniprop_table (intern_c_string ("titlecase"));
ctx->specialcase_char_tables[CASE_UP] = flag == CASE_DOWN ? Qnil :
/* Update inword state */
was_inword = ctx->inword;
- if ((int) ctx->flag >= (int) CASE_CAPITALIZE)
- ctx->inword = SYNTAX (ch) == Sword &&
- (!ctx->inbuffer || was_inword || !syntax_prefix_flag_p (ch));
+ ctx->inword = SYNTAX (ch) == Sword &&
+ (!ctx->inbuffer || was_inword || !syntax_prefix_flag_p (ch));
/* Normalise flag so its one of CASE_UP, CASE_DOWN or CASE_CAPITALIZE. */
- if (!was_inword)
- flag = ctx->flag == CASE_UP ? CASE_UP : CASE_CAPITALIZE;
+ if (ctx->flag == CASE_CAPITALIZE)
+ flag = (enum case_action)((int)ctx->flag - was_inword);
else if (ctx->flag != CASE_CAPITALIZE_UP)
- flag = CASE_DOWN;
+ flag = ctx->flag;
+ else if (!was_inword)
+ flag = CASE_CAPITALIZE;
else
{
cased = ch;
buf->len_bytes = CHAR_STRING (cased, buf->data);
return cased != ch;
}
+\f
+/* In Greek, lower case sigma has two forms: one when used in the middle and one
+ when used at the end of a word. Below is to help handle those cases when
+ casing.
+
+ The rule does not conflict with any other casing rules so while it is
+ a conditional one, it is independent on language. */
+#define CAPITAL_SIGMA 0x03A3
+#define SMALL_SIGMA 0x03C3
+#define SMALL_FINAL_SIGMA 0x03C2
+\f
/* Based on CTX, case character CH accordingly. Update CTX as necessary.
Return cased character.
}
/* Save in BUF result of casing character CH. Return whether casing changed the
- character. This is like case_single_character but also handles one-to-many
- casing rules. */
-static inline bool
-case_character (struct casing_str_buf *buf, struct casing_context *ctx, int ch)
+ character.
+
+ If not-NULL, NEXT points to the next character in the cased string. If NULL,
+ it is assumed current character is the last one being cased. This is used to
+ apply some rules which depend on proceeding state.
+
+ This is like case_single_character but also handles one-to-many casing
+ rules. */
+static bool
+case_character (struct casing_str_buf *buf, struct casing_context *ctx,
+ int ch, const unsigned char *next)
{
- return case_character_impl (buf, ctx, ch);
+ bool changed, was_inword;
+
+ was_inword = ctx->inword;
+ changed = case_character_impl (buf, ctx, ch);
+
+ /* If we have just down-cased a capital sigma and the next character no longer
+ has a word syntax (i.e. current character is end of word), use final
+ sigma. */
+ if (was_inword && ch == CAPITAL_SIGMA && changed &&
+ (!next || SYNTAX (STRING_CHAR (next)) != Sword))
+ {
+ buf->len_bytes = CHAR_STRING (SMALL_FINAL_SIGMA, buf->data);
+ buf->len_chars = 1;
+ }
+
+ return changed;
}
\f
static Lisp_Object
if (dst_end - o < sizeof(struct casing_str_buf))
string_overflow ();
ch = STRING_CHAR_ADVANCE (src);
- case_character ((void *)o, ctx, ch);
+ case_character ((void *)o, ctx, ch, size > 1 ? src : NULL);
n += ((struct casing_str_buf *)o)->len_chars;
o += ((struct casing_str_buf *)o)->len_bytes;
}
ptrdiff_t pos = *startp, pos_byte = CHAR_TO_BYTE (pos), size = *endp - pos;
ptrdiff_t opoint = PT, added = 0;
struct casing_str_buf buf;
- int ch, cased, len;
+ bool changed;
+ int ch, len;
for (; size; --size)
{
ch = STRING_CHAR_AND_LENGTH (BYTE_POS_ADDR (pos_byte), len);
- if (!case_character (&buf, ctx, ch))
+ changed = case_character (
+ &buf, ctx, ch,
+ size > 1 ? BYTE_POS_ADDR (pos_byte + len) : NULL);
+
+ if (!changed)
{
pos_byte += len;
++pos;
("define" "DEFINE" "define" "Define" "Define")
("fish" "FISH" "fish" "Fish" "Fish")
("Straße" "STRASSE" "straße" "Straße" "Straße")
- ;; FIXME(bug#24603): Everything below is broken at the moment.
- ;; Here’s what should happen:
- ;;("ΌΣΟΣ" "ΌΣΟΣ" "όσος" "Όσος" "Όσος")
- ;; And here’s what is actually happening:
- ("ΌΣΟΣ" "ΌΣΟΣ" "όσοσ" "Όσοσ" "ΌΣΟΣ")
- ("όσος" "ΌΣΟΣ" "όσος" "Όσος" "Όσος"))))))
+ ;; The word repeated twice to test behaviour at the end of a word
+ ;; inside of an input string as well as at the end of the string.
+ ("ΌΣΟΣ ΌΣΟΣ" "ΌΣΟΣ ΌΣΟΣ" "όσος όσος" "Όσος Όσος" "ΌΣΟΣ ΌΣΟΣ")
+ ;; What should be done with sole sigma? It is ‘final’ but on the
+ ;; other hand it does not form a word. We’re using regular sigma.
+ ("Σ Σ" "Σ Σ" "σ σ" "Σ Σ" "Σ Σ")
+ ("όσος" "ΌΣΟΣ" "όσος" "Όσος" "Όσος")
+ ;; If sigma is already lower case, we don’t want to change it.
+ ("όσοσ" "ΌΣΟΣ" "όσοσ" "Όσοσ" "Όσοσ"))))))
(ert-deftest casefiddle-tests-casing-byte8 ()
(should-not