Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 629 for points (0.04 sec)

  1. src/bytes/iter.go

    				start = i
    			}
    			i += size
    		}
    		if start >= 0 {
    			yield(s[start:len(s):len(s)])
    		}
    	}
    }
    
    // FieldsFuncSeq returns an iterator over subslices of s split around runs of
    // Unicode code points satisfying f(c).
    // The iterator yields the same subslices that would be returned by [FieldsFunc](s),
    // but without constructing a new slice containing the subslices.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  2. docs/hotfixes.md

    ```
    λ git checkout RELEASE.2021-04-22T15-44-28Z
    ```
    
    Create a branch and proceed to push the branch **upstream**
    > (upstream here points to ******@****.***:minio/minio.git)
    
    ```
    λ git branch -m RELEASE.2021-04-22T15-44-28Z.hotfix
    λ git push -u upstream RELEASE.2021-04-22T15-44-28Z.hotfix
    ```
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 14 21:36:02 UTC 2024
    - 5K bytes
    - Viewed (0)
  3. src/test/java/org/codelibs/fess/exception/JobProcessingExceptionTest.java

            assertNotNull(exception.getStackTrace());
            assertTrue(exception.getStackTrace().length > 0);
    
            // Verify the top of the stack trace points to this test method
            final StackTraceElement topElement = exception.getStackTrace()[0];
            assertEquals("test_stackTrace", topElement.getMethodName());
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 7K bytes
    - Viewed (0)
  4. docs/bigdata/README.md

    ### **4.1 Spark Pi**
    
    Test the Spark installation by running the following compute intensive example, which calculates pi by “throwing darts” at a circle. The program generates points in the unit square ((0,0) to (1,1)) and counts how many points fall within the unit circle within the square. The result approximates pi.
    
    Follow these steps to run the Spark Pi example:
    
    - Login as user **‘spark’**.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 14.7K bytes
    - Viewed (0)
  5. misc/cgo/gmp/gmp.go

    C union translates into a struct containing the first union member and
    perhaps additional padding.  C arrays become Go arrays.  C pointers
    become Go pointers.  C function pointers become Go's uintptr.
    C void pointers become Go's unsafe.Pointer.
    
    For example, mpz_t is defined in <gmp.h> as:
    
    	typedef unsigned long int mp_limb_t;
    
    	typedef struct
    	{
    		int _mp_alloc;
    		int _mp_size;
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Apr 11 16:34:30 UTC 2022
    - 9.5K bytes
    - Viewed (0)
  6. guava/src/com/google/common/escape/Escaper.java

     * string {@code "Foo<Bar>"}.
     *
     * <p>An {@code Escaper} instance is required to be stateless, and safe when used concurrently by
     * multiple threads.
     *
     * <p>Because, in general, escaping operates on the code points of a string and not on its
     * individual {@code char} values, it is not safe to assume that {@code escape(s)} is equivalent to
     * {@code escape(s.substring(0, n)) + escape(s.substring(n))} for arbitrary {@code n}. This is
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/escape/Escapers.java

        return new Builder();
      }
    
      /**
       * A builder for simple, fast escapers.
       *
       * <p>Typically an escaper needs to deal with the escaping of high valued characters or code
       * points. In these cases it is necessary to extend either {@link ArrayBasedCharEscaper} or {@link
       * ArrayBasedUnicodeEscaper} to provide the desired behavior. However this builder is suitable for
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java

      /**
       * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then
       * add the edge connecting them. We are not using the proxy methods here as we want to test {@code
       * putEdge} when the end-points are not elements of the graph.
       */
      @Test
      public void putEdge_nodesNotInGraph() {
        assume().that(graphIsMutable()).isTrue();
    
        graphAsMutableGraph.addNode(N1);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  9. docs/sts/wso2.md

    ## Get started
    
    ### 1. Prerequisites
    
    - JAVA 1.8 and above installed already and JAVA_HOME points to JAVA 1.8 installation.
    - Download WSO2 follow their [installation guide](https://docs.wso2.com/display/IS540/Installation+Guide).
    
    ### 2. Configure WSO2
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.7K bytes
    - Viewed (0)
  10. tensorflow/c/c_api.h

    // `proto` must point to an array of `proto_len` bytes representing a
    // binary-serialized TensorShapeProto.
    TF_CAPI_EXPORT extern void TF_SetAttrTensorShapeProto(
        TF_OperationDescription* desc, const char* attr_name, const void* proto,
        size_t proto_len, TF_Status* status);
    // `protos` and `proto_lens` must point to arrays of length `num_shapes`.
    // `protos[i]` must point to an array of `proto_lens[i]` bytes
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Thu Oct 26 21:08:15 UTC 2023
    - 82.3K bytes
    - Viewed (0)
Back to top