Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 785 for Nodes (0.04 sec)

  1. platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeStateTest.groovy

            def modules1 = endorseFrom1.targetComponent.nodes[0].ownStrictVersionConstraints.getModules()
            def modules2 = endorseFrom2.targetComponent.nodes[0].ownStrictVersionConstraints.getModules()
    
            modulesAll.size() == 5
            modules1.size() == 1
            modules2.size() == 4
    
            modulesAll == modules1 + modules2
    
            endorseFrom1.targetComponent.nodes[0].ownStrictVersionConstraints != endorsedStrictVersions
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Fri Jun 07 14:19:34 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  2. pkg/scheduler/internal/cache/cache.go

    	for k, v := range cache.nodes {
    		nodes[k] = v.info.Snapshot()
    	}
    
    	return &Dump{
    		Nodes:       nodes,
    		AssumedPods: cache.assumedPods.Union(nil),
    	}
    }
    
    // UpdateSnapshot takes a snapshot of cached NodeInfo map. This is called at
    // beginning of every scheduling cycle.
    // The snapshot only includes Nodes that are not deleted at the time this function is called.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Oct 24 09:56:48 UTC 2023
    - 24.9K bytes
    - Viewed (0)
  3. platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/conflicts/DefaultCapabilitiesConflictHandler.java

            final Set<NodeState> nodes = findNodesFor(capability);
            Collection<NodeState> implicitCapabilityProviders = candidate.getImplicitCapabilityProviders();
            nodes.addAll(implicitCapabilityProviders);
            NodeState node = candidate.getNode();
            if (nodes.add(node) && nodes.size() > 1) {
                // The registered nodes may contain nodes which are no longer selected.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Fri Jun 07 14:19:34 UTC 2024
    - 12.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/Traverser.java

        };
      }
    
      /**
       * Returns an unmodifiable {@code Iterable} over the nodes reachable from {@code startNode}, in
       * the order of a breadth-first traversal. That is, all the nodes of depth 0 are returned, then
       * depth 1, then 2, and so on.
       *
       * <p><b>Example:</b> The following graph with {@code startNode} {@code a} would return nodes in
       * the order {@code abcdef} (assuming successors are returned in alphabetical order).
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue May 30 20:12:45 UTC 2023
    - 19.8K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/Traverser.java

        };
      }
    
      /**
       * Returns an unmodifiable {@code Iterable} over the nodes reachable from {@code startNode}, in
       * the order of a breadth-first traversal. That is, all the nodes of depth 0 are returned, then
       * depth 1, then 2, and so on.
       *
       * <p><b>Example:</b> The following graph with {@code startNode} {@code a} would return nodes in
       * the order {@code abcdef} (assuming successors are returned in alphabetical order).
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue May 30 20:12:45 UTC 2023
    - 19.8K bytes
    - Viewed (0)
  6. pkg/scheduler/framework/plugins/noderesources/requested_to_capacity_ratio_test.go

    			shape:          shape,
    		},
    		{
    			name: "nothing scheduled, resources requested, differently sized nodes (default - least requested nodes have priority)",
    			requestedPod: st.MakePod().
    				Req(map[v1.ResourceName]string{"cpu": "1000", "memory": "2000"}).
    				Req(map[v1.ResourceName]string{"cpu": "2000", "memory": "3000"}).
    				Obj(),
    			nodes: []*v1.Node{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 21.2K bytes
    - Viewed (0)
  7. pkg/controller/testutil/test_utils.go

    		m.RequestCount++
    		m.lock.Unlock()
    	}()
    	var nodes []*v1.Node
    	for i := 0; i < len(m.UpdatedNodes); i++ {
    		if !contains(m.UpdatedNodes[i], m.DeletedNodes) {
    			nodes = append(nodes, m.UpdatedNodes[i])
    		}
    	}
    	for i := 0; i < len(m.Existing); i++ {
    		if !contains(m.Existing[i], m.DeletedNodes) && !contains(m.Existing[i], nodes) {
    			nodes = append(nodes, m.Existing[i])
    		}
    	}
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue May 28 08:48:22 UTC 2024
    - 15.6K bytes
    - Viewed (0)
  8. pkg/scheduler/framework/plugins/noderesources/least_allocated_test.go

    			// Node2 Score: (50 + 50) / 2 = 50
    			name: "nothing scheduled, resources requested, differently sized nodes",
    			requestedPod: st.MakePod().
    				Req(map[v1.ResourceName]string{"cpu": "1000", "memory": "2000"}).
    				Req(map[v1.ResourceName]string{"cpu": "2000", "memory": "3000"}).
    				Obj(),
    			nodes: []*v1.Node{
    				st.MakeNode().Name("node1").Capacity(map[v1.ResourceName]string{"cpu": "4000", "memory": "10000"}).Obj(),
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 18.8K bytes
    - Viewed (0)
  9. pkg/scheduler/framework/plugins/noderesources/most_allocated_test.go

    			// Node2 Score: (50 + 50) / 2 = 50
    			name: "nothing scheduled, resources requested, differently sized nodes",
    			requestedPod: st.MakePod().
    				Req(map[v1.ResourceName]string{"cpu": "1000", "memory": "2000"}).
    				Req(map[v1.ResourceName]string{"cpu": "2000", "memory": "3000"}).
    				Obj(),
    			nodes: []*v1.Node{
    				st.MakeNode().Name("node1").Capacity(map[v1.ResourceName]string{"cpu": "4000", "memory": "10000"}).Obj(),
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 16K bytes
    - Viewed (0)
  10. src/cmd/compile/internal/walk/assign.go

    //	}
    //	s
    //
    // l2 is allowed to be a string.
    func appendSlice(n *ir.CallExpr, init *ir.Nodes) ir.Node {
    	walkAppendArgs(n, init)
    
    	l1 := n.Args[0]
    	l2 := n.Args[1]
    	l2 = cheapExpr(l2, init)
    	n.Args[1] = l2
    
    	var nodes ir.Nodes
    
    	// var s []T
    	s := typecheck.TempAt(base.Pos, ir.CurFunc, l1.Type())
    	nodes.Append(ir.NewAssignStmt(base.Pos, s, l1)) // s = l1
    
    	elemtype := s.Type().Elem()
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 17:09:06 UTC 2024
    - 20.3K bytes
    - Viewed (0)
Back to top