* (no "hangs" due to incorrect use of {@link java.util.concurrent.locks.Condition#signal
 * Condition.signal}).
 *
 * <p>A thread is said to <i>occupy</i> a monitor if it has <i>entered</i> the monitor but not yet
 * <i>left</i>. Only one thread may occupy a given monitor at any moment. A monitor is also

 * An immutable object that may contain a non-null reference to another object. Each instance of
 * this type either contains a non-null reference, or contains nothing (in which case we say that
 * the reference is "absent"); it is never said to "contain {@code null}".
 *
 * <p>A non-null {@code Optional<T>} reference can be used as a replacement for a nullable {@code T}
 * reference. It allows you to represent "a {@code T} that must be present" and a "a {@code T} that

     * behavior, so it knows that `convert(a)` returns a non-nullable value, and we don't need to
     * perform even a cast, much less a runtime check.
     *
     * All that said, don't forget that everyone should call converter.convert() instead of
     * converter.apply(), anyway. If clients use only converter.convert(), then their nullness

     * determined experimentally to match our desired probability of false positives.
     */
    // NB: yes, this is surprisingly high, but that's what the experiments said was necessary
    // Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected,
    // and reduces the false-positive probability.
    static final int MAX_RUN_MULTIPLIER = 13;

    /**

    private String homeDirectory;
    private String homeDrive;
    private String serverName;
    private String domainName;
    private SID userSid;
    private SID groupSid;
    private SID[] groupSids;
    private SID[] resourceGroupSids;
    private SID[] extraSids;
    private int userAccountControl;
    private int userFlags;


    public PacLogonInfo ( byte[] data ) throws PACDecodingException {

     *            name associated with SIDs will be required, the SID_FLAG_RESOLVE_SIDS
     *            flag should be used which causes all group member SIDs to be resolved
     *            together in a single more efficient operation.
     * @return a map of group SID to member SIDs
     * @throws CIFSException
     */

import jcifs.dcerpc.rpc.sid_t;
import jcifs.smb.SID;


class LsarSidArrayX extends lsarpc.LsarSidArray {

    LsarSidArrayX ( jcifs.SID[] sids ) {
        this.num_sids = sids.length;
        this.sids = new lsarpc.LsarSidPtr[sids.length];
        for ( int si = 0; si < sids.length; si++ ) {
            this.sids[ si ] = new lsarpc.LsarSidPtr();
            this.sids[ si ].sid = sids[ si ].unwrap(sid_t.class);
        }

 */
package jcifs.pac;


import jcifs.smb.SID;


@SuppressWarnings ( "javadoc" )
public class PacSidAttributes {

    private SID id;
    private int attributes;


    public PacSidAttributes ( SID id, int attributes ) {
        super();
        this.id = id;
        this.attributes = attributes;
    }


    public SID getId () {
        return this.id;
    }

        System.arraycopy(bytes, 0, sidBytes, 8, bytes.length);

        return new SID(sidBytes, 0);
    }


    public SID readSid () throws IOException, PACDecodingException {
        int sidSize = readInt();
        byte[] bytes = new byte[8 + sidSize * 4];
        readFully(bytes);
        return new SID(bytes, 0);
    }


    public int skipBytes ( int n ) throws IOException {

            try ( LsaPolicyHandle policyHandle = new LsaPolicyHandle(handle, "\\\\" + server, 0x00000800) ) {
                MsrpcLookupSids rpc = new MsrpcLookupSids(policyHandle, new SID[] {
                    SID.EVERYONE
                });
                handle.sendrecv(rpc);

                assertEquals(0, rpc.retval);
            }
        }
    }