- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 710 for cyclic (0.38 sec)
-
maven-core/src/test/java/org/apache/maven/DefaultMavenTest.java
} @Test void testThatErrorDuringProjectDependencyGraphCreationAreStored() throws Exception { MavenExecutionRequest request = createMavenExecutionRequest(getProject("cyclic-reference")).setGoals(asList("validate")); MavenExecutionResult result = maven.execute(request); assertEquals(ProjectCycleException.class, result.getExceptions().get(0).getClass()); } @Test
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/utils/utils.h
(void)matchPattern(permutation2, m_Constant(&perm2_const)); return RemapPermutation(permutation1, perm2_const); } // Returns true if the transpose op is trivial. Trivial means that // the permutation is a cyclic permutation of the original shape with only the // identity dimensions permuted. inline bool IsTransposeTrivial(llvm::ArrayRef<int64_t> input_shape, Value perm) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 00:40:15 UTC 2024 - 11.6K bytes - Viewed (0) -
tensorflow/cc/saved_model/testdata/generate_saved_models.py
class ReferencesParent(module.Module): def __init__(self, parent): super(ReferencesParent, self).__init__() self.parent = parent self.my_variable = variables.Variable(3., name="MyVariable") # Creates a cyclic object graph. class CyclicModule(module.Module): def __init__(self): super(CyclicModule, self).__init__() self.child = ReferencesParent(self) class AssetModule(module.Module):
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Sep 18 18:06:18 UTC 2023 - 4.6K bytes - Viewed (0) -
src/cmd/compile/internal/types/identity.go
default: return false } } cont: // Any cyclic type must go through a named type, and if one is // named, it is only identical to the other if they are the // same pointer (t1 == t2), so there's no chance of chasing // cycles ad infinitum, so no need for a depth counter. if assumedEqual == nil { assumedEqual = make(map[typePair]struct{})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 20:57:01 UTC 2023 - 4.6K bytes - Viewed (0) -
src/go/ast/commentmap_test.go
// Copyright 2012 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // To avoid a cyclic dependency with go/parser, this file is in a separate package. package ast_test import ( "fmt" . "go/ast" "go/parser" "go/token" "sort" "strings" "testing" ) const src = ` // the very first comment // package p
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 15:35:30 UTC 2022 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/EvictingQueue.java
* attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). * * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a * full queue, the queue automatically removes its head element. This is different from conventional
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:52:55 UTC 2023 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EvictingQueue.java
* attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). * * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a * full queue, the queue automatically removes its head element. This is different from conventional
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:52:55 UTC 2023 - 4.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/utils/utils.td
// Constraint that values in list attribute are all ones. def IsAllOnesConstant : Constraint<CPred<"TFL::IsAllOnesConstant($0)">>; // Constraint that checks if the transpose op is trivial. Trivial means that // the permutation is a cyclic permutation of the original shape with only the // identity dimensions permuted. def IsTransposeTrivial : Constraint<CPred< "TFL::IsTransposeTrivial($0.getType().cast<ShapedType>().getShape(), $1)">>;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 00:40:15 UTC 2024 - 4.8K bytes - Viewed (0) -
src/cmd/compile/internal/types2/alias.go
for a := a0; a != nil; a, _ = t.(*Alias) { t = a.fromRHS } if t == nil { panic(fmt.Sprintf("non-terminated alias %s", a0.obj.name)) } // Memoize the type only if valid. // In the presence of unfinished cyclic declarations, Unalias // would otherwise latch the invalid value (#66704). // TODO(adonovan): rethink, along with checker.typeDecl's use // of Invalid to mark unfinished aliases. if t != Typ[Invalid] { a0.actual = t
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 5K bytes - Viewed (0) -
src/go/types/alias.go
for a := a0; a != nil; a, _ = t.(*Alias) { t = a.fromRHS } if t == nil { panic(fmt.Sprintf("non-terminated alias %s", a0.obj.name)) } // Memoize the type only if valid. // In the presence of unfinished cyclic declarations, Unalias // would otherwise latch the invalid value (#66704). // TODO(adonovan): rethink, along with checker.typeDecl's use // of Invalid to mark unfinished aliases. if t != Typ[Invalid] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 5.1K bytes - Viewed (0)