Timeline for Why doesn't my code compile?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 12, 2013 at 5:18 | vote | accept | expression | ||
| Sep 11, 2013 at 12:19 | vote | accept | expression | ||
| Sep 11, 2013 at 12:19 | |||||
| Sep 11, 2013 at 7:31 | answer | added | user21 | timeline score: 4 | |
| Sep 11, 2013 at 2:53 | comment | added | expression | @Szabolcs Thank you, updated now. | |
| Sep 11, 2013 at 2:52 | history | edited | expression | CC BY-SA 3.0 | added 383 characters in body |
| Sep 10, 2013 at 21:13 | comment | added | Mr.Wizard | Related: (13504), (31171) | |
| Sep 10, 2013 at 18:39 | comment | added | Szabolcs | Here it's shown how to create a recursive compiled function, but it relies in MainEvaluate so I'm not sure how much compilation would help with efficiency, unless the non-recursive part is substantial. | |
| Sep 10, 2013 at 18:37 | comment | added | Szabolcs | @JacobAkkerboom I thought for a moment I could game that restriction, but it seems I was wrong. So I agree, that's the main restriction here. What I pointed out is secondary. | |
| Sep 10, 2013 at 18:31 | comment | added | Szabolcs | There are several problems with your function: think about what is the type of the return value. What rank tensor is it. I can't really figure out what you're trying to achieve so I can't correct it for you, but: 1. as it is, your function doesn't return anything because of the ; 2. if we fix that, it returns a rank 3 tensor which is fed back as input after a transformation. The input is expected to be a rank 2 tensor however. I'd suggest to first write an uncompiled version and fix the bugs. | |
| Sep 10, 2013 at 18:27 | comment | added | Jacob Akkerboom | I'm not sure if it is possible to compile such a recursive function. | |
| Sep 10, 2013 at 18:08 | history | edited | cormullion | CC BY-SA 3.0 | Fixed title |
| Sep 10, 2013 at 17:51 | history | asked | expression | CC BY-SA 3.0 |