The simpler data model of S3 is reflected in the code for listing all of the items in an S3 bucket.
较简单的S3数据模型体现在列出s3存储桶中所有项目的代码中。
The PUT command creates a bucket or object, DELETE deletes the bucket or object, and GET retrieves information about the bucket or data from the object.
PUT命令创建桶或对象，DELETE删除桶或对象，GET检索有关桶或来自对象的数据的信息。
And now, data binding, JDOM, and a bucket full of apis.
如今又出现了数据绑定，JDOM和大量的api。
An object is a named block of data inside a bucket.
一个对象就是一个桶中的一个指定的数据块。
We split the bucket before and after the character. Now we have three buckets: the character itself, and all data before and after it.
我们以字符前后位置拆分桶。这样我们得到三个桶：字符本身、字符前面数据和字符后面数据。
So if we re-use the same bucket, we lose the links, so that the brigade now jumps over any data between the two instances of it.
所以如果我们重用同样的桶的话，我们就失去连接了，所以成编队列现在可能在两个实例间跳过任何的数据。
If the needed size happens to be greater than the existing block, the block is freed, a new block is allocated from a new bucket, and the data is moved from the old block to the new block.
如果所需的大小大于现有的块，那么释放这个块，从另一个bucket分配一个新的块，把数据从原来的块转移到新的块中。
We rarely if ever need to create a heap bucket explicitly: rather they are managed internally when we use the stdio-like API to write data to the next filter.
如果有过需要显式创建一个堆桶，我们很少这样做：更多的是他们被内部管理，当我们使用成套的API来写数据给下一个过滤器时。
There are several different types of data bucket, as well as metadata buckets. We will describe these at the end of this article.
有几种不同的数据桶类型，同样也有元数据桶。随后介绍这些类型。
The EOS bucket is crucial: it must be sent at the end of a data stream, and it serves to signal the end of incoming data.
EOS桶是关键的：它必须在数据流的尾部发送，它是输入数据的结束标志。
In the article, the specific station rainfall data described JDZ05 (02) -1 type tipping bucket rain sensor in Yingkou region, application, effect is good.
本文应用具体站的雨量数据阐述了JDZ05(02) -1型翻斗式雨量传感器在营口地区的应用，效果较好。
With the analysis on mobile data services, an overload hybrid control mechanism, a combination of window method and leaky bucket method, is presented.
基于对移动数据业务特点的分析，提出了窗口算法和漏桶算法相结合的过载混合控制机制。
Instead of parallel bucket sort recommended by some authors, a scheme using parallel regular sampling sort algorithm to construct the finest level data of the distributed tree is presented.
研究了最细层数据的建立方法，提出采用并行正则采样排序算法来代替众多文献所推荐的并行桶排序算法，以此来建立分布树的最细层数据。
The method is not only obviously quicker than that of quick sort, but also much quicker than the bucket sorting method, even in the case of non-uniformly distributed data.
该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。
The merit of our arithmetic is the slight jitter of read-time rate, the flatness of rate variety and the support of burst data Furthermore, the token bucket arithmetic is of common use.
结果表明，相比于网络处理器普遍采用的简单流量控制算法，该算法具有实时速率抖动较小、变化较为平滑和支持突发数据的优点。
The merit of our arithmetic is the slight jitter of read-time rate, the flatness of rate variety and the support of burst data Furthermore, the token bucket arithmetic is of common use.
结果表明，相比于网络处理器普遍采用的简单流量控制算法，该算法具有实时速率抖动较小、变化较为平滑和支持突发数据的优点。
应用推荐