wiki.scala-lang.org
Welcome to the Scala Wiki! - Scala Wiki - Scala Wiki
https://wiki.scala-lang.org/display/SW
Please note that the Scala wikis are in a state of flux. We strongly encourage you to add content but avoid creating permanent links. URLs will frequently change. For our long-term plans see this post. By the doc czar. Link to this Page. Welcome to the Scala Wiki! Skip to end of metadata. Created by Lukas Rytz. Last modified by Heather Miller. On Mar 09, 2012. Go to start of metadata. Whats the Scala Wiki for? A place for frequently updated content like our list of open source Scala libraries.
scala-lang.org
The Scala Programming Language | The Scala Programming Language
http://www.scala-lang.org/node/25
This page is no longer maintained — Please continue to the home page at www.scala-lang.org. Interviews and Panel Talks. A Brief Scala Tutorial. Setup and Getting Started. Getting Started with Scala. Setting PATH on Windows. Fsc and the OSX firewall. Scala on Microsoft .NET. Scala on Google App Engine. Scala and JUnit on Eclipse. Scala, Emacs and Yasnippet. IDE and Editor plugins. Build Scala from the Source. Bug Tracking and Testing. The Scala Programming Language. For example, at Twitter. His concise 15...
techneilogy.blogspot.com
TechNeilogy: January 2012
http://techneilogy.blogspot.com/2012_01_01_archive.html
Friday, January 27, 2012. Mixins Simplify Composition in Scala. Scala has a nifty feature called “traits.” . A trait is a means of encapsulating methods and fields that behaves in some ways like an interface, and in other ways like an abstract class. . Like an interface or abstract class, a trait can declare methods and fields that must later be defined in some concrete class. . Unlike a class, however, a trait cannot have constructor parameters. . Here is a simple trait that specifies an iterator:.
techneilogy.blogspot.com
TechNeilogy: October 2010
http://techneilogy.blogspot.com/2010_10_01_archive.html
Sunday, October 3, 2010. F# Computation Expressions: Basic Data Retrieval Mechanics. The test database itself consists of two record types. The first is a simple key/value pair. The second is a linking record type which consists of two keys. This keeps things simple for the test, but the method would remain the same even for more complex record structures. Disclaimer: this oversimplified code is designed to illustrate the basic mechanics of this type of workflow. It is *not* to be considered ideal, p...
techneilogy.blogspot.com
TechNeilogy: March 2011
http://techneilogy.blogspot.com/2011_03_01_archive.html
Tuesday, March 1, 2011. More on Significant Whitespace (in F#, Python, Lua, and Ruby). Since I want to add it to my coding “Room of Requirement,” I decided to keep working on the indentation processor a bit and make it more general. So here is a version that uses an interface to do dependency injection. (And as always, the code and information here are presented "as-is" and without warranty or implied fitness of any kind; use at your own risk.). There are a couple of things to note:. Last, I apologize fo...
techneilogy.blogspot.com
TechNeilogy: August 2010
http://techneilogy.blogspot.com/2010_08_01_archive.html
Monday, August 30, 2010. F#, Fuzzy Logic, WPF, and Tomatoes! This is my 100th blog post, and to celebrate, I’m pulling out all the stops. This example will combine F#, fuzzy logic, WPF, and tomatoes! Below is the application with the window reduced a bit to fit the blog. In real life, it’s more fun to run it full screen. This is a WPF application, so it will require a number of additional steps when making it a Visual Studio project:. And that’s it! I have the following libraries referenced. Make them lo...
techneilogy.blogspot.com
TechNeilogy: September 2010
http://techneilogy.blogspot.com/2010_09_01_archive.html
Monday, September 27, 2010. F# Computation Expressions, Yield/For Mechanics. Today’s episode of the ongoing computation expression saga features Yield/YieldFrom and For. One encounters fewer examples of these than of Bind/Return, though in most respects their operation is every bit as fundamental. 1) Prepending a yielded item to an ongoing sequence. This is the basic yield operation. 2) Combining a two sequences. This is the yield! Combine (a,b) =. Combine (a,b) =. Combine (a,b) =. Append a (Seq . The Fo...
techneilogy.blogspot.com
TechNeilogy: December 2014
http://techneilogy.blogspot.com/2014_12_01_archive.html
Monday, December 22, 2014. I just had a thought. I'm sure it's one of those things everybody but me has been doing for years:. At the end of the day, leave an info/warning/error in the test code explaining what the next step should be. That way, instead of staring numbly at the screen for fifteen minutes in the morning, while you wait for the coffee to kick in, you can just run the latest test and follow your own orders! Subscribe to: Posts (Atom). View my complete profile. AI, NLP and ML.
techneilogy.blogspot.com
TechNeilogy: January 2011
http://techneilogy.blogspot.com/2011_01_01_archive.html
Tuesday, January 18, 2011. Project Euler #1 - One Problem, Three Solutions, Seven Languages. I haven’t posted here in a long time, and I apologize for that. No particular reason, but all good: programming in F#, learning lots of new programming stuff, enjoying the fall and winter holiday season (including hand-making some Christmas gifts), etc. Based on problem statement. Euler 1 naive a b bound =. Euler 1 iteration a b bound =. Numeric (one possible factoring). Illustrates the use of nested functions,.