How to resolve the algorithm Append a record to the end of a text file step by step in the Icon and Unicon programming language
How to resolve the algorithm Append a record to the end of a text file step by step in the Icon and Unicon programming language
Table of Contents
Problem Statement
Many systems offer the ability to open a file for writing, such that any data written will be appended to the end of the file. Further, the file operations will always adjust the position pointer to guarantee the end of the file, even in a multitasking environment. This feature is most useful in the case of log files, where many jobs may be appending to the log file at the same time, or where care must be taken to avoid concurrently overwriting the same record from another job.
Given a two record sample for a mythical "passwd" file: Resulting file format: should mimic Linux's /etc/passwd file format with particular attention to the "," separator used in the GECOS field. But if the specific language has a particular or unique format of storing records in text file, then this format should be named and demonstrated with an additional example. Expected output: Finally: Provide a summary of the language's "append record" capabilities in a table. eg. Alternatively: If the language's appends can not guarantee its writes will always append, then note this restriction in the table. If possible, provide an actual code example (possibly using file/record locking) to guarantee correct concurrent appends.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Append a record to the end of a text file step by step in the Icon and Unicon programming language
Source code in the icon programming language
procedure main()
orig := [
"jsmith:x:1001:1000:Joe Smith,Room 1007,(234)555-8917,(234)555-0077,jsmith@rosettacode.org:/home/jsmith:/bin/bash",
"jdoe:x:1002:1000:Jane Doe,Room 1004,(234)555-8914,(234)555-0044,jdoe@rosettacode.org:/home/jsmith:/bin/bash"
]
new := [
"xyz:x:1003:1000:X:Yz,Room 1003,(234)555-8913,(234)555-0033,xyz@rosettacode.org:/home/xyz:/bin/bash"
]
fName := !open("mktemp","rp")
every (f := open(fName,"w")) | write(f,!orig) | close(f)
every (f := open(fName,"a")) | write(f,!new) | close(f)
every (f := open(fName,"r")) | write(!f) | close(f)
end
You may also check:How to resolve the algorithm Formatted numeric output step by step in the RPL programming language
You may also check:How to resolve the algorithm CSV to HTML translation step by step in the JavaScript programming language
You may also check:How to resolve the algorithm Bulls and cows/Player step by step in the Tcl programming language
You may also check:How to resolve the algorithm Phrase reversals step by step in the PureBasic programming language
You may also check:How to resolve the algorithm Queue/Definition step by step in the Maxima programming language