From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from dmta0004.nifty.com (mta-snd00011.nifty.com [106.153.226.43]) by sourceware.org (Postfix) with ESMTPS id EADD53858C31 for ; Sat, 6 Jan 2024 17:35:38 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.4.2 sourceware.org EADD53858C31 Authentication-Results: sourceware.org; dmarc=fail (p=none dis=none) header.from=nifty.ne.jp Authentication-Results: sourceware.org; spf=fail smtp.mailfrom=nifty.ne.jp ARC-Filter: OpenARC Filter v1.0.0 sourceware.org EADD53858C31 Authentication-Results: server2.sourceware.org; arc=none smtp.remote-ip=106.153.226.43 ARC-Seal: i=1; a=rsa-sha256; d=sourceware.org; s=key; t=1704562543; cv=none; b=cT5P6bBp20sgZhpOMzGCLhyjwWaX25mIUjCGnhu/YJ/M7gUM1UeVNCgsyPP2Ylr4fsgh2g1vyE7mbwH0wSllKz5iomRxKKT69mUH3gnFO/ai3D0jrBZuwfMOl+g7nsOwsnCqwjMMymwqZnm4ClfHqj8sSszlFaoWxZymionprrI= ARC-Message-Signature: i=1; a=rsa-sha256; d=sourceware.org; s=key; t=1704562543; c=relaxed/simple; bh=pzjb6nKox1FK0mDpiZ//GKzsPt8Fl4GtZeL1C7joFpg=; h=From:To:Date:Message-Id:Subject; b=rJe8KRlvtDCwiyxWrIRkEdK++SmqBn3NUdHTmMdXSeSEaIwXz+mz81w2SYW65TKLShMi8+jWjZd6WSRLXycv8WS27GitdQnEal1E/QQ3+avRkpHl7WZ2PBOeS4UGFZXs93d4SWE+3yOPmMgpEhKHmwV81fqkUmcfu0R01p3G/mI= ARC-Authentication-Results: i=1; server2.sourceware.org Received: from localhost.localdomain by dmta0004.nifty.com with ESMTP id <20240106173536808.TTKF.109344.localhost.localdomain@nifty.com> for ; Sun, 7 Jan 2024 02:35:36 +0900 From: Takashi Yano To: cygwin-announce@cygwin.com Date: Sun, 07 Jan 2024 02:35:33 +0900 Message-Id: <20240107023533.9782-1-takashi.yano@nifty.ne.jp> Subject: libdatrie 0.2.13-1 X-Spam-Status: No, score=-2.8 required=5.0 tests=BAYES_00,KAM_DMARC_STATUS,KAM_NUMSUBJECT,SPF_HELO_PASS,SPF_PASS,TXREP,T_SCC_BODY_TEXT_LINE autolearn=no autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on server2.sourceware.org List-Id: The following packages have been uploaded to the Cygwin distribution: * libdatrie1-0.2.13-1 * libdatrie-devel-0.2.13-1 * libdatrie-doc-0.2.13-1 This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.