对于所有格式，文档内容应该以二进制数组形式传递给服务器。
For all formats, the document content should be passed to the server as a binary array.
给定一个二进制数组，计算数组中出现的最大连续1的个数。
Given a binary array, find the maximum number of consecutive 1s in this array.
这个封装器程序的API(参看清单2)包含了二进制数组，而不是图像。
This wrapper's API (see Listing 2) contains byte arrays instead of images.
给定一个二进制数组，如果允许将至多一个0翻转成1，求最大连续1的个数。
Given a binary array, find the maximum number of consecutive 1s in this array if you can flip at most one 0.
例如，FlatFileAdapter不知道其处理的文件的内容，因此将文件内容作为二进制数组进行处理。
For example, the Flat file Adapter is agnostic of the content of the files it processes, and thus, treats the contents of the file as a byte array.
甚至可以直接从字节数组或者流中装载二进制类，以及从头开始创建新类。
You can even load binary classes directly from byte arrays or streams, and create new classes from scratch.
元素包含了名称、名称空间、MIME类型和二进制数据数组。
An element contains a name, a namespace, a MIME type, and a binary array of data.
清单4中的代码首先定义一个数组，其中第一个元素是要执行的二进制文件的路径，其余元素充当命令行参数。
The code in Listing 4 first defines an array, with the first element being the path to the binary that is to be executed, and the remaining elements acting as the command-line parameters.
该DTD把数据序列化为通常在面向对象编程语言中才会见到的(嵌套的)数据结构集：词典、数组、字符串、数字、boolean值、日期和二进制数据。
This DTD serializes data into a (nested) set of data structures that are common in object-oriented programming languages: dictionaries, arrays, strings, Numbers, booleans, dates, and binary data.
该数组的第一个元素实际上是二进制文件的名称，因此参数实际上是从第二个元素开始的。
The first element of the array is actually the name of the binary, so it's really the second element where the parameters start.
execv调用首先取得一个指向要运行的二进制文件名称的指针，然后取得一个指向您前面声明的参数数组的指针。
The call to execv first takes a pointer to the name of the binary to be run, and then a pointer to the array of parameters that you declared earlier.
二进制源数据必须是一维的无符号字符数组。
Binary source data must be a single-dimensioned array of unsigned char.
如何使用二进制搜索来找到数组中第一个非空元素呢？
How to use binary search to find the first non-null element in an array?
数字数组的尺寸必须匹配二进制阵列的作用。
一种标准的方式来实现一个正常的二进制堆是使用一个数组，然后从左到右填充与隐式二进制堆(这是堆排序的方式通常是实现)。
A standard way to implement a normal binary heap is to use an array and then fill it from left to right with an implicit binary heap (this is the way heapsort is usually implemented).
一种标准的方式来实现一个正常的二进制堆是使用一个数组，然后从左到右填充与隐式二进制堆(这是堆排序的方式通常是实现)。
A standard way to implement a normal binary heap is to use an array and then fill it from left to right with an implicit binary heap (this is the way heapsort is usually implemented).
应用推荐