*                     "Eric Glass" <jcifs at samba dot org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,

     */
    public NdrHyper(final long value) {
        this.value = value;
    }

    @Override
    public void encode(final NdrBuffer dst) throws NdrException {
        dst.enc_ndr_hyper(this.value);
    }

    @Override
    public void decode(final NdrBuffer src) throws NdrException {
        this.value = src.dec_ndr_hyper();
    }

     */
    public NdrLong(final int value) {
        this.value = value;
    }

    @Override
    public void encode(final NdrBuffer dst) throws NdrException {
        dst.enc_ndr_long(this.value);
    }

    @Override
    public void decode(final NdrBuffer src) throws NdrException {
        this.value = src.dec_ndr_long();
    }

 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0

            }
            this.days = new int[list.size()];
            for (int i = 0; i < list.size(); i++) {
                this.days[i] = list.get(i);
            }
            this.delay = delay;
            reverse = compareTime(fromHours, fromMinutes, toHours, toMinutes) < 0;
        }

        /**
         * Gets the delay amount for this rule.
         *

            final long queryTime, final boolean partialResults, final FacetResponse facetResponse) {
        this.documentList = documentList;
        this.allRecordCount = allRecordCount;
        this.allRecordCountRelation = allRecordCountRelation;
        this.queryTime = queryTime;
        this.partialResults = partialResults;
        this.facetResponse = facetResponse;
    }

    /**

        @Override
        Multiset<K> multiset() {
          return Keys.this;
        }

        @Override
        public Iterator<Multiset.Entry<K>> iterator() {
          return Keys.this.entryIterator();
        }

        @Override
        public int size() {
          return FilteredEntryMultimap.this.keySet().size();
        }

         * @param dir directory file
         */
        public ChangeNotificationHandle(String path, Smb2LeaseKey key, SmbFile dir) {
            this.directoryPath = path;
            this.leaseKey = key;
            this.directoryFile = dir;
            this.active = true;
        }

        /**
         * Gets the path of the directory being monitored
         * @return the directory path
         */

erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution, one of the nodes would participate more drives. To avoid this the affinity is given towards nodes which leads to next best GCD factor of 12 which provides uniform distribution.

- In this algorithm, we also make sure that we spread the drives out...

        this.errorCode = errorCode;
        this.originalMessage = message;
        this.retryPolicy = retryPolicy != null ? retryPolicy : RetryPolicy.DEFAULT;
        this.context = context != null ? new HashMap<>(context) : new HashMap<>();
        this.operationStartTime = System.currentTimeMillis();
        this.operationName = extractOperationName();
        this.attemptNumber = 1;