{"action":"opened","issue":{"url":"https://api.github.com/repos/vermaseren/form/issues/147","repository_url":"https://api.github.com/repos/vermaseren/form","labels_url":"https://api.github.com/repos/vermaseren/form/issues/147/labels{/name}","comments_url":"https://api.github.com/repos/vermaseren/form/issues/147/comments","events_url":"https://api.github.com/repos/vermaseren/form/issues/147/events","html_url":"https://github.com/vermaseren/form/issues/147","id":191304570,"number":147,"title":"[tform] Crash in incrementing \"maximum\" $-variables","user":{"login":"tueda","id":1481665,"avatar_url":"https://avatars.githubusercontent.com/u/1481665?v=3","gravatar_id":"","url":"https://api.github.com/users/tueda","html_url":"https://github.com/tueda","followers_url":"https://api.github.com/users/tueda/followers","following_url":"https://api.github.com/users/tueda/following{/other_user}","gists_url":"https://api.github.com/users/tueda/gists{/gist_id}","starred_url":"https://api.github.com/users/tueda/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tueda/subscriptions","organizations_url":"https://api.github.com/users/tueda/orgs","repos_url":"https://api.github.com/users/tueda/repos","events_url":"https://api.github.com/users/tueda/events{/privacy}","received_events_url":"https://api.github.com/users/tueda/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-11-23T15:30:25Z","updated_at":"2016-11-23T15:30:25Z","closed_at":null,"body":"The following code should print the maximum number of terms that one thread got, but `tform` often crashes:\r\n```\r\nAuto S x;\r\nL F = x1+...+x100;  * Ensure well-parallelized.\r\n.sort\r\n#$n = 0;\r\n$n = $n + 1;\r\nModuleOption maximum $n;\r\n.sort\r\n#message `$n'\r\n.end\r\n```\r\n```\r\nTFORM 4.1 (Nov 15 2016, v4.1-20131025-263-g033e880) 64-bits 4 workers  Run: Wed Nov 23 16:19:56 2016\r\n    Auto S x;\r\n    L F = x1+...+x100;  * Ensure well-parallelized.\r\n    .sort\r\n\r\nTime =       0.00 sec    Generated terms =        100\r\n               F         Terms in output =        100\r\n                         Bytes used      =       2808\r\n    #$n = 0;\r\n    $n = $n + 1;\r\n    ModuleOption maximum $n;\r\n    .sort\r\nProgram terminating in thread 1 at 1.frm Line 6 --> \r\n  0.00 sec + 0.00 sec: 0.01 sec out of 0.00 sec\r\n```\r\nIs it not expected to use `$n = $n + 1` for the `maximum` option?"}}
{"actor":{"display_login":"tueda"}}