* 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.
+ * License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "config.h"
gint n_index_stride;
};
-/* This file contains the table of the compose sequences,
+/* This file contains the table of the compose sequences,
* static const guint16 gtk_compose_seqs_compact[] = {}
- * IT is generated from the compose-parse.py script.
+ * It is generated from the compose-parse.py script.
*/
#include "gtkimcontextsimpleseqs.h"
-/* From the values below, the value 23 means the number of different first keysyms
- * that exist in the Compose file (from Xorg). When running compose-parse.py without
+/* From the values below, the value 24 means the number of different first keysyms
+ * that exist in the Compose file (from Xorg). When running compose-parse.py without
* parameters, you get the count that you can put here. Needed when updating the
* gtkimcontextsimpleseqs.h header file (contains the compose sequences).
*/
guint16 *prev_seq;
/* Back up to the first sequence that matches to make sure
- * we find the exact match if their is one.
+ * we find the exact match if there is one.
*/
while (seq > table->data)
{
gunichar value =
0x10000 * seq[table->max_seq_len] + seq[table->max_seq_len + 1];
-
/* We found a tentative match. See if there are any longer
* sequences containing this subsequence
*/
{
priv->tentative_match = value;
priv->tentative_match_len = n_compose;
-
+
g_signal_emit_by_name (context_simple, "preedit-changed");
return TRUE;
#endif
+#ifdef GDK_WINDOWING_QUARTZ
+
static gboolean
-check_compact_table (GtkIMContextSimple *context_simple,
- const GtkComposeTableCompact *table,
- gint n_compose)
+check_quartz_special_cases (GtkIMContextSimple *context_simple,
+ gint n_compose)
+{
+ GtkIMContextSimplePrivate *priv = context_simple->priv;
+ guint value = 0;
+
+ if (n_compose == 2)
+ {
+ switch (priv->compose_buffer[0])
+ {
+ case GDK_KEY_dead_doubleacute:
+ switch (priv->compose_buffer[1])
+ {
+ case GDK_KEY_dead_doubleacute:
+ case GDK_KEY_space:
+ value = GDK_KEY_quotedbl; break;
+
+ case 'a': value = GDK_KEY_adiaeresis; break;
+ case 'A': value = GDK_KEY_Adiaeresis; break;
+ case 'e': value = GDK_KEY_ediaeresis; break;
+ case 'E': value = GDK_KEY_Ediaeresis; break;
+ case 'i': value = GDK_KEY_idiaeresis; break;
+ case 'I': value = GDK_KEY_Idiaeresis; break;
+ case 'o': value = GDK_KEY_odiaeresis; break;
+ case 'O': value = GDK_KEY_Odiaeresis; break;
+ case 'u': value = GDK_KEY_udiaeresis; break;
+ case 'U': value = GDK_KEY_Udiaeresis; break;
+ case 'y': value = GDK_KEY_ydiaeresis; break;
+ case 'Y': value = GDK_KEY_Ydiaeresis; break;
+ }
+ break;
+
+ case GDK_KEY_dead_acute:
+ switch (priv->compose_buffer[1])
+ {
+ case 'c': value = GDK_KEY_ccedilla; break;
+ case 'C': value = GDK_KEY_Ccedilla; break;
+ }
+ break;
+ }
+ }
+
+ if (value > 0)
+ {
+ gtk_im_context_simple_commit_char (GTK_IM_CONTEXT (context_simple),
+ gdk_keyval_to_unicode (value));
+ priv->compose_buffer[0] = 0;
+
+ GTK_NOTE (MISC, g_print ("quartz: U+%04X\n", value));
+ return TRUE;
+ }
+
+ return FALSE;
+}
+
+#endif
+
+static gboolean
+check_compact_table (GtkIMContextSimple *context_simple,
+ const GtkComposeTableCompact *table,
+ gint n_compose)
{
GtkIMContextSimplePrivate *priv = context_simple->priv;
gint row_stride;
guint16 *seq_index;
- guint16 *seq;
+ guint16 *seq;
gint i;
+ gboolean match;
+ gunichar value;
/* Will never match, if the sequence in the compose buffer is longer
* than the sequences in the table. Further, compare_seq (key, val)
- * will overrun val if key is longer than val. */
+ * will overrun val if key is longer than val.
+ */
if (n_compose > table->max_seq_len)
return FALSE;
seq_index = bsearch (priv->compose_buffer,
- table->data, table->n_index_size,
- sizeof (guint16) * table->n_index_stride,
- compare_seq_index);
+ table->data,
+ table->n_index_size,
+ sizeof (guint16) * table->n_index_stride,
+ compare_seq_index);
if (!seq_index)
{
GTK_NOTE (MISC, g_print ("compact: %d ", *seq_index));
seq = NULL;
+ match = FALSE;
- for (i = n_compose-1; i < table->max_seq_len; i++)
+ for (i = n_compose - 1; i < table->max_seq_len; i++)
{
row_stride = i + 1;
- if (seq_index[i+1] - seq_index[i] > 0)
+ if (seq_index[i + 1] - seq_index[i] > 0)
{
- seq = bsearch (priv->compose_buffer + 1,
- table->data + seq_index[i], (seq_index[i+1] - seq_index[i]) / row_stride,
- sizeof (guint16) * row_stride,
- compare_seq);
+ seq = bsearch (priv->compose_buffer + 1,
+ table->data + seq_index[i],
+ (seq_index[i + 1] - seq_index[i]) / row_stride,
+ sizeof (guint16) * row_stride,
+ compare_seq);
- if (seq)
+ if (seq)
{
if (i == n_compose - 1)
- break;
+ {
+ value = seq[row_stride - 1];
+ match = TRUE;
+ }
else
{
+ if (match)
+ {
+ GTK_NOTE (MISC, g_print ("tentative match U+%04X ", value));
+ priv->tentative_match = value;
+ priv->tentative_match_len = n_compose;
+ }
+
g_signal_emit_by_name (context_simple, "preedit-changed");
- GTK_NOTE (MISC, g_print ("yes\n"));
- return TRUE;
+ GTK_NOTE (MISC, g_print ("yes\n"));
+ return TRUE;
}
}
}
}
- if (!seq)
+ if (match)
{
- GTK_NOTE (MISC, g_print ("no\n"));
- return FALSE;
- }
- else
- {
- gunichar value;
-
- value = seq[row_stride - 1];
-
gtk_im_context_simple_commit_char (GTK_IM_CONTEXT (context_simple), value);
#ifdef G_OS_WIN32
check_win32_special_case_after_compact_match (context_simple, n_compose, value);
}
/* This function receives a sequence of Unicode characters and tries to
- * normalize it (NFC). We check for the case the the resulting string
+ * normalize it (NFC). We check for the case where the resulting string
* has length 1 (single character).
* NFC normalisation normally rearranges diacritic marks, unless these
* belong to the same Canonical Combining Class.
/* Xorg reuses dead_tilde for the perispomeni diacritic mark.
* We check if base character belongs to Greek Unicode block,
- * and if so, we replace tilde with perispomeni. */
+ * and if so, we replace tilde with perispomeni.
+ */
if (combination_buffer[0] >= 0x390 && combination_buffer[0] <= 0x3FF)
{
for (i = 1; i < n_compose; i++ )
{
g_unicode_canonical_ordering (combination_buffer_temp, n_compose);
combination_utf8_temp = g_ucs4_to_utf8 (combination_buffer_temp, -1, NULL, NULL, NULL);
- nfc_temp = g_utf8_normalize (combination_utf8_temp, -1, G_NORMALIZE_NFC);
+ nfc_temp = g_utf8_normalize (combination_utf8_temp, -1, G_NORMALIZE_NFC);
if (g_utf8_strlen (nfc_temp, -1) == 1)
{
i--;
}
- /* If the buffer normalizes to a single character,
- * then modify the order of combination_buffer accordingly, if necessary,
- * and return TRUE.
+ /* If the buffer normalizes to a single character, then modify the order
+ * of combination_buffer accordingly, if necessary, and return TRUE.
*/
if (check_normalize_nfc (combination_buffer, n_compose))
{
/* In addition to the table-driven sequences, we allow Unicode hex
* codes to be entered. The method chosen here is similar to the
* one recommended in ISO 14755, but not exactly the same, since we
- * don't want to steal 16 valuable key combinations.
- *
+ * don't want to steal 16 valuable key combinations.
+ *
* A hex Unicode sequence must be started with Ctrl-Shift-U, followed
* by a sequence of hex digits entered with Ctrl-Shift still held.
* Releasing one of the modifiers or pressing space while the modifiers
n = strtoul (str->str, &nptr, 16);
- /* if strtoul fails it probably means non-latin digits were used;
+ /* If strtoul fails it probably means non-latin digits were used;
* we should in principle handle that, but we probably don't.
*/
if (nptr - str->str < str->len)
return TRUE;
#endif
+#ifdef GDK_WINDOWING_QUARTZ
+ if (check_quartz_special_cases (context_simple, n_compose))
+ return TRUE;
+#endif
+
if (check_compact_table (context_simple, >k_compose_table_compact, n_compose))
return TRUE;
projects / ~andy / gtk / blobdiff