In this paper, we introduce CDL, a software library designed for the analysis of permutations and linear orders subject to various structural restrictions. Prominent examples of these restrictions include pattern avoidance, a topic of interest in both computer science and combinatorics, and "never conditions" utilized in social choice and voting theory. CDL offers a range of fundamental functionalities, including identifying the permutations that meet specific restrictions and determining the isomorphism of such sets. To facilitate exploration across extensive domains, CDL incorporates multiple search strategies and heuristics.

翻译：本文介绍了CDL——一个旨在分析受多种结构约束的排列与线性序的软件库。这些约束的典型实例包括计算机科学和组合学共同关注的模式避免（pattern avoidance）条件，以及社会选择与投票理论中使用的“绝不条件”。CDL提供一系列基础功能，包括识别符合特定约束的排列，以及判定此类集合的同构性。为支持对大规模域的高效探索，CDL集成了多种搜索策略与启发式算法。