Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 16 for Num (0.12 sec)

  1. tensorflow/c/c_api_experimental.cc

    TF_ShapeAndTypeList* TF_NewShapeAndTypeList(int num_items) {
      TF_ShapeAndTypeList* result = new TF_ShapeAndTypeList;
      result->num_items = num_items;
      result->items = (num_items == 0) ? nullptr : new TF_ShapeAndType[num_items]();
      return result;
    }
    
    void TF_ShapeAndTypeListSetShape(TF_ShapeAndTypeList* shape_list, int index,
                                     const int64_t* dims, int num_dims) {
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 29.4K bytes
    - Viewed (0)
  2. tensorflow/c/c_api.cc

                             int num_shapes) {
      std::vector<PartialTensorShape> shapes;
      shapes.reserve(num_shapes);
      for (int i = 0; i < num_shapes; ++i) {
        if (num_dims[i] < 0) {
          shapes.emplace_back();
        } else {
          shapes.emplace_back(ArraySlice<int64_t>(
              reinterpret_cast<const int64_t*>(dims[i]), num_dims[i]));
        }
      }
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 102.3K bytes
    - Viewed (0)
  3. tensorflow/c/c_api_test.cc

      const int batch_size = 4;
      const int num_dims = 2;
      int64_t* dims = new int64_t[num_dims];
      int64_t num_elements = 1;
      dims[0] = batch_size;
      dims[1] = 1;
      for (int64_t i = 0; i < num_dims; ++i) {
        num_elements *= dims[i];
      }
      TF_Tensor* t = TF_AllocateTensor(TF_STRING, dims, num_dims,
                                       sizeof(TF_TString) * num_elements);
      delete[] dims;
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 96.9K bytes
    - Viewed (3)
  4. tensorflow/c/c_api_function.cc

            // artificial restriction and require that when num_opers=-1, such
            // nodes must have a single output.
            if (node->num_outputs() != 1) {
              return InvalidArgument(
                  "When `num_opers` is set to -1, nodes referenced in `inputs` "
                  "must have a single output. Node ",
                  node->name(), " has ", node->num_outputs(),
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 13.6K bytes
    - Viewed (2)
  5. internal/grid/grid_test.go

    			n := 0
    			for i := range in {
    				if n > payloads {
    					panic("too many requests")
    				}
    
    				// t.Log("Got request:", *i)
    				out <- &testResponse{
    					OrgNum:    i.Num + pp.Num,
    					OrgString: pp.String + i.String,
    					Embedded:  *i,
    				}
    				n++
    			}
    			return nil
    		}))
    	}
    	register(local)
    	register(remote)
    
    	// local to remote
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Tue Apr 30 15:03:35 GMT 2024
    - 30.1K bytes
    - Viewed (0)
  6. maven-core/src/main/java/org/apache/maven/internal/aether/DefaultRepositorySystemSessionFactory.java

                        int num = Integer.parseInt(expression.substring(2, expression.length() - 1));
                        filters.add(new HighestVersionFilter(num));
                    } else if ("l".equals(expression)) {
                        filters.add(new LowestVersionFilter());
                    } else if (expression.startsWith("l(") && expression.endsWith(")")) {
    Java
    - Registered: Sun May 05 03:35:11 GMT 2024
    - Last Modified: Thu Apr 25 14:13:36 GMT 2024
    - 27.5K bytes
    - Viewed (0)
  7. tensorflow/c/eager/c_api_experimental.cc

    }
    
    TF_Tensor* TFE_AllocateHostTensor(TFE_Context* ctx, TF_DataType dtype,
                                      const int64_t* dims, int num_dims,
                                      TF_Status* status) {
      std::vector<int64_t> dimvec(num_dims);
      for (int i = 0; i < num_dims; ++i) {
        dimvec[i] = static_cast<int64_t>(dims[i]);
      }
    
      if (ctx == nullptr) {
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Apr 11 23:52:39 GMT 2024
    - 35.9K bytes
    - Viewed (3)
  8. schema/field.go

    			}
    		}
    	}
    
    	if num, ok := field.TagSettings["AUTOINCREMENTINCREMENT"]; ok {
    		field.AutoIncrementIncrement, _ = strconv.ParseInt(num, 10, 64)
    	}
    
    	if v, ok := field.TagSettings["DEFAULT"]; ok {
    		field.HasDefaultValue = true
    		field.DefaultValue = v
    	}
    
    	if num, ok := field.TagSettings["SIZE"]; ok {
    		if field.Size, err = strconv.Atoi(num); err != nil {
    			field.Size = -1
    		}
    	}
    
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Mon Apr 15 03:20:20 GMT 2024
    - 32K bytes
    - Viewed (1)
  9. common/config/.golangci.yml

        # default is false: such cases aren't reported by default.
        check-type-assertions: false
        # report about assignment of errors to blank identifier: `num, _ := strconv.Atoi(numStr)`;
        # default is false: such cases aren't reported by default.
        check-blank: false
      govet:
        disable:
          # report about shadowed variables
          - shadow
      goimports:
    Others
    - Registered: Wed May 08 22:53:08 GMT 2024
    - Last Modified: Mon Apr 22 19:22:39 GMT 2024
    - 11K bytes
    - Viewed (0)
  10. src/main/resources/fess_config.properties

    suggest.field.tags=label
    suggest.field.roles=role
    suggest.field.index.contents=content,title
    suggest.update.request.interval=0
    suggest.update.doc.per.request=2
    suggest.update.contents.limit.num.percentage=50%
    suggest.update.contents.limit.num=10000
    suggest.update.contents.limit.doc.size=50000
    suggest.source.reader.scroll.size=1
    suggest.popular.word.cache.size=1000
    suggest.popular.word.cache.expire=60
    Properties
    - Registered: Mon May 06 08:04:11 GMT 2024
    - Last Modified: Thu Apr 11 02:34:53 GMT 2024
    - 30.6K bytes
    - Viewed (1)
Back to top