// Copyright (c) 2015-2022 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

#
# Other build options:
#     short_logs:       Only log errors during build, skip warnings.
#     verbose_logs:     Show all compiler warnings during build.
#     monolithic:       Build all TF C++ code into a single shared object.
#     dynamic_kernels:  Try to link all kernels dynamically (experimental).
#     dbg:              Build with debug info
#
# TF version options;
#     v2: Build TF v2
#

  config_info_line('numa', 'Build with NUMA support.')
  config_info_line(
      'dynamic_kernels',
      '(Experimental) Build kernels into separate shared objects.')
  config_info_line('v1', 'Build with TensorFlow 1 API instead of TF 2 API.')

  print('Preconfigured Bazel build configs to DISABLE default on features:')
  config_info_line('nogcp', 'Disable GCP support.')

</p>

<h3 id="finalizer">Finalizers</h3>

<p>
The <a href="/pkg/runtime/"><code>runtime</code></a> package provides
a <code>SetFinalizer</code> function that adds a finalizer to be called when
a particular object is no longer reachable by the program.
A call to <code>SetFinalizer(x, f)</code> is synchronized before the finalization call <code>f(x)</code>.
</p>

<h3 id="more">Additional Mechanisms</h3>

<p>

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

// Copyright (c) 2015-2023 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

pkg go/ast, type Node interface, Pos() token.Pos
pkg go/ast, type ObjKind int
pkg go/ast, type Object struct
pkg go/ast, type Object struct, Data interface{}
pkg go/ast, type Object struct, Decl interface{}
pkg go/ast, type Object struct, Kind ObjKind
pkg go/ast, type Object struct, Name string
pkg go/ast, type Object struct, Type interface{}
pkg go/ast, type Package struct

organization(1) gov(101) csor(3) nistAlgorithm(4) } // // hashAlgs OBJECT IDENTIFIER ::= { nistAlgorithms 2 } // // id-sha256 OBJECT IDENTIFIER ::= { hashAlgs 1 } // id-sha384 OBJECT IDENTIFIER ::= { hashAlgs 2 } // id-sha512 OBJECT IDENTIFIER ::= { hashAlgs 3 } // id-sha224 OBJECT IDENTIFIER ::= { hashAlgs 4 } // id-sha512-224 OBJECT IDENTIFIER ::= { hashAlgs 5 } // id-sha512-256 OBJECT IDENTIFIER ::= { hashAlgs 6 } // id-sha3-224 OBJECT IDENTIFIER ::= { hashAlgs 7 } // id-sha3-256 OBJECT IDENTIFIER...

</p>

<pre>
make([]int, 50, 100)
new([100]int)[0:50]
</pre>

<p>
Like arrays, slices are always one-dimensional but may be composed to construct
higher-dimensional objects.
With arrays of arrays, the inner arrays are, by construction, always the same length;
however with slices of slices (or arrays of slices), the inner lengths may vary dynamically.