Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for Xlogue (0.12 sec)

  1. src/cmd/internal/src/pos.go

    }
    
    // withXlogue attaches a prologue/epilogue attribute to a lico
    func (x lico) withXlogue(xlogue PosXlogue) lico {
    	if x == 0 {
    		if xlogue == 0 {
    			return x
    		}
    		// Normalize 0 to "not a statement"
    		x = lico(PosNotStmt << isStmtShift)
    	}
    	return lico(uint(x) & ^uint(xlogueMax<<xlogueShift) | (uint(xlogue) << xlogueShift))
    }
    
    // withStmt returns a lico for the same location with specified is_stmt attribute
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 01 15:52:41 UTC 2023
    - 15.5K bytes
    - Viewed (0)
  2. src/cmd/internal/obj/dwarf.go

    	fileIndex := 1
    	prologue, wrotePrologue := false, false
    	// Walk the progs, generating the DWARF table.
    	for p := s.Func().Text; p != nil; p = p.Link {
    		prologue = prologue || (p.Pos.Xlogue() == src.PosPrologueEnd)
    		// If we're not at a real instruction, keep looping!
    		if p.Pos.Line() == 0 || (p.Link != nil && p.Link.Pc == p.Pc) {
    			continue
    		}
    		newStmt := p.Pos.IsStmt() != src.PosNotStmt
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 01 20:40:28 UTC 2023
    - 22K bytes
    - Viewed (0)
  3. okhttp/src/test/java/okhttp3/internal/tls/CertificatePinnerChainValidationTest.kt

            .certificatePinner(certificatePinner)
            .build()
    
        // Add a bad intermediate CA and have that issue a rogue certificate for localhost. Prepare
        // an SSL context for an attacking webserver. It includes both these rogue certificates plus the
        // trusted good certificate above. The attack is that by including the good certificate in the
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 23.8K bytes
    - Viewed (0)
  4. tensorflow/c/experimental/ops/math_ops.cc

      int num_retvals = 1;
      return op_ptr->Execute(absl::MakeSpan(z, 1), &num_retvals);
    }
    
    // Op: Log1p()
    // Summary: Computes natural logarithm of (1 + x) element-wise.
    //
    // Description:
    //   I.e., \\(y = \log_e (1 + x)\\).
    //
    //   Example:
    //
    //   ```python
    //   x = tf.constant([0, 0.5, 1, 5])
    //   tf.math.log1p(x) ==> [0., 0.4054651, 0.6931472, 1.7917595]
    //   ```
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue May 10 19:11:36 UTC 2022
    - 12.2K bytes
    - Viewed (0)
  5. pkg/controller/cronjob/utils_test.go

    			expectedEarliestTime:  *deltaTimeAfterTopOfTheHour(1 * time.Minute),
    			expectedTooManyMissed: manyMissed,
    		},
    		{
    			name: "rogue cronjob",
    			cj: &batchv1.CronJob{
    				ObjectMeta: metav1.ObjectMeta{
    					CreationTimestamp: metav1.NewTime(*deltaTimeAfterTopOfTheHour(10 * time.Second)),
    				},
    				Spec: batchv1.CronJobSpec{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu May 09 03:34:25 UTC 2024
    - 22.8K bytes
    - Viewed (0)
  6. docs/fr/docs/async.md

    ---
    
    Dans ce scénario de burgers parallèles, vous êtes un ordinateur / programme 🤖 avec deux processeurs (vous et votre crush 😍) attendant 🕙 à deux et dédiant votre attention 🕙 à "attendre devant le comptoir" pour une longue durée.
    
    Le fast-food a 8 processeurs (serveurs/cuisiniers) 👨‍🍳👨‍🍳👨‍🍳👨‍🍳👨‍🍳👨‍🍳👨‍🍳👨‍🍳. Alors que le fast-food de burgers concurrents en avait 2 (un serveur et un cuisinier).
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sun Mar 31 23:52:53 UTC 2024
    - 24K bytes
    - Viewed (0)
Back to top