* @throws SmbException
     */
    public boolean isPossiblyDfs () throws SmbException {
        if ( this.connectionState.get() == 2 ) {
            // we are connected, so we know
            return isDfs();
        }
        try ( SmbTransportImpl transport = this.session.getTransport() ) {
            return transport.getNegotiateResponse().isDFSSupported();
        }
    }

   * remaining 7.0 permits, and the remaining 3.0, we serve them by fresh permits produced by the
   * rate limiter.
   *
   * We already know how much time it takes to serve 3 fresh permits: if the rate is
   * "1 token per second", then this will take 3 seconds. But what does it mean to serve 7 stored

     * other networking protocols the InputStream may need
     * to be passed to the readXxxWireFormat methods. This is
     * actually purer. However, in the case of smb we know the
     * wordCount and byteCount. And since every subclass of
     * ServerMessageBlock would have to perform the same read
     * operation on the input stream, we might as will pull that

      echo "Installing Calico CNI"
      install_calico "" "$(dirname "$CONFIG")"
      ;;

    "")
      # perfectly fine, we accepted the default KinD CNI
      ;;

    *)
      # we don't know what to do but we've got no CNI, return non-zero
      echo "${KUBERNETES_CNI} is not recognized. Supported options are \"calico\" or do not set the variable to use default."
      return 1
      ;;
  esac

			})
		}

		return
	}()

	validResp := 0
	totalResp := 0

	// minDisks value is only to reduce the number of calls
	// to the disks; this value is not accurate because we do
	// not know the storage class of the object yet
	minDisks := 0
	if p := globalStorageClass.GetParityForSC(""); p > -1 {
		minDisks = er.setDriveCount - p
	} else {
		minDisks = er.setDriveCount - er.defaultParityCount
	}

     * and then to XOR them together.  The STRIDE_TABLE enables us to hash an int followed by 12
     * zero bytes (3 ints), while the BYTE_TABLE is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

    Crc32cHasher() {
      super(16);
    }

    private boolean finished = false;

    /*

func analyzeTargetAsString() string {
	if allNamespaces {
		return "all namespaces"
	}
	return fmt.Sprintf("namespace: %s", selectedNamespace)
}

// TODO: Refactor output writer so that it is smart enough to know when to output what.
func isJSONorYAMLOutputFormat() bool {
	return msgOutputFormat == formatting.JSONFormat || msgOutputFormat == formatting.YAMLFormat
}

type Client struct {
	client kube.Client
	remote bool

freedom to distribute copies of free software (and charge for this
service if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs; and that you know you can do these things.

To protect your rights, we need to make restrictions that forbid anyone
to deny you these rights or to ask you to surrender the rights. These

    try {
      // We get the result, even if collectOneValue is a no-op, so that we can fail fast.
      // We use getUninterruptibly over getDone as a micro-optimization, we know the future is done.
      collectOneValue(index, getUninterruptibly(future));
    } catch (ExecutionException e) {
      handleException(e.getCause());
    } catch (Throwable t) { // sneaky checked exception

That way, you can create a token with an expiration of, let's say, 1 week. And then when the user comes back the next day with the token, you know that user is still logged in to your system.