- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 30 for closeDot (0.15 sec)
-
src/main/webapp/js/index.js
setTimeout(function() { $searchButton.attr("disabled", false); }, 3000); return true; }); $(document).on("click touchend", function(e) { if (!$(e.target).closest("#searchOptions, #searchOptionsButton").length) { $("#searchOptions").removeClass("active"); } }); $("[data-toggle='control-options']").click(function(e) { e.preventDefault();
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Mar 30 05:45:24 UTC 2023 - 2K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/json/json_test.go
Data: float64(math.MaxFloat64), Out: strconv.FormatFloat(math.MaxFloat64, 'g', -1, 64), }, { // Closest to zero without losing precision In: `2.2250738585072014e-308`, Data: float64(2.2250738585072014e-308), Out: `2.2250738585072014e-308`, }, { // float64 closest to zero In: `4.940656458412465441765687928682213723651e-324`, Data: float64(math.SmallestNonzeroFloat64),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jul 28 08:02:09 UTC 2022 - 9.3K bytes - Viewed (0) -
platforms/core-execution/file-watching/src/main/java/org/gradle/internal/watch/registry/impl/SnapshotWatchedDirectoryFinder.java
* so we learn if the file itself disappears or gets modified. * For directories, we only watch the directory itself, as we get * events for that. * In case of a missing file we need to find the closest existing * ancestor to watch so we can learn if the missing file respawns. */ public static File getDirectoryToWatch(FileSystemLocationSnapshot snapshot) { File path = new File(snapshot.getAbsolutePath());
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:38:01 UTC 2023 - 2.2K bytes - Viewed (0) -
pkg/kubelet/cm/topologymanager/numa_info.go
} return numaInfo, nil } func (n *NUMAInfo) Narrowest(m1 bitmask.BitMask, m2 bitmask.BitMask) bitmask.BitMask { if m1.IsNarrowerThan(m2) { return m1 } return m2 } func (n *NUMAInfo) Closest(m1 bitmask.BitMask, m2 bitmask.BitMask) bitmask.BitMask { // If the length of both bitmasks aren't the same, choose the one that is narrowest. if m1.Count() != m2.Count() { return n.Narrowest(m1, m2) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 09 16:52:14 UTC 2022 - 2.7K bytes - Viewed (0) -
pkg/kubelet/cm/topologymanager/policy_options.go
"fmt" "strconv" "k8s.io/apimachinery/pkg/util/sets" utilfeature "k8s.io/apiserver/pkg/util/feature" kubefeatures "k8s.io/kubernetes/pkg/features" ) const ( PreferClosestNUMANodes string = "prefer-closest-numa-nodes" ) var ( alphaOptions = sets.New[string]() betaOptions = sets.New[string]( PreferClosestNUMANodes, ) stableOptions = sets.New[string]() )
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Sep 27 13:02:15 UTC 2023 - 2.4K bytes - Viewed (0) -
platforms/enterprise/enterprise-operations/src/main/java/org/gradle/internal/taskgraph/CalculateTaskGraphBuildOperationType.java
* <p> * The graph is represented as a list of nodes (in no particular order) and their {@link PlannedNode#getNodeDependencies() dependencies}. * The dependencies of each node are the closest nodes in the plan whose type is in the given set. * * @param types an inclusive range-subset of node types starting with the {@link NodeIdentity.NodeType#TASK TASK}, such as {@code [TASK, TRANSFORM_STEP]}
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Jul 10 08:07:59 UTC 2023 - 3.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/return.go
// with a single-pass label/break matching phase. // hasBreak reports if s is or contains a break statement // referring to the label-ed statement or implicit-ly the // closest outer breakable statement. func hasBreak(s syntax.Stmt, label string, implicit bool) bool { switch s := s.(type) { default: panic("unreachable") case *syntax.DeclStmt, *syntax.EmptyStmt, *syntax.ExprStmt,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 4.4K bytes - Viewed (0) -
src/image/color/color.go
} // Palette is a palette of colors. type Palette []Color // Convert returns the palette color closest to c in Euclidean R,G,B space. func (p Palette) Convert(c Color) Color { if len(p) == 0 { return nil } return p[p.Index(c)] } // Index returns the index of the palette color closest to c in Euclidean // R,G,B,A space. func (p Palette) Index(c Color) int {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 8.3K bytes - Viewed (0) -
src/image/color/ycbcr_test.go
RGBA{0x40, 0x40, 0x40, 0x40}, } // Check that, for a Palette with no repeated colors, the closest color to // each element is itself. for i, c := range p { j := p.Index(c) if i != j { t.Errorf("Index(%v): got %d (color = %v), want %d", c, j, p[j], i) } } // Check that finding the closest color considers alpha, not just red, // green and blue. got := p.Convert(RGBA{0x80, 0x00, 0x00, 0x80})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 25 07:51:17 UTC 2016 - 7.3K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/initialization/layout/BuildLayoutFactoryTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 25 09:18:31 UTC 2024 - 6.9K bytes - Viewed (0)