Anonymous user
Talk:Function frequency: Difference between revisions
→Ada: new section
Walterpachl (talk | contribs) (→REXX solution looks like run time counting ?!: new section) |
(→Ada: new section) |
||
| (3 intermediate revisions by one other user not shown) | |||
Line 1:
== Specification ==
It seems to me this could be better specified. For instance this looks likes it is to be run against a source file. However, it could equally be run against an entire library or collection. For instance what are the statistics for a commonly used public library or Rosetta. I know this complicates things and I'm not asking to change the
: The other way to implement this (execution frequency) would also make a good task. I have used such facilities for performance profiling. --[[User:IanOsgood|IanOsgood]] 16:32, 23 April 2012 (UTC)
:: I assume by ''execution frequency'', you actually meant ''execution count'', as frequency implies how many executions per some period of time. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:15, 28 September 2012 (UTC)
:: Also, I misunderstood what the task's author meant when he specified "how often it is ''used'' by the programmer". He probably meant ''specified'' (in the source) instead of actually ''using'' the function. It was the word '''used''' that caused me to program the REXX version for a run-time analysis. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:15, 28 September 2012 (UTC)
=== What is a "function"? ===
Line 301 ⟶ 304:
Task asks for static analysis!
: Yes it does. I was trying to address the intent of this task. This is a best-effort solution to provide the closest thing that I could conceive of to solve the task at hand for a program or runtime environment (I choose a program environment). It may not adhere to the definition of a static analysis, but it has a good start at the intent of the task. If anything, I hoped it would give someone an idea how this could be accomplished by just using some simple REXX programming techniques for doing self-inspection within the REXX language. If the solution is that objectionable, it can be superceded by a better solution of course. Perhaps an object-oriented version of REXX (which has more tools for something like this) would be better suited to fulfill this task. I feel that this REXX solution has a practical usefulness, albeit simple and straightforward. -- [[User:Gerard Schildberger|Gerard Schildberger]] 14:01, 4 September 2012 (UTC)
In the task description 'suites' should be 'suits' ?
But I'm not a native speaker--[[User:Walterpachl|Walterpachl]] 07:44, 4 September 2012 (UTC)
== Ada ==
In the real world, you probably would not try and write a task like this in Ada because string handling is less flexible than in say Basic. (One of the main authors of Ada admits this). If it would be considered acceptable, I may try and do this in Visual Basic or Delphi. It still would not be trivial so I would not wish to start unless I was assured that It would count. [[User:Op47|Op47]] ([[User talk:Op47|talk]]) 21:05, 2 April 2013 (UTC)
| |||