-
Notifications
You must be signed in to change notification settings - Fork 33
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Apply classes 10 times or less #114
base: master
Are you sure you want to change the base?
Conversation
Before each class was only applied once. Now each class will be applied over and over again until either all classes do not create new regions or each class has tried 10 times. 10 is an arbitrary limit; I just figured that it was as good as any limit.
Upon further testing, this is not a full solution to nesting. It updates |
Is that with |
It can be |
Could be a general bug in this package. If you could show a semi-reliable repro, at least, I'll make sure to look into it. |
I really appreciate it. By semi-reliable repo do you mean containing samples? |
Some example and a scenario I could reproduce locally. |
My mistake. I just realized what is causing this and it is a completely unrelated thing. This pull request is not the problem at all. |
In case anyone is interested. The problem was caused by programatically calling (progn
(mmm-update-current-submode)
mmm-current-submode) in order to get the current submode. My somewhat of a solution is to call |
I you would still like some samples: there is retro-games and the sample code from #114. <table>
<thead>
<tr>
,@(mapcar
(lambda (head)
<th>,(progn head)</th>)
(enumerate (car rows)))
</tr>
</thead>
<tbody>
,@(mapcar
(lambda (row)
<tr>
,@(mapcar
(lambda (column)
<td>
,(progn column)
</td>)
row)
</tr>)
rows)
</tbody>
</table> |
Yeah, having a call to |
Before each class was only applied once. Now each class will be
applied over and over again until either all classes do not create new
regions or each class has tried 10 times. 10 is an arbitrary limit; I
just figured that it was as good as any limit.
This is to solve #113.