/**
     * This specialized method returns a Map of users and local groups for the
     * target server where keys are SIDs representing an account and each value
     * is an ArrayList of SIDs represents the local groups that the account is
     * a member of.
     *
     * This method is designed to assist with computing access control for a

      // Start with a suitably shaped collection of entries
      Collection<Entry<K, V>> originalEntries = mapGenerator.getSampleElements(elements.length);

      // Create a copy of that, with the desired value for each key
      Collection<Entry<K, V>> entries = new ArrayList<>(elements.length);
      int i = 0;
      for (Entry<K, V> entry : originalEntries) {
        entries.add(mapEntry(keysArray[i++], entry.getValue()));
      }

         * the JDK against TypeVariables returned by TypeResolver. To work with all JDK versions,
         * TypeResolver must return the appropriate TypeVariable implementation in each of the three
         * possible cases:
         *
         * 1. Under Android, the built-in TypeVariable implementation interoperates with ours.
         * Therefore, we can always create our own TypeVariable.
         *

  // (as in the case of ConstOp kernel creation on GPU, which involves copying a
  // CPU tensor to GPU).
  // Setting a larger thread pool does not help with the Swift caller, as we use
  // a different TFE context for each thread of execution (for running graph
  // functions, and their send/recvs corountines).
  config.set_inter_op_parallelism_threads(1);

  TF_Buffer* ret = TF_NewBuffer();
  TF_CHECK_OK(MessageToBuffer(config, ret));

 * available online).
 * <p>
 * Direct ACEs are evaluated first in order. The SID of the user performing
 * the operation and the desired access bits are compared to the SID
 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access

    private ArgumentCaptor<MsrpcSamrCloseHandle> closeHandleCaptor;

    @BeforeEach
    void setUp() {
        // Initialize mocks and captors before each test
        MockitoAnnotations.openMocks(this);
        openDomainCaptor = ArgumentCaptor.forClass(MsrpcSamrOpenDomain.class);
        closeHandleCaptor = ArgumentCaptor.forClass(MsrpcSamrCloseHandle.class);
    }

        LogStream.setInstance(stream1);
        LogStream instance1 = LogStream.getInstance();

        LogStream.setInstance(stream2);
        LogStream instance2 = LogStream.getInstance();

        // Each setInstance should create a new LogStream
        assertNotNull(instance1);
        assertNotNull(instance2);
        // The second setInstance replaces the first, so they should not be the same

      args.add(generateDummyArg(param, generator));
    }
    Object instance = createInstance(factory, args);
    List<Object> equalArgs = generateEqualFactoryArguments(factory, params, args);
    // Each group is a List of items, each item has a list of factory args.
    List<List<List<Object>>> argGroups = new ArrayList<>();
    argGroups.add(ImmutableList.of(args, equalArgs));
    EqualsTester tester =
        new EqualsTester(

containing debug information. Cgo parses the DWARF debug information
for __cgo__N to learn the type of each identifier. (The types also
distinguish functions from global variables.) Cgo reads the constant
values from the __cgodebug_* from the object file's data segment.

At this point cgo knows the meaning of each C.xxx well enough to start
the translation process.

Translating Go

</p>

<p>
Branches and direct jumps are always written as offsets to the PC, or as
jumps to labels:
</p>

<pre>
label:
	MOVW $0, R1
	JMP label
</pre>

<p>
Each label is visible only within the function in which it is defined.
It is therefore permitted for multiple functions in a file to define
and use the same label names.
Direct jumps and call instructions can target text symbols,