affinity towards odd number 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...

   *       {@link Object#equals(Object)}.
   *   <li>{@code false} in all other situations.
   * </ul>
   *
   * <p>This assumes that any non-null objects passed to this function conform to the {@code
   * equals()} contract.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use {@link
   * java.util.Objects#equals} instead.
   */

   * return type is plain FilenameFilter. If we made such a change, then the annotation we choose
   * here would have no significance to end users, who would be forced to conform to the signature
   * used in FilenameFilter.)
   */
  @Override
  public boolean accept(File dir, String fileName) {
    return pattern.matcher(fileName).matches();
  }

 */
@NullUnmarked
public class LoadingCacheSingleThreadBenchmark {
  @Param({"1000", "2000"})
  int maximumSize;

  @Param("5000")
  int distinctKeys;

  @Param("4")
  int segments;

  // 1 means uniform likelihood of keys; higher means some keys are more popular
  // tweak this to control hit rate
  @Param("2.5")
  double concentration;

  Random random = new Random();

  LoadingCache<Integer, Integer> cache;

		[string] wchar_t *dfs_name;
	} DfsInfo300;

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo300 *s;
	} DfsEnumArray300;

	typedef union {
		[case(1)] DfsEnumArray1 *info1;
		[case(3)] DfsEnumArray3 *info3;
		[case(200)] DfsEnumArray200 *info200;
		[case(300)] DfsEnumArray300 *info300;
	} DfsEnumInfo;

	typedef struct {
		uint32_t level,
		[switch_is(level)] DfsEnumInfo e;
	} DfsEnumStruct;

 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package jcifs.smb1.smb1;

interface Info {
    int getAttributes();

    long getCreateTime();

    long getLastWriteTime();

    long getSize();

		[string] wchar_t *dfs_name;
	} DfsInfo300;

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo300 *s;
	} DfsEnumArray300;

	typedef union {
		[case(1)] DfsEnumArray1 *info1;
		[case(3)] DfsEnumArray3 *info3;
		[case(200)] DfsEnumArray200 *info200;
		[case(300)] DfsEnumArray300 *info300;
	} DfsEnumInfo;

	typedef struct {
		uint32_t level,
		[switch_is(level)] DfsEnumInfo e;
	} DfsEnumStruct;

  // to the given dividend, so that we don't have half of our divisions being
  // trivial because the divisor is bigger than the dividend.
  // Using remainder here does not give us a uniform distribution but it should
  // not have a big impact on the measurement.
  private static long randomDivisor(long dividend) {
    long r = randomSource.nextLong();
    if (dividend == -1) {
      return r;

        FileNotifyInformation info1 = notifications.get(0);
        assertEquals(FileNotifyInformation.FILE_ACTION_ADDED, info1.getAction());
        assertEquals("test1.txt", info1.getFileName());

        // Verify second notification
        FileNotifyInformation info2 = notifications.get(1);
        assertEquals(FileNotifyInformation.FILE_ACTION_MODIFIED, info2.getAction());

        // Although we cannot directly verify the super constructor call with Mockito for a real class,
        // we can infer its correct behavior if the object is successfully constructed and its own fields are correct.
        // The super constructor is called with (domainHandle, 0, acct_flags, null, 0)