public boolean isLoose() { return !isTight(); }
public boolean isParagraphInTightListItem(Paragraph node) { if (!isTight()) return false; // see if this is the first paragraph child item return isItemParagraph(node); }
@Override public void getAstExtra(StringBuilder out) { segmentSpanChars(out, openingMarker, "open"); segmentSpanChars(out, markerSuffix, "openSuffix"); if (isTight()) out.append(" isTight"); else out.append(" isLoose"); if (isHadBlankAfterItemParagraph()) out.append(" hadBlankLineAfter"); else if (isContainsBlankLine()) out.append(" hadBlankLine"); }
public boolean isTightListItem(ListItem node) { if (node.isLoose()) { return false; } boolean autoLoose = isAutoLoose(); if (autoLoose && isAutoLooseOneLevelLists()) { boolean singleLevel = node.getAncestorOfType(ListItem.class) == null && node.getChildOfType(ListBlock.class) == null; return node.getFirstChild() == null || !singleLevel && node.isTight() || singleLevel && node.isInTightList(); } else { return node.getFirstChild() == null || !autoLoose && node.isTight() || autoLoose && node.isInTightList(); } }
public boolean isLoose() { return !isTight(); }
public boolean isParagraphInTightListItem(Paragraph node) { if (!isTight()) return false; // see if this is the first paragraph child item return isItemParagraph(node); }
@Override public void getAstExtra(StringBuilder out) { segmentSpanChars(out, openingMarker, "open"); segmentSpanChars(out, markerSuffix, "openSuffix"); if (isTight()) out.append(" isTight"); else out.append(" isLoose"); if (isHadBlankAfterItemParagraph()) out.append(" hadBlankLineAfter"); else if (isContainsBlankLine()) out.append(" hadBlankLine"); }
public boolean isTightListItem(ListItem node) { if (node.isLoose()) { return false; } boolean autoLoose = isAutoLoose(); if (autoLoose && isAutoLooseOneLevelLists()) { boolean singleLevel = node.getAncestorOfType(ListItem.class) == null && node.getChildOfType(ListBlock.class) == null; return node.getFirstChild() == null || !singleLevel && node.isTight() || singleLevel && node.isInTightList(); } else { return node.getFirstChild() == null || !autoLoose && node.isTight() || autoLoose && node.isInTightList(); } }
while (iterator.hasNext()) { ListItem item1 = (ListItem) iterator.next(); if (!item1.isTight()) { thisItemLoose = true; isTight = false;
while (iterator.hasNext()) { ListItem item1 = (ListItem) iterator.next(); if (!item1.isTight()) { thisItemLoose = true; isTight = false;