return true;
      }
      if (object instanceof ShortArrayAsList) {
        ShortArrayAsList that = (ShortArrayAsList) object;
        int size = size();
        if (that.size() != size) {
          return false;
        }
        for (int i = 0; i < size; i++) {
          if (array[start + i] != that.array[that.start + i]) {
            return false;
          }
        }
        return true;
      }

     */
    public int processedCount() {
        return processedPoms.size();
    }

    /**
     * Returns the number of POMs modified.
     */
    public int modifiedCount() {
        return modifiedPoms.size();
    }

    /**
     * Returns the number of POMs that had errors.
     */
    public int errorCount() {
        return errorPoms.size();
    }

    /**

import jakarta.validation.constraints.Size;

/**
 * The edit form for Search Log.
 * This form handles the editing of search log entries in the administration interface.
 */
public class EditForm {

    /** CRUD operation mode indicator */
    @ValidateTypeFailure
    public int crudMode;

    /** Type of the search log entry */
    @Required
    @Size(max = 10)
    public String logType;

        String childName = "file1.txt";
        long size = 1024L;
        long lastModified = System.currentTimeMillis();
        boolean isDirectory = false;
        long attributes = 0x20; // FILE_ATTRIBUTE_ARCHIVE
        long creationTime = System.currentTimeMillis() - 10000;
        long lastAccessTime = System.currentTimeMillis() - 5000;

  }

  /**
   * Returns the number of bytes currently being used to store the values in this cache. This may be
   * greater than the max size if a background deletion is pending.
   */
  @Synchronized
  @Throws(IOException::class)
  fun size(): Long {
    initialize()
    return size
  }

  @Synchronized
  @Throws(IOException::class)
  internal fun completeEdit(
    editor: Editor,
    success: Boolean,

			tgtSizeS.pendingCount++
			tgtSizeS.pendingSize += oi.Size
			sizeS.pendingCount++
			sizeS.pendingSize += oi.Size
		case replication.Failed:
			tgtSizeS.failedSize += oi.Size
			tgtSizeS.failedCount++
			sizeS.failedSize += oi.Size
			sizeS.failedCount++
		case replication.Completed, replication.CompletedLegacy:
			tgtSizeS.replicatedSize += oi.Size
			tgtSizeS.replicatedCount++

		offset := ei.V2Obj.EcBSize * blockNum
		if offset >= m.size {
			return nil, fmt.Errorf("block %d out of range. offset %d > size %d", blockNum, offset, m.size)
		}
		m.blockOffset = offset
		m.blocks = (m.size + ei.V2Obj.EcBSize - 1) / ei.V2Obj.EcBSize
		if m.blocks > 0 {
			m.blocks--
		}
		if blockNum < m.blocks {
			m.size = ei.V2Obj.EcBSize
		} else {
			m.size -= offset
		}

		b, err := os.ReadFile(file)

        } catch (final Exception e) {
            maxBufferSize = 1000;
        }
        queue.offer(event);
        if (size.incrementAndGet() > maxBufferSize) {
            if (queue.poll() != null) {
                size.decrementAndGet();
            }
        }
    }

    /**
     * Drains all events from the buffer and returns them as a list.
     *

                node = readString(buffer, bufferIndex, len, (flags2 & FLAGS2_UNICODE) != 0);
            }

            return size;
        }

        @Override
        public String toString() {
            return ("Referral[" + "version=" + version + ",size=" + size + ",serverType=" + serverType + ",flags=" + flags + ",proximity="

        return true;
      }
      if (object instanceof IntArrayAsList) {
        IntArrayAsList that = (IntArrayAsList) object;
        int size = size();
        if (that.size() != size) {
          return false;
        }
        for (int i = 0; i < size; i++) {
          if (array[start + i] != that.array[that.start + i]) {
            return false;
          }
        }
        return true;
      }