Comments (5)
Nearly there. I've decided that I need a function returning the object though, as even with cut-and-paste the construct Algorithm::Networksort->new() is just a bit too much text.
Math::Complex has a cplx() function that returns the Math::Complex object. I am open to suggestions for an equivalent function that doesn't have more than, say, six characters in its name.
nwsrt() perhaps? Fairly safe since the 'nw_' prefixes are being removed from the formerly exported function names.
from algorithm-networksort.
It's not complete -- documentation isn't done, the Best module could be better integrated, and the graph code probably belongs in a separate module -- but it is object-oriented.
I'm about to go to sleep now, and assuming I don't find anything truly bad about it, I'll merge the code later today into master. With that done, the other issues can be worked on without my worrying about massive re-basing.
from algorithm-networksort.
And done, after updating Build.PL.
from algorithm-networksort.
Cool, looking good! Just curious: why did you switch to Moose instead of Moo? I was under the impression Moo was preferred unless you need some of the advanced meta-object stuff...
from algorithm-networksort.
In theory, yeah. But I was having issues with Moo's lack of typing (I have arrayrefs of arrayrefs going on there), and since Moo's solution was to add more modules, I didn't see the point in upping the complexity when Moose had the complexity built-in without my having to second-guess the the system -- the documentation for the helper modules was not what I'd call comprehensive.
from algorithm-networksort.
Related Issues (20)
- Running t/best.t takes too long HOT 2
- Implement Shell sort HOT 3
- New Optimal Networks from Morwenn HOT 5
- Move EPS, SVG, and Text Graphing Code to Their Own Object HOT 1
- Update Documentation HOT 1
- Clean Up the Scripts in the eg/ Directory HOT 1
- Final Documentation Push For 2.00 HOT 4
- Rename (and Add to) Default Exports HOT 3
- Zig-zag sort HOT 4
- Practical application of SNs HOT 3
- Better sorting networks HOT 2
- Treat endpoint circles of inputs and comparators separately HOT 2
- Add 16-input network by David Van Voorhis, ... HOT 1
- Postscript Output Not Parsing HOT 1
- Interesting paper: Engineering Faster Sorters for Small Sets of Items HOT 7
- Proof of optimality for network sizes 10 and 11 HOT 1
- More size-optimal algorithms HOT 3
- Best size and best depth sorting networks HOT 19
- algorithms which not change order of equal elements ? HOT 12
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from algorithm-networksort.