That’s just what
cat was made for. Since it is one of the oldest GNU tools, I think it’s very unlikely that any other tool does that faster/better. And it’s not piping – it’s only redirecting output.
Under the hood
There is no more efficient way than copying the first file, then copying the second file after it, and so on. Both DOS
cat do that.
Each file is stored independently of other files on the disk. Almost every filesystem designed to store data on a disk-like device operates by blocks. Here’s a highly simplified presentation of what happens: the disk is divided into blocks of, say 1kB, and for each file the operating system stores the list of blocks that make it up. Most files aren’t an integer number of blocks long, so the last block is only partially occupied. In practice, filesystems have many optimizations, such as sharing the last partial block between several files or storing “blocks 46798 to 47913” rather than “block 46798, block 46799, …”. When the operating system needs to create a new file, it looks for free blocks. The blocks don’t have to be consecutive: if only blocks 4, 5, 98 and 178 are free, you can still store a 4kB file. Using blocks rather than going down to the byte level helps make finding free blocks for a new or growing file considerably faster, and reduces the problems due to fragmentation when you create or grow and delete or shrink a lot of files (leaving an increasing number of holes).
You could support partial blocks in mid-file, but that would add considerable complexity, particularly when accessing files non-sequentially: to jump to the 10340th byte, you could no longer jump to the 100th byte of the 11th block, you’d have to check the length of every intervening block.
Given the use of blocks, you can’t just join two files, because in general the first file ends in mid-block. Sure, you could have a special case, but only if you want to delete both files when concatenating. That would be a highly specific handling for a rare operation. Such special handling doesn’t live on its own, because on a typical filesystem, many file are being accessed at the same time. So if you want to add an optimization, you need to think carefully: what happens if some other process is reading one of the files involved? What happens if someone tries to concatenate A and B while someone is concatenating A and C? And so on. All in all, this rare optimization would be a huge burden.
All in all, you can’t make joining files more efficient without making major sacrifices elsewhere. It’s not worth it.
On splitting and joining
cat are simple ways of splitting and joining files.
split takes care of producing files named in alphabetical order, so that
cat * works for joining.
A downside of
cat for joining is that it is not robust against common failure modes. If one of the files is truncated or missing,
cat will not complain, you’ll just get damaged output.
There are compression utilities that produce multipart archives, such as
rar -v. They aren’t very unixy, because they compress and pack (assemble multiple files into one) in addition to splitting (and conversely unpack and uncompress in addition to joining). But they are useful in that they verify that you have all the parts, and that the parts are complete.
Seems like there should be a more efficient way than piping all of the contents through the system’s
Except that’s not really what’s happening. The shell is connecting the stdout of
cat directly to the open file, which means that “going through stdout” is the same as writing to disk.