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


TypeScript Traverse.firstChild方法代码示例

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


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

示例1: createEntry

const parseItem: Parser = (depth: number, itemSelection: Option<ItemSelection>, selectionState: Cell<boolean>, item: Element): Entry[] => {
  return Traverse.firstChild(item).filter(isList).fold(() => {

    // Update selectionState (start)
    itemSelection.each((selection) => {
      if (Compare.eq(selection.start, item)) {
        selectionState.set(true);
      }
    });

    const currentItemEntry = createEntry(item, depth, selectionState.get());

    // Update selectionState (end)
    itemSelection.each((selection) => {
      if (Compare.eq(selection.end, item)) {
        selectionState.set(false);
      }
    });

    const childListEntries: Entry[] = Traverse.lastChild(item)
      .filter(isList)
      .map((list) => parseList(depth, itemSelection, selectionState, list))
      .getOr([]);

    return currentItemEntry.toArray().concat(childListEntries);
  }, (list) => parseList(depth, itemSelection, selectionState, list));
};
开发者ID:danielpunkass,项目名称:tinymce,代码行数:27,代码来源:ParseLists.ts

示例2: function

const getFirstChildren = function (node) {
  return Traverse.firstChild(node).fold(
    Fun.constant([node]),
    function (child) {
      return [node].concat(getFirstChildren(child));
    }
  );
};
开发者ID:danielpunkass,项目名称:tinymce,代码行数:8,代码来源:SelectionUtils.ts

示例3: updateSelectionState

const parseItem: Parser = (depth: number, itemSelection: Option<ItemTuple>, selectionState: Cell<boolean>, item: Element): Entry[] => {
  const curriedParseList = Fun.curry(parseList, depth, itemSelection, selectionState);

  const updateSelectionState = (itemRange: ItemRange) => itemSelection.each((selection) => {
    if (Compare.eq(itemRange === ItemRange.Start ? selection.start : selection.end, item)) {
      selectionState.set(itemRange === ItemRange.Start);
    }
  });

  return Traverse.firstChild(item).filter(isList).fold(() => {
    updateSelectionState(ItemRange.Start);
    const fromCurrentItem: Entry = createEntry(item, depth, selectionState.get());
    updateSelectionState(ItemRange.End);
    const fromChildList: Entry[] = Traverse.lastChild(item).filter(isList).map(curriedParseList).getOr([]);

    return [ fromCurrentItem, ...fromChildList ];
  }, curriedParseList);
};
开发者ID:mdgbayly,项目名称:tinymce,代码行数:18,代码来源:ParseLists.ts

示例4:

const hasFirstChildList = (li: Element) => {
  return Traverse.firstChild(li).map(isList).getOr(false);
};
开发者ID:mdgbayly,项目名称:tinymce,代码行数:3,代码来源:Util.ts


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