Talk:Text processing/Max licenses in use: Difference between revisions
Content added Content deleted
m (→Assumptions) |
|||
| Line 4: | Line 4: | ||
:Not quite sure what you mean here? Assume that you have the 10000 line file as given. You could check on char 8 by scanning the file beforehand, but I could just say that it is like the example in the header where apart from the width of the last field in a line, then other fields are fixed width, and in fixed order. But again, you could write code to verify this too. The last line of the file may or may not end in a newline depending on how it was grabbed from the URL. (I take it that you were successful DanBron, thanks. It's the first time I've used google docs to distribute data in this way - If Rosetta Code could possibly upload a zipped version??? ) |
:Not quite sure what you mean here? Assume that you have the 10000 line file as given. You could check on char 8 by scanning the file beforehand, but I could just say that it is like the example in the header where apart from the width of the last field in a line, then other fields are fixed width, and in fixed order. But again, you could write code to verify this too. The last line of the file may or may not end in a newline depending on how it was grabbed from the URL. (I take it that you were successful DanBron, thanks. It's the first time I've used google docs to distribute data in this way - If Rosetta Code could possibly upload a zipped version??? ) |
||
:As for assuming the file exists, I would expect examples to '''not''' check whether the file exists or if it was zero length. for the purpose of the ''exercise'', just run on the data and report a result. If you have a different algorithm to those present then you might want to start a discussion in this talk section, for example - given the size of the input, someone might slurp in the whole |
:As for assuming the file exists, I would expect examples to '''not''' check whether the file exists or if it was zero length. for the purpose of the ''exercise'', just run on the data and report a result. If you have a different algorithm to those present then you might want to start a discussion in this talk section, for example - given the size of the input, someone might slurp in the whole file in one go rather than accumulating data line-by-line. --[[User:Paddy3118|Paddy3118]] 04:24, 4 October 2008 (UTC) |
||
=== J === |
=== J === |
||
| Line 17: | Line 17: | ||
Maximum simultaneous license use is 0 at the following times: |
Maximum simultaneous license use is 0 at the following times: |
||
:Note that I didn't have to do any special checks to get this behavior, it just fell naturally out of the code. (This happens a lot in J.) |
:Note that I didn't have to do any special checks to get this behavior, it just fell naturally out of the code. (This happens a lot in J.) |
||
== File hosting == |
== File hosting == |
||