Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 99 for size_t (0.26 sec)

  1. tensorflow/c/c_api_test.cc

                              std::unique_ptr<const void*[]>* ptrs,
                              std::unique_ptr<size_t[]>* lens) {
      ptrs->reset(new const void*[v.size()]);
      lens->reset(new size_t[v.size()]);
      for (size_t i = 0; i < v.size(); ++i) {
        (*ptrs)[i] = v[i].data();
        (*lens)[i] = v[i].size();
      }
    }
    
    class CApiColocationTest : public ::testing::Test {
     protected:
    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)
  2. tensorflow/c/eager/c_api_experimental.cc

      void* data = tensorflow::port::Malloc(value.length());
      value.copy(static_cast<char*>(data), value.length(), 0);
      buf->data = data;
      buf->length = value.length();
      buf->data_deallocator = [](void* data, size_t length) {
        tensorflow::port::Free(data);
      };
    }
    
    TFE_MonitoringStringGauge0* TFE_MonitoringNewStringGauge0(
        const char* name, TF_Status* status, const char* description) {
    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)
  3. tensorflow/c/c_api_experimental.cc

    }
    
    const char* TF_GraphDebugString(TF_Graph* graph, size_t* len) {
      tensorflow::mutex_lock c(graph->mu);
      const auto& debug_str = graph->graph.ToGraphDefDebug().DebugString();
      *len = debug_str.size();
      char* ret = static_cast<char*>(malloc(*len + 1));
      memcpy(ret, debug_str.c_str(), *len + 1);
      return ret;
    }
    
    char* TF_FunctionDebugString(TF_Function* func, size_t* len) {
    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)
  4. tensorflow/c/c_api.cc

      const auto& s = attr->s();
      std::memcpy(value, s.data(), std::min<size_t>(s.length(), max_length));
    }
    
    void TF_OperationGetAttrStringList(TF_Operation* oper, const char* attr_name,
                                       void** values, size_t* lengths,
                                       int max_values, void* storage,
                                       size_t storage_size, TF_Status* status) {
    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)
  5. tensorflow/c/c_test.c

        fprintf(stderr, "TF_GetLocalTempDirectories returned no results\n");
        return 1;
      }
    
      char file_name[100];
      time_t t = time(NULL);
      snprintf(file_name, sizeof(file_name), "test-%d-%ld.txt", getpid(), t);
    
      size_t length = 2 + strlen(path) + strlen(file_name);
      char* full_path = malloc(length);
      snprintf(full_path, length, "%s/%s", path, file_name);
    
      TF_WritableFileHandle* h;
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Wed Apr 24 20:50:35 GMT 2024
    - 2.8K bytes
    - Viewed (0)
  6. tensorflow/c/c_api_function.cc

                                  TF_Status* status) {
      status->status = MessageToBuffer(func->record->fdef(), output_func_def);
    }
    
    TF_Function* TF_FunctionImportFunctionDef(const void* proto, size_t proto_len,
                                              TF_Status* status) {
      tensorflow::FunctionDef fdef;
      bool success = fdef.ParseFromArray(proto, proto_len);
      if (!success) {
        status->status = InvalidArgument(
    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)
  7. cmd/xl-storage.go

    	if written < fileSize && fileSize >= 0 {
    		w.Close()
    		return errLessData
    	} else if written > fileSize && fileSize >= 0 {
    		w.Close()
    		return errMoreData
    	}
    
    	// Only interested in flushing the size_t not mtime/atime
    	if err = Fdatasync(w); err != nil {
    		w.Close()
    		return err
    	}
    
    	// Dealing with error returns from close() - 'man 2 close'
    	//
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 84.7K bytes
    - Viewed (0)
  8. guava-gwt/pom.xml

                  <excludes>META-INF/MANIFEST.MF</excludes>
                  <outputDirectory>${project.build.directory}/failureaccess-sources</outputDirectory>
                  <type>java-source</type>
                  <silent>false</silent>
                </configuration>
              </execution>
              <execution>
                <id>unpack-guava-sources</id>
                <phase>generate-resources</phase>
    XML
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Apr 11 15:00:55 GMT 2024
    - 19.8K bytes
    - Viewed (0)
  9. internal/bpool/bpool.go

    type BytePoolCap struct {
    	c    chan []byte
    	w    int
    	wcap int
    }
    
    // NewBytePoolCap creates a new BytePool bounded to the given maxSize, with new
    // byte arrays sized based on width.
    func NewBytePoolCap(maxSize uint64, width int, capwidth int) (bp *BytePoolCap) {
    	if capwidth > 0 && capwidth < 64 {
    		panic("buffer capped with smaller than 64 bytes is not supported")
    	}
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Fri Apr 19 16:44:59 GMT 2024
    - 2.6K bytes
    - Viewed (0)
  10. cmd/data-scanner.go

    			sizeS.failedCount++
    		case replication.Completed, replication.CompletedLegacy:
    			tgtSizeS.replicatedSize += oi.Size
    			tgtSizeS.replicatedCount++
    			sizeS.replicatedSize += oi.Size
    			sizeS.replicatedCount++
    		}
    		sizeS.replTargetStats[arn] = tgtSizeS
    	}
    
    	if oi.ReplicationStatus == replication.Replica {
    		sizeS.replicaSize += oi.Size
    		sizeS.replicaCount++
    	}
    }
    
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Mon Apr 22 17:49:30 GMT 2024
    - 47.4K bytes
    - Viewed (0)
Back to top