* @param parentUrl the parent URL that referenced this child URL
     * @param weight the weight/priority of the child URL
     * @param depth the crawling depth of the child URL
     */
    @Override
    protected void storeChildUrl(final String childUrl, final String parentUrl, final float weight, final int depth) {
        if (StringUtil.isNotBlank(childUrl)) {

    - name: Checkout repository
      uses: actions/checkout@v2
      with:
        # We must fetch at least the immediate parents so that if this is
        # a pull request then we can checkout the head.
        fetch-depth: 2

    # If this run was triggered by a pull request event, then checkout
    # the head of the pull request instead of the merge commit.
    - run: git checkout HEAD^2
      if: ${{ github.event_name == 'pull_request' }}

      },
      "includedDocPaths": {
        "type": "keyword"
      },
      "excludedDocPaths": {
        "type": "keyword"
      },
      "configParameter": {
        "type": "keyword"
      },
      "depth": {
        "type": "integer"
      },
      "maxAccessCount": {
        "type": "long"
      },
      "numOfThread": {
        "type": "integer"
      },
      "intervalTime": {
        "type": "integer"

     */
    @CustomSize(maxKey = "form.admin.max.input.size")
    public String configParameter;

    /**
     * The maximum crawling depth from the starting URLs.
     */
    @Min(value = 0)
    @Max(value = 2147483647)
    @ValidateTypeFailure
    public Integer depth;

    /**
     * The maximum number of URLs to access during crawling.
     */
    @Min(value = 0)
    @Max(value = 9223372036854775807L)

      },
      "includedDocUrls": {
        "type": "keyword"
      },
      "excludedDocUrls": {
        "type": "keyword"
      },
      "configParameter": {
        "type": "keyword"
      },
      "depth": {
        "type": "integer"
      },
      "maxAccessCount": {
        "type": "long"
      },
      "userAgent": {
        "type": "keyword"
      },
      "numOfThread": {
        "type": "integer"

            doColumn("createdBy");
        }

        public void columnCreatedTime() {
            doColumn("createdTime");
        }

        public void columnDepth() {
            doColumn("depth");
        }

        public void columnDescription() {
            doColumn("description");
        }

        public void columnExcludedDocPaths() {
            doColumn("excludedDocPaths");

    }
  }

  /**
   * Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first
   * traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on.
   *
   * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration
   * is in progress or when the iterators generated by {@link #children} are advanced.

				// that the MkdirAll is retried once for the parent
				// of dirPath.
				// Because it is worth a retry to skip a different
				// baseDir which is slightly higher up the depth.
				nbaseDir := path.Dir(baseDir)
				if baseDir != "" && nbaseDir != "" && nbaseDir != SlashSeparator {
					baseDir = nbaseDir
				}
				continue
			}
		}
		break
	}
	return err
}

            result.setCreatedBy(DfTypeUtil.toString(source.get("createdBy")));
            result.setCreatedTime(DfTypeUtil.toLong(source.get("createdTime")));
            result.setDepth(DfTypeUtil.toInteger(source.get("depth")));
            result.setDescription(DfTypeUtil.toString(source.get("description")));
            result.setExcludedDocUrls(DfTypeUtil.toString(source.get("excludedDocUrls")));

        assertEquals("{labels.createdBy}", FessLabels.LABELS_CREATED_BY);
        assertEquals("{labels.createdTime}", FessLabels.LABELS_CREATED_TIME);
        assertEquals("{labels.depth}", FessLabels.LABELS_DEPTH);
        assertEquals("{labels.excludedPaths}", FessLabels.LABELS_EXCLUDED_PATHS);
        assertEquals("{labels.excludedUrls}", FessLabels.LABELS_EXCLUDED_URLS);