case 2:
        return nums.get(start).multiply(nums.get(start + 1));
      case 3:
        return nums.get(start).multiply(nums.get(start + 1)).multiply(nums.get(start + 2));
      default:
        // Otherwise, split the list in half and recursively do this.
        int m = (end + start) >>> 1;
        return listProduct(nums, start, m).multiply(listProduct(nums, m, end));
    }
  }

  /**

	var eventData []byte
	eventData, err = h.store.GetRaw(key)
	if err != nil {
		if os.IsNotExist(err) {
			return nil
		}
		return err
	}

	count := 1
	v := strings.Split(key.Name, ":")
	if len(v) == 2 {
		count, err = strconv.Atoi(v[0])
		if err != nil {
			return err
		}
	}

		if len(chkSums) > 0 {
			OA.Checksum = &objectAttributesChecksum{
				ChecksumCRC32:     strings.Split(chkSums["CRC32"], "-")[0],
				ChecksumCRC32C:    strings.Split(chkSums["CRC32C"], "-")[0],
				ChecksumSHA1:      strings.Split(chkSums["SHA1"], "-")[0],
				ChecksumSHA256:    strings.Split(chkSums["SHA256"], "-")[0],
				ChecksumCRC64NVME: strings.Split(chkSums["CRC64NVME"], "-")[0],
				ChecksumType:      chkSums[xhttp.AmzChecksumType],
			}

	if stmt.Schema, err = schema.ParseWithSpecialTableName(value, stmt.DB.cacheStore, stmt.DB.NamingStrategy, specialTableName); err == nil && stmt.Table == "" {
		if tables := strings.Split(stmt.Schema.Table, "."); len(tables) == 2 {
			stmt.TableExpr = &clause.Expr{SQL: stmt.Quote(stmt.Schema.Table)}
			stmt.Table = tables[1]
			return
		}

		stmt.Table = stmt.Schema.Table
	}
	return err

func NewChecksumWithType(alg ChecksumType, value string) *Checksum {
	if !alg.IsSet() {
		return nil
	}
	wantParts := 0
	if strings.ContainsRune(value, '-') {
		valSplit := strings.Split(value, "-")
		if len(valSplit) != 2 {
			return nil
		}
		value = valSplit[0]
		nParts, err := strconv.Atoi(valSplit[1])
		if err != nil {
			return nil
		}
		alg |= ChecksumMultipart

     */
    private Iterator<String> linesIterator() {
      return new AbstractIterator<String>() {
        final Iterator<String> lines = LINE_SPLITTER.split(seq).iterator();

        @Override
        protected @Nullable String computeNext() {
          if (lines.hasNext()) {
            String next = lines.next();
            // skip last line if it's empty

     */
    private Iterator<String> linesIterator() {
      return new AbstractIterator<String>() {
        final Iterator<String> lines = LINE_SPLITTER.split(seq).iterator();

        @Override
        protected @Nullable String computeNext() {
          if (lines.hasNext()) {
            String next = lines.next();
            // skip last line if it's empty

        def blocksTable = withCategories { blocksSection ? blocksSection.table[0] : parse('<table/>') }
        _ * classDoc.simpleName >> name.split('\\.').last()
        _ * classDoc.name >> name
        _ * classDoc.id >> (args.id ?: name)
        _ * classDoc.classSection >> content
        _ * classDoc.propertiesSection >> propertiesSection

            return ip;
        }

        // Use cached pattern for performance
        return IP_PATTERN.matcher(ip).replaceAll(mr -> {
            String[] parts = mr.group().split("\\.");
            if (parts.length == 4) {
                return parts[0] + "." + parts[1] + "." + parts[2] + ".xxx";
            }
            return mr.group();
        });
    }

                "'\\server.domain.com\\share\\deep\\path\\structure', 'server.domain.com', 'share', 'deep\\path\\structure'" })
        @DisplayName("Should split DFS paths correctly")
        void testDfsPathSplit(String node, String expectedServer, String expectedShare, String expectedPath) {
            when(mockReferral.getTtl()).thenReturn(300);