晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。 林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。 见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝) 既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。 南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。
| DIR:/opt/alt/libicu65/usr/share/doc/alt-libicu65-devel/samples/legacy/ |
| Current File : //opt/alt/libicu65/usr/share/doc/alt-libicu65-devel/samples/legacy/newcol.cpp |
/*
*******************************************************************************
*
* © 2016 and later: Unicode, Inc. and others.
* License & terms of use: http://www.unicode.org/copyright.html#License
*
*******************************************************************************
*******************************************************************************
*
* Copyright (C) 2001 - 2005, International Business Machines
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: newcol.cpp
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* created on: 2001jul24
* created by: Vladimir Weinstein
*/
/******************************************************************************
* This is the module that uses new collation
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include "unicode/ucol.h"
// Very simple example code - sticks a sortkey in the buffer
// Not much error checking
int32_t getSortKey_current(const char *locale, const UChar *string, int32_t sLen, uint8_t *buffer, int32_t bLen) {
UErrorCode status = U_ZERO_ERROR;
UCollator *coll = ucol_open(locale, &status);
if(U_FAILURE(status)) {
return -1;
}
int32_t result = ucol_getSortKey(coll, string, sLen, buffer, bLen);
ucol_close(coll);
return result;
}
// This one can be used for passing to qsort function
// Not thread safe or anything
static UCollator *compareCollator = NULL;
int compare_current(const void *string1, const void *string2) {
if(compareCollator != NULL) {
UCollationResult res = ucol_strcoll(compareCollator, (UChar *) string1, -1, (UChar *) string2, -1);
if(res == UCOL_LESS) {
return -1;
} else if(res == UCOL_GREATER) {
return 1;
} else {
return 0;
}
} else {
return 0;
}
}
void initCollator_current(const char *locale) {
UErrorCode status = U_ZERO_ERROR;
compareCollator = ucol_open(locale, &status);
}
void closeCollator_current(void) {
ucol_close(compareCollator);
compareCollator = NULL;
}
extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]) {
uint32_t i = 0;
int32_t keySize = 0;
UVersionInfo uvi;
u_getVersion(uvi);
fprintf(stderr, "Entered current, version: [%d.%d.%d.%d]\nMoving to sortkeys\n", uvi[0], uvi[1], uvi[2], uvi[3]);
for(i = 0; i<size; i++) {
keySize = getSortKey_current("ja", data[i], -1, keys[i], 32);
fprintf(stderr, "For i=%d, size of sortkey is %d\n", i, keySize);
}
fprintf(stderr, "Done sortkeys, doing qsort test\n");
initCollator_current("ja");
qsort(data, size, maxlen*sizeof(UChar), compare_current);
closeCollator_current();
fprintf(stderr, "Done current!\n");
}
|