可以基于用户目录的任何属性对用户进行划分。
You can partition your users based on any attribute of the user directory.
要进行划分，请创建一个名为robots .txt的文件，并将该文件拉入到Web服务器的根目录下。
To do this, create a file called robot.txt to drop into your Web server's root directory. In the robot.txt.
我发现，用JUnit实现测试分类最简单的方法是将测试在逻辑上划分为与其测试类型相应的特定目录。
I find that the easiest way to implement test categorization with JUnit is to logically divide tests into specific directories corresponding to their test type.
但是TheCompleteReference将它的内容划分到27个精选的章，带有详细的目录和良好的索引。
But The Complete Reference has its material divided into 27 well-chosen chapters, with both a detailed TOC and a good index.
Pending Changes视图中的其他选项，由构件(对于UCM)或者目录结构(对于基底CC)来划分范围。
Additional options in Pending Changes view configuration to scope by components (for UCM) or directory structure (for base CC).
相比于使用盘符的文件系统，盘符将文件系统划分成一系列不同的树(一个盘符代表一个文件目录树)，而Linux系统只有一个文件目录树(并没有分割文件系统)。
While drive letters split the file system into a series of different trees (one for each drive), Linux always has a single tree.
即使你把项目划分为多个构建文件，也应使程序员能够在项目根目录下找到核心build.xml。
Even if your project is divided into many different buildfiles, programmers expect to find a master build.xml in the project root directory.
Linux源码树提供了一个驱动程序子目录，这个目录又进一步划分为各种支持设备，例如Bluetooth、I2C、serial等。
The Linux source tree provides a drivers subdirectory that is further divided by the various devices that are supported, such as Bluetooth, I2C, serial, and so on.
Linux文件系统是一个用 / 划分根目录的大的目录树，但是我们在不同的设备和分区上也有文件系统。
The Linux filesystem is one big tree rooted at /, and yet we have filesystems on different devices and partitions.
因为几个原因，有些设计师喜欢以把主题设计放进不同子目录（ie. domain.com/v2, v3, v4）的方式进行版本划分，并重定向到新的文件夹。
For some reason, some designers love to version their theme design into sub level folders (ie. domain.com/v2
通过资料现状与数据需求分析，将地质矿产资料划分为表格、文档、图件和目录簿四类。
Based on the analysis of the data status and the data requirements, the geological and mineral information has been classified into four types, table, document, drawing and catalog directory.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.
应用推荐