[op(0x00)]
	int LsarClose([in,out] policy_handle *handle);

	[op(0x07)]
	int LsarQueryInformationPolicy([in] policy_handle *handle,
			[in] uint16_t level,
			[out,switch_is(level),unique] LsarPolicyInfo *info);

	[op(0x0f)]
	int LsarLookupSids([in] policy_handle *handle,
			[in] LsarSidArray *sids,
			[out,unique] LsarRefDomainList *domains,
			[in,out] LsarTransNameArray *names,
			[in] uint16_t level,

	[op(0x00)]
	int LsarClose([in,out] policy_handle *handle);

	[op(0x07)]
	int LsarQueryInformationPolicy([in] policy_handle *handle,
			[in] uint16_t level,
			[out,switch_is(level),unique] LsarPolicyInfo *info);

	[op(0x0f)]
	int LsarLookupSids([in] policy_handle *handle,
			[in] LsarSidArray *sids,
			[out,unique] LsarRefDomainList *domains,
			[in,out] LsarTransNameArray *names,
			[in] uint16_t level,

            System.out.println("=== REPOSITORY LEAKAGE TEST RESULTS ===");
            System.out.println(
                    "Repositories in shared request after building child2: " + repositoriesAfterChild2.size());
            repositoriesAfterChild2.forEach(
                    repo -> System.out.println("  - " + repo.getId() + " (" + repo.getUrl() + ")"));

            System.out.println("Child1 project repositories:");

    // Schedule a job to cancel the call in 1 second.
    executor.schedule(() -> {
      System.out.printf("%.2f Canceling call.%n", (System.nanoTime() - startNanos) / 1e9f);
      call.cancel();
      System.out.printf("%.2f Canceled call.%n", (System.nanoTime() - startNanos) / 1e9f);
    }, 1, TimeUnit.SECONDS);

    System.out.printf("%.2f Executing call.%n", (System.nanoTime() - startNanos) / 1e9f);

        String destDir = "";
        if (args.length > 3) {
            destDir = args[3];
        }

        System.out.format("=> stylesheet %s%n", stylesheet);
        System.out.format("=> source %s%n", source);
        System.out.format("=> dest %s%n", dest);
        System.out.format("=> destDir %s%n", destDir);

        TransformerFactory factory = TransformerFactory.newInstance();

        if (done) {
          System.out.println("completed");
        } else {
          if (firstUpdate) {
            firstUpdate = false;
            if (contentLength == -1) {
              System.out.println("content-length: unknown");
            } else {
              System.out.format("content-length: %d\n", contentLength);
            }
          }

          System.out.println(bytesWritten);

./mc ls -r --versions sitea/bucket >/tmp/sitea.txt
./mc ls -r --versions siteb/bucket >/tmp/siteb.txt

out=$(diff -qpruN /tmp/sitea.txt /tmp/siteb.txt)
ret=$?
if [ $ret -ne 0 ]; then
	echo "BUG: expected no missing entries after replication: $out"
	exit 1
fi

./mc cp /tmp/data/file_1.txt sitea/bucket/marker_new
./mc rm sitea/bucket/marker_new

    @Test
    public void test() throws Exception {
        System.out.println(SystemUtil.FILE_ENCODING);
        System.out.println(SystemUtil.LINE_SEPARATOR);
        System.out.println(SystemUtil.PATH_SEPARATOR);
        System.out.println(SystemUtil.OS_NAME);
        System.out.println(SystemUtil.JAVA_IO_TMPDIR);
        System.out.println(SystemUtil.USER_DIR);
        System.out.println(SystemUtil.USER_HOME);
    }

        println("$name: $value")
      }
      println()
    }

    // Stream the response to the System.out as it is returned from the server.
    val out = System.out.sink()
    val source = response.body.source()
    while (!source.exhausted()) {
      out.write(source.buffer, source.buffer.size)
      out.flush()
    }

    response.body.close()
  } catch (e: IOException) {
    e.printStackTrace()
  } finally {

        for (GroupAnalysis group : sortedGroups) {
            System.out.printf("%nPaths ending with '%s':%n", group.name);
            System.out.printf("Total potential savings: %dKB%n", group.totalSavings / 1024);
            System.out.printf("Total memory: %dKB%n", group.totalMemory / 1024);
            System.out.printf("Total unique values: %d%n", group.totalUnique);
            System.out.printf("Total occurrences: %d%n", group.totalOccurrences);