@CarlLange I remember writing one using itertools and some tricks and stuff like 5 years ago. It...wasn't pretty.
@Kuba @Szabolcs this is also something I've played with. It's just a huge pain writing the transformations. The canonical WRI exporter uses the Transmogrify package which you can find a copy of (I think) deep in the ResourceSystemClient paclet. The problem is that the XLST or whatever concept it builds off of is a) very slow and b) hella fragile.
To get my doc NB -> HTML converter working for my 11.3-style docs I had to prune everything and it still breaks continually. (and I'm using the stuff that Workbench itself uses!)
But if you don't want to reimplement everything that's a way to go.
@b3m2a1 Stylesheets are a major pain and I really wished WRI would come up with a better mechanism to tweak and use them ( more CSS-like). But it looks like they always focus on something new before revisiting the old semi-broken implementations.
The tweaking I just sat down and hammered out myself so that's actually really clean for me. My big issue is that the notebooks don't really work right in many cases. A Saveable->False gets set secretly sometimes and they auto-close when the notebook they reference does (which makes sense, it just is surprising and annoying).
Overall I just feel like there are too many gotchas hidden in them
Does anyone know if I can provide videos on a GitHub wiki? I feel like some How-To videos would be easier to make and clearer than a typed up run through of the workflow.
I suppose I could always upload to YouTube and embed via iframe...
As part of implementing the new unified themes across the network, we're gradually rolling out updated site themes for each site. As of today, we have enabled your updated site theme for testing.
If you can't see it right now, that's by design! This is a very early test implementation of your d...
We rolled out the new site theme for TeX. It is now live.
What new theme?
If you're like, "What the heck are you talking about?", then you should read the Meta Stack Exchange post entitled Rollout of new network site themes (and maybe the posts it links to for the full background).
Your help...
A collection of user scripts to make the main site look a bit better again, after the new design has gone live on August 3, 2018.
The scripts can be used e.g. with
Tampermonkey (Chrome)
Greasemonkey (Firefox)
A fix for recent versions of Firefox and GreaseMonkey (4.x) by @PaulGaborit.
A use...
@xzczd Problem is I want to do a full workflow (maybe with some voice over, if I can ever stomach how awful it is to hear a recording of one's own voice).
hm, does anybody know if it's possible to remove a data point from a NearestFunction, or do I have to recreate a new NearestFunction without that data point?
Can anybody comment on the performance of the new OSX frontend in 12.0 when it comes to accidentally printing out a really large amount of data? I crash 11.3 multiple times a month by accidentally printing out two thousand entities or whatever
(you might want to update the paclet, since I've improved the performance and functionality of ProgressReport a lot in the last weeks - you should be able to call UpdateForScience[] to update)
Anyone want to try to break something for me? I have something that converts \[IndentingNewLine] box expressions to an appropriately tabbed version (with whatever tab character you want).
I just added support for the indentation coming from @, ->, etc.
@CarlLange Let me know if you manage to break it (it should also support ProgressReport[Parallelize@MapIndexed[...]] in theory, but unfortunately I didn't have many test cases yet)
Anybody have a method that's faster than MemberQ for checking if an element is in a list? It gets slow when there's a hundred thousand elements in the list
@C.E. Loved your answer for the mark centroids question by the way, very elegant.
@LukasLang Really, great job. It's so useful, I'm going to use this everywhere
@CarlLange You could convert the list into an association using AssociationThread[list->Null] - KeyMemberQ is a lot faster than MemberQ (assuming you check for many elements)
If you build the association as you go, the speedup should be even faster - appending to a list is way more expensive that adding to an association (which you're essentially abusing as a hash-set)