bytesReader.reset(synonym.output.bytes, synonym.output.offset, synonym.output.length);
            final int code = bytesReader.readVInt();
            final int count = code >>> 1;
            for (int i = 0; i < count; i++) {
                synonymMap.words.get(bytesReader.readVInt(), scratchBytes);
                if (scratchChars.chars.length < scratchBytes.length) {

                    final Object count = contentMap.get("count");
                    if (count instanceof Number) {
                        return ((Number) count).longValue();
                    }
                }
            }
        } catch (final Exception e) {
            logger.debug("Failed to get document count: indexName={}", indexName, e);
        }
        return -1;
    }

}

// Cache structure and compaction:
//
// A cache structure will be kept with a tree of usages.
// The cache is a tree structure where each keeps track of its children.
//
// An uncompacted branch contains a count of the files only directly at the
// branch level, and contains link to children branches or leaves.
//
// The leaves are "compacted" based on a number of properties.

    private int countUniqueBytes(byte[] data) {
        boolean[] seen = new boolean[256];
        int count = 0;

        for (byte b : data) {
            int index = b & 0xFF;
            if (!seen[index]) {
                seen[index] = true;
                count++;
            }
        }

        return count;
    }

        return hasChanges;
    }

    /**
     * Get and increment inconsistency count
     *
     * @return the current inconsistency count
     */
    public int getInconsistencyCount() {
        return inconsistencyCount.getAndIncrement();
    }

    /**
     * Reset inconsistency count
     */
    public void resetInconsistencyCount() {
        inconsistencyCount.set(0);
    }

                    this.session.release();
                }
            }
        } else if (usage < 0) {
            log.error("Usage count dropped below zero " + this);
            dumpResource();
            throw new RuntimeCIFSException("Usage count dropped below zero");
        }
    }

    /**
     * @param stackTrace
     * @return
     */

            throw new IllegalArgumentException("Array must be a multiple of 8 bytes for DES encryption");
        }

        final byte[] cipherText = new byte[length];
        final int count = length / 8;

        for (int i = 0; i < count; i++) {
            encrypt(clearText, i * 8, cipherText, i * 8);
        }

        return cipherText;
    }

    /**

```
KEY:
storage_class  define object level redundancy

ARGS:
standard  (string)    set the parity count for default standard storage class e.g. "EC:4"
rrs       (string)    set the parity count for reduced redundancy storage class e.g. "EC:2"
comment   (sentence)  optionally add a comment to this setting
```

or environment variables

```
KEY:

	return association.Error
}

func (association *Association) Clear() error {
	return association.Replace()
}

func (association *Association) Count() (count int64) {
	if association.Error == nil {
		association.Error = association.buildCondition().Count(&count).Error
	}
	return
}

type assignBack struct {
	Source reflect.Value
	Index  int
	Dest   reflect.Value
}

	}
	AssertAssociationCount(t, user, "Languages", 1, "after delete one")
	// language row remains
	var count int64
	if err := DB.Model(&Language{}).Where("code = ?", "es").Count(&count).Error; err != nil {
		t.Fatalf("count lang: %v", err)
	}
	if count != 1 {
		t.Fatalf("expected language row still exists, got %d", count)
	}
}

// Multi-owners: HasMany update and delete