Dunbundle - Slicing D-records with a repeating group

[ English | Japanese ]

[visit D-home]

• SYNOPSIS
• DESCRIPTION
• OPTIONS
• ENVIRONMENT
• EXAMPLES
• DIAGNOSTICS
• SEE ALSO

SYNOPSIS

Dunbundle [ -N|L|S ] leaf-field-list [ input-file.. ]

DESCRIPTION

Dunbundle unbundles the input files with the leaf-field-list and the given leaf separation algorithm.

Unbundling is a D-file operation to reduce repeating fields. A group of records are produced from an input record. Each of the produced record is composed of the stem fields (i.e., fields not in the leaf-field-list) and an individual leaf of the input record. Individual leaf is identified by the given leaf-field-list and the leaf separation algorithm selected by the -NLS option. For the definition of leaf and stem fields, and about the leaf separation algorithm, see the manual of D_lsa.

It is easier to explain with example. A D-file name "inf.d" contains a record having a "key" field and repeating "leaf" fields.

key:A
leaf:1
leaf:2
leaf:3

Unbundling of this file with leaf fields "leaf":

Dunbundle leaf inf.d

produces following records.

key:A
leaf:1

key:A
leaf:2

key:A
leaf:3

OPTIONS

-N

N-th occurrence algorithm. This is the default leaf separation algorithm.

-L

Leading field algorithm.

-S

Sequence break algorithm.

-D [i/o]datautf=8|16|32

UTF I/O feature (see manual page of UTF I/O feature.)

For leaf separation algorithms, see the manual of D_lsa.

ENVIRONMENT

Ddatautf, Didatautf, Dodatautf

for UTF I/O feature.

EXAMPLES

Command:

Dunbundle word indexwords.d

Input file "indexwords.d":

page:1
word:Dunbundle
word:leaf separation algorithm
word:leaf fields
word:stem fields
.....

Result:

page:1
word:Dunbundle

page:1
word:leaf separation algorithm

page:1
word:leaf fields

page:1
word:stem fields

.....

DIAGNOSTICS

See the manual of D_msg.

SEE ALSO

Dintro, Dbundle, D_lsa D_msg.

AUTHOR

MIYAZAWA Akira

---

miyazawa@nii.ac.jp
2003