daliborfilus

I0608 18:44:49.662015       7 probe.go:119] details filled by udev probe
I0608 18:44:49.662287       7 sysfsprobe.go:97] blockdevice path: /dev/sdc2 capacity :4000261676544 filled by sysfs probe.
I0608 18:44:49.662564       7 sysfsprobe.go:125] blockdevice path: /dev/sdc2 logical block size :512 filled by sysfs probe.
I0608 18:44:49.662656       7 sysfsprobe.go:137] blockdevice path: /dev/sdc2 physical block size :4096 filled by sysfs probe.
I0608 18:44:49.662732       7 sysfsprobe.go:149] blockdevice path: /dev/sdc2 hardware sector size :512 filled by sysfs probe.
I0608 18:44:49.662811       7 sysfsprobe.go:160] blockdevice path: /dev/sdc2 drive type :HDD filled by sysfs probe.
I0608 18:44:49.662826       7 probe.go:119] details filled by sysfs probe
I0608 18:44:49.668362       7 probe.go:119] details filled by smart probe
I0608 18:44:49.669684       7 mountprobe.go:134] no mount point found for /dev/sdc2. clearing mount points if any
I0608 18:44:49.669693       7 probe.go:119] details filled by mount probe

daliborfilus

I0607 15:14:32.862162       8 sysfsprobe.go:97] blockdevice path: /dev/sda1 capacity :512753664 filled by sysfs probe.
I0607 15:14:32.862264       8 sysfsprobe.go:125] blockdevice path: /dev/sda1 logical block size :512 filled by sysfs probe.
I0607 15:14:32.862313       8 sysfsprobe.go:137] blockdevice path: /dev/sda1 physical block size :512 filled by sysfs probe.
I0607 15:14:32.862360       8 sysfsprobe.go:149] blockdevice path: /dev/sda1 hardware sector size :512 filled by sysfs probe.
I0607 15:14:32.862397       8 sysfsprobe.go:160] blockdevice path: /dev/sda1 drive type :SSD filled by sysfs probe.
I0607 15:14:32.862403       8 probe.go:119] details filled by sysfs probe
I0607 15:14:32.862674       8 probe.go:119] details filled by smart probe
I0607 15:14:32.864097       8 probe.go:119] details filled by mount probe
I0607 15:14:32.864105       8 probe.go:119] details filled by blkid probe
I0607 15:14:32.865493       8 probe.go:119] details filled by used-by probe

daliborfilus

/*
 * Licensed to ElasticSearch and Shay Banon under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership. ElasticSearch 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

daliborfilus

#include <stdio.h>

int p1, p2, p5, p10, p20, p50, p100, p200;

int main() {
  printf("Starting...\n");
  int n = 200;
  int combinations = 0;
  for(p1 = 0; p1 <= n; p1 += 1) {
    for(p2 = 0; p2 <= n; p2 += 2) {

daliborfilus

package benchmarks;
import java.util.Hashtable;
//import java.util.Map;
//import java.util.HashMap;

class Hash {

    public static void main(String[] args) {
        Integer i = new Integer(0);
        //int i = 0;