当前位置: 首页>>代码示例>>Python>>正文


Python Node.is_markerless_label方法代码示例

本文整理汇总了Python中regparser.tree.struct.Node.is_markerless_label方法的典型用法代码示例。如果您正苦于以下问题:Python Node.is_markerless_label方法的具体用法?Python Node.is_markerless_label怎么用?Python Node.is_markerless_label使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在regparser.tree.struct.Node的用法示例。


在下文中一共展示了Node.is_markerless_label方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: _compress_markerless

# 需要导入模块: from regparser.tree.struct import Node [as 别名]
# 或者: from regparser.tree.struct.Node import is_markerless_label [as 别名]
def _compress_markerless(marker_list):
    """Remove repeated MARKERLESS markers. This will speed up depth
    computations as these paragraphs are redundant for its purposes"""
    result = []
    saw_markerless = False
    for marker in marker_list:
        if not Node.is_markerless_label([marker]):
            saw_markerless = False
            result.append(marker)
        elif not saw_markerless:
            saw_markerless = True
            result.append(marker)
    return result
开发者ID:cmc333333,项目名称:regulations-parser,代码行数:15,代码来源:derive.py

示例2: _decompress_markerless

# 需要导入模块: from regparser.tree.struct import Node [as 别名]
# 或者: from regparser.tree.struct.Node import is_markerless_label [as 别名]
def _decompress_markerless(assignment, marker_list):
    """Now that we have a specific solution, add back in the compressed
    MARKERLESS markers."""
    result = {}
    saw_markerless = False
    a_idx = -1      # idx in the assignment dict
    for m_idx, marker in enumerate(marker_list):
        if not Node.is_markerless_label([marker]):
            saw_markerless = False
            a_idx += 1
        elif not saw_markerless:
            saw_markerless = True
            a_idx += 1
        result['type{}'.format(m_idx)] = assignment['type{}'.format(a_idx)]
        result['idx{}'.format(m_idx)] = assignment['idx{}'.format(a_idx)]
        result['depth{}'.format(m_idx)] = assignment['depth{}'.format(a_idx)]
    return result
开发者ID:cmc333333,项目名称:regulations-parser,代码行数:19,代码来源:derive.py


注:本文中的regparser.tree.struct.Node.is_markerless_label方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。