if (_netnamep != 0) {
                _src = _src.deferred;
                netname = _src.dec_ndr_string();

            }
        }
    }

    /**
     * Container for ShareInfo0 structures.
     */
    public static class ShareInfoCtr0 extends NdrObject {

        /**
         * Default constructor for ShareInfoCtr0.
         */
        public ShareInfoCtr0() {
        }

        /**

import jcifs.dcerpc.ndr.NdrBuffer;
import jcifs.dcerpc.ndr.NdrException;
import jcifs.dcerpc.ndr.NdrLong;
import jcifs.dcerpc.ndr.NdrObject;

/**
 * DCE/RPC interface for Distributed File System (DFS) operations.
 * Provides structures and methods for DFS management and enumeration.
 */
@SuppressWarnings("all")
public class netdfs {

    /**
     * Default constructor for netdfs
     */
    public netdfs() {
        // Default constructor

import jcifs.smb1.dcerpc.ndr.NdrException;
import jcifs.smb1.dcerpc.ndr.NdrLong;
import jcifs.smb1.dcerpc.ndr.NdrObject;

/**
 * DCE/RPC interface for Distributed File System (DFS) operations.
 * Provides structures and methods for DFS management and enumeration.
 */
public class netdfs {

    /**
     * Default constructor for netdfs
     */
    public netdfs() {
        // Default constructor
    }

    /**

            if (_netnamep != 0) {
                _src = _src.deferred;
                this.netname = _src.dec_ndr_string();

            }
        }
    }

    /**
     * Container for ShareInfo0 structures.
     */
    public static class ShareInfoCtr0 extends NdrObject {

        /**
         * Default constructor for ShareInfoCtr0.
         */
        public ShareInfoCtr0() {
        }

        /**

This way, its schema will show up in the API docs user interface:

<img src="/img/tutorial/dataclasses/image01.png">

## Dataclasses in Nested Data Structures { #dataclasses-in-nested-data-structures }

You can also combine `dataclasses` with other type annotations to make nested data structures.

 *
 * <p>It uses {@code Map} and {@code Queue} data structures to hold the data. The class provides
 * methods to add, remove, clear, and retrieve data from these structures.
 *
 * <p>The class is thread-safe due to the use of {@code synchronized} keyword on methods that
 * modify the internal data structures. The internal maps are also declared as {@code volatile}
 * to ensure visibility of changes across threads.

import java.util.ArrayList;
import java.util.Collection;

/**
 * This is the main graph data structure used by the RepositorySystem to present tree and graph objects.
 *
 *
 */
@Deprecated
public class MetadataGraph {
    /** all graph nodes */
    Collection<MetadataGraphNode> nodes;

    /** entry point for tree-like structures */
    MetadataGraphNode entry;

    public MetadataGraph(MetadataGraphNode entry) {

import java.math.BigInteger;
import java.util.Date;

import jcifs.SmbConstants;
import jcifs.smb.SID;

/**
 * Input stream for reading PAC data structures with proper alignment and byte ordering.
 * Handles little-endian byte order and data alignment requirements of PAC structures.
 */
public class PacDataInputStream {

    private final DataInputStream dis;
    private final int size;

    /**

 */
package jcifs.pac;

/**
 * Constants for PAC (Privilege Attribute Certificate) data structures.
 * Defines buffer types and other constants used in PAC parsing and validation.
 */
public interface PacConstants {

    /**
     * PAC structure version number.
     */
    int PAC_VERSION = 0;

    /**
     * Buffer type for user logon information.
     */

 * underlying (implementation specific) data structures to be shared.
 *
 * <p>The size of the data structure used by ArrayBasedCharEscaper and ArrayBasedUnicodeEscaper is
 * proportional to the highest valued character that has a replacement. For example a replacement
 * map containing the single character '{@literal \}u1000' will require approximately 16K of memory.