///

## Add extra information { #add-extra-information }

You can declare extra information in `Field`, `Query`, `Body`, etc. And it will be included in the generated JSON Schema.

You will learn more about adding extra information later in the docs, when learning to declare examples.

/// warning

Extra keys passed to `Field` will also be present in the resulting OpenAPI schema for your application.

gohostos="$(../bin/go env GOHOSTOS)"
gohostarch="$(../bin/go env GOHOSTARCH)"
goos="$(../bin/go env GOOS)"
goarch="$(../bin/go env GOARCH)"

# NOTE: Cannot invoke go command after this point.
# We're about to delete all but the cross-compiled binaries.
cd ..
if [ "$goos" = "$gohostos" -a "$goarch" = "$gohostarch" ]; then
	# cross-compile for local system. nothing to copy.
	# useful if you've bootstrapped yourself but want to

        // byteCount at 33 + 1 + 34*2 = 102
        ServerMessageBlock.writeInt2(0, buf, 102);

        int n = resp.decode(buf, 0);
        assertTrue(n > 0);
        // Implementation adds +8 words (16 bytes) to account for CSC extra
        assertEquals(42, resp.wordCount);
    }

    @Test
    @DisplayName("toString includes andxCommand and andxOffset")
    void testToStringContainsFields() {

        for (int invalidSize : invalidSizes) {
            byte[] buffer = new byte[256];

            // Handle negative values (will wrap around in writeInt2)
            if (invalidSize >= 0) {
                SMBUtil.writeInt2(invalidSize, buffer, 0);

                // When & Then

///

## Unteranwendungen

import jcifs.smb1.smb1.SecurityDescriptor;

/**
 * MS-RPC share information retrieval operation.
 *
 * This class implements the Server Service (SRVSVC) ShareGetInfo operation
 * for retrieving detailed information about a network share, including
 * security descriptors.
 */
public class MsrpcShareGetInfo extends srvsvc.ShareGetInfo {

    /**
     * Creates a new request to get share information.
     *

        return false;
      } else if (table[index] == c) { // Check for match.
        return true;
      } else { // Linear probing.
        index = (index + 1) & mask;
      }
      // Check to see if we wrapped around the whole table.
    } while (index != startingIndex);
    return false;
  }

  @Override
  void setBits(BitSet table) {
    if (containsZero) {
      table.set(0);
    }

  FILE_SEPARATOR("file.separator"),

  /** Path separator (":" on UNIX). */
  PATH_SEPARATOR("path.separator"),

  /** Line separator ("\n" on UNIX). */
  LINE_SEPARATOR("line.separator"),

  /** User's account name. */
  USER_NAME("user.name"),

  /** User's home directory. */
  USER_HOME("user.home"),

  /** User's current working directory. */
  USER_DIR("user.dir");

  private final String key;

import java.util.Collection;
import java.util.List;
import java.util.Map;
import org.jspecify.annotations.Nullable;

/**
 * Basic implementation of the {@link ListMultimap} interface. It's a wrapper around {@link
 * AbstractMapBasedMultimap} that converts the returned collections into {@code Lists}. The {@link
 * #createCollection} method must return a {@code List}.
 *
 * @author Jared Levy
 * @since 2.0
 */

 * }
 *
 * This works because those types each implement {@code PredecessorsFunction}. It will also work
 * with any other implementation of this interface.
 *
 * <p>If you have your own graph implementation based around a custom node type {@code MyNode},
 * which has a method {@code getParents()} that retrieves its predecessors in a graph:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getParents);
 * }
 *