How to resolve the algorithm Truncate a file step by step in the J programming language
How to resolve the algorithm Truncate a file step by step in the J programming language
Table of Contents
Problem Statement
Truncate a file to a specific length. This should be implemented as a routine that takes two parameters: the filename and the required file length (in bytes).
Truncation can be achieved using system or library calls intended for such a task, if such methods exist, or by creating a temporary file of a reduced size and renaming it, after first deleting the original file, if no other method is available. The file may contain non human readable binary data in an unspecified format, so the routine should be "binary safe", leaving the contents of the untruncated part of the file unchanged. If the specified filename does not exist, or the provided length is not less than the current file length, then the routine should raise an appropriate error condition. On some systems, the provided file truncation facilities might not change the file or may extend the file, if the specified length is greater than the current length of the file. This task permits the use of such facilities. However, such behaviour should be noted, or optionally a warning message relating to an non change or increase in file size may be implemented.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Truncate a file step by step in the J programming language
Source code in the j programming language
require 'files' NB. needed for versions prior to J7
ftruncate=: ] fwrite~ ] fread@; 0 , [
(1000$ 'abcdefg') fwrite 'text.txt' NB. create test file
567 ftruncate 'test.txt' NB. truncate test file
567
fsize 'test.txt' NB. check new file size
567
You may also check:How to resolve the algorithm Chinese remainder theorem step by step in the Go programming language
You may also check:How to resolve the algorithm HTTP step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the Ruby programming language
You may also check:How to resolve the algorithm Leap year step by step in the WebAssembly programming language
You may also check:How to resolve the algorithm Named parameters step by step in the Prolog programming language