http://blog.gmane.org/gmane.comp.lang.scala.user hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.lang.scala.user/53611 <pre> "scalac *.scala" ! results in error: source file '*.scala' could not be found Not sure, why it wont interpret the unix wild cards. Am wondering if this is a mac specific text encoding related issue. this is with scala 2.9.2 OS X 10.7 thanks Arun </pre> Arun Ramakrishnan 2012-05-26T02:25:19 http://comments.gmane.org/gmane.comp.lang.scala.user/53605 <pre>Hi all, Can someone explain why belinda is working fulltime instead of parttime in below code snippet? Thx in advance, Robby scala&gt; class Employee(employeeId: Integer, isFulltimeEmployed: Boolean) { | /** We can't register an employee without employeeId **/ | if (employeeId == null) { | throw new NullPointerException("employeeId was null") | } | /** we can override the primary constructor **/ | def this(employeeId: Integer) = this(employeeId, true) | override def toString() = employeeId + " works " + (if (isFullTimeEmployed) "fulltime" else "parttime") | } warning: there were 3 deprecation warnings; re-run with -deprecation for details defined class Employee scala&gt; scala&gt; val john = new Employee(12545, true) john: Employee = 12545 works fulltime scala&gt; val belinda = new Employee(32567, false) belinda: Employee = 32567 works fulltime scala&gt; val herman = new Employee(56784) herman: Employee = 56784 works fulltime scala&gt; val ivan = new Employee(43567) ivan: Employee = 43567 works fulltime </pre> Robby Pelssers 2012-05-25T20:44:11 http://comments.gmane.org/gmane.comp.lang.scala.user/53590 <pre>Hi, I am a Scala Noob and so far love the language. I am coming from a Perl background so the power of the language combined with the JVM still amazes me. Being from a Perl background one of the greatest things about Perl is the CPAN server that has everything you could possible need or want in Perl in one location. What are the thoughts of users and developers of have a CSAN(Central Scala Archive Network) for Scala open source code? I ask this because as I look around on the internet I am seeing more and more Scala projects popping up but the user/developer has to comb the internet to find great these. Finally, I think that Scala is going to continue to grow as its own language and not look to Java imports as much in the future as more users come aboard. -Dell </pre> Wendell Hatcher 2012-05-25T15:29:19 http://comments.gmane.org/gmane.comp.lang.scala.user/53584 <pre>http://www.scala-lang.org/node/10299 Quote from above Url: I do not really understand how you are supposed to develop real applications for the two platforms, considering that Java developers and .NET developers who are learning Scala, are used to reusing libraries friom their respective platform, e.g. log4j vs log4net, Hibernate vs NHibernate, Spring vs Spring.NET. For example, it does not seem very productive to create Scala abstraction layers for all popular third-part libraries you want to use. I mean, you might define an adapter trait that defines some SQL related methods you want to use, and then you can create one adapter implementation that reuses the Java Spring jar-file with the class 'org.springframework.jdbc.core.JdbcTemplate' while another adapter implementation reuses the Spring.NET assembly (dll-file) with the class 'Spring.Data.AdoTemplate'. Then somehow, I guess the shared Scala code would need to be able to determine which implementation to instantiate and include in the build script for the target platform, without introducing a dependency to a Java or .NET specific DI/IoC library. Or maybe, if you want to develop for multiple target platforms, then you maybe should only use the Scala core library and Scala native libraries. However, I guess these kind of "native" libraries are very rare, if you define a native library as a library only depending on the Scala core library (without dependencies to Java packages in jar-files) or using other native liberaries without such dependencies. Therefore, this does not feel as a realistic alternative neither for real applications (I mean those far beyond hello world examples). Though, maybe I have completely misunderstood something, and maybe the purpose of the "cross-platfrom-deployment" is to simply choose one platform for the development. If you are used to Java programming, then you reuse all your Java libraries (jar-files) that you are used to, and if you are used to .NET programming, then you reuse all your DotNet libraries (dll-file assemblies) that you are used to. When you then want to deploy to the other platform, then the compilers will either "convert" all functionality in the referenced jar-files into assemblies to make them executable in a .NET runtime, or (for Scala.NET developers) convert all functionality in the referenced dll assemblies into jar-files to make them executable in a Java runtime ? </pre> jsamot 2012-05-25T12:53:34 http://comments.gmane.org/gmane.comp.lang.scala.user/53581 <pre>Hi, Do java.math.BigDecimal and scala.math.BigDecimal differ in a sense of functionality? Please see the output of REPL; is it the expected behavior? Welcome to Scala version 2.9.2 (OpenJDK Client VM, Java 1.8.0-ea). Type in expressions to have them evaluated. Type :help for more information. scala&gt; new java.math.BigDecimal(10).pow(50).remainder(new java.math.BigDecimal(45)) res0: java.math.BigDecimal = 10 scala&gt; BigDecimal(10).pow(50).remainder(BigDecimal(6)) java.lang.ArithmeticException: Division impossible at java.math.BigDecimal.divideToIntegralValue(BigDecimal.java:1863) at java.math.BigDecimal.divideAndRemainder(BigDecimal.java:1995) at java.math.BigDecimal.remainder(BigDecimal.java:1929) at scala.math.BigDecimal.remainder(BigDecimal.scala:255) at .&lt;init&gt;(&lt;console&gt;:8) at .&lt;clinit&gt;(&lt;console&gt;) at .&lt;init&gt;(&lt;console&gt;:11) at .&lt;clinit&gt;(&lt;console&gt;) at $print(&lt;console&gt;) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:57) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:474) at scala.tools.nsc.interpreter.IMain$ReadEvalPrint.call(IMain.scala:704) at scala.tools.nsc.interpreter.IMain$Request$$anonfun$14.apply(IMain.scala:920) at scala.tools.nsc.interpreter.Line$$anonfun$1.apply$mcV$sp(Line.scala:43) at scala.tools.nsc.io.package$$anon$2.run(package.scala:25) at java.lang.Thread.run(Thread.java:722) Thank you, Viktoras Agejevas </pre> Viktoras Agejevas 2012-05-25T12:25:05 http://comments.gmane.org/gmane.comp.lang.scala.user/53577 <pre>Hi Scala folks, I cannot manage to explain to myself the following behavior. Roughly, I'm trying to use pattern matching to test if my variable is instance of some traits. The problem arises when I try to match with different traits that are mixins in the same object. Here is a minimal example: trait A trait B extends A trait C extends A val ab = new A with B val ac = new A with C val abc = new A with B with C def f1(a:Any)=a match { case i:B if i==1 =&gt; -1 case i:B if i == None =&gt; 0 case i:C =&gt; 1 case _ =&gt; 2 } def f2(a:Any)=a match { case i:C =&gt; 1 case i:B if i==1 =&gt; -1 case i:B if i == None =&gt; 0 case _ =&gt; 2 } defined trait A defined trait B defined trait C ab: java.lang.Object with A with B = $anon$3&lt; at &gt;5b784ece ac: java.lang.Object with A with C = $anon$4&lt; at &gt;377de54c abc: java.lang.Object with A with B with C = $anon$2&lt; at &gt;384cb13e f1: (a: Any)Int f2: (a: Any)Int f1(ab) //expected result: 2 because C is not mixin res5: Int = 2 f1(ac) //expected result: 1 because C is mixin res6: Int = 1 f1(abc) //expected result: 1 because C is not mixin =&gt; WHY DOES IT RETURN 2 res7: Int = 2 f2(abc) //if pattern matching is done first on C (like in f2) then it works!!! res8: Int = 1 ******************************************** Could someone explain to me why f1 doesn't work(res7) while f2 works(res8) ? It seems that the fact that matching against type B but without passing the guard prevents from matching against type C...I don't see why...I thought this would have been translated into a series of i/else using isInstanceOf[] in which case it should work?!? Thanks in advance for any tip! ma </pre> Marc-Antoine Nüssli 2012-05-25T11:10:40 http://comments.gmane.org/gmane.comp.lang.scala.user/53576 <pre> Hi, I'm having trouble understanding some aspects of Scala's type inference. At the moment I'm not sure whether I just ran into a couple of corner cases of the Scala spec or if there possibly is some bug somewhere in Scala. I have the following code (Scala 2.9.2): trait RE In the repl, I get: scala&gt; val r = new RR r: RR = RR&lt; at &gt;79bd18e4 &lt;console&gt;:16: error: inferred type arguments [Nothing,RR] do not conform to val p = new P(r) The error message is somewhat unspecific, as it does not say which of the type arguments does not conform. I'm also surprised, that the left argument is inferred as Nothing instead of RA. I think (maybe naively) that this should be possible at least in principle, as the compiler has all necessary type information. So, I decide that the first argument is the problem and I change the definition of P to introduce a dummy parameter: class P[A &lt;: FE, B &lt;: F[A]](b: B, a: A) extends R[PS] { def o = new PS } I get: scala&gt; val r = new RR Indeed, the problem seems to be that Scala does not infer the first type parameter correctly without an explicitly given parameter of that type. However, the dummy parameter is somewhat hackish and definitely spoils my intended class design. So I try to compensate this with a default parameter: class P[A &lt;: FE, B &lt;: F[A]](b: B, a: A = b.o) extends R[PS] which the compiler doesn't like (error: not found: value b), which is compatible with the Scala spec, I think. So instead, I move the dummy parameter into the second parameter list: class P[A &lt;: FE, B &lt;: F[A]](b: B)(a: A = b.o) extends R[PS] { def o = new This gets past the compiler, but the repl session yields: scala&gt; val r = new RR My final attempt is to leave away the default parameter: class P[A &lt;: FE, B &lt;: F[A]](b: B)(a: A) extends R[PS] { def o = new PS } which yields: scala&gt; val r = new RR That is, by moving the parameter to the second parameter list, Scala seems no longer to be able to infer RA instead of Nothing. Here are my questions: 1. Is it compatible with the Scala spec that in my first attempt Scala infers Nothing instead of RA? 2. The inferred type changed when I moved the dummy parameter from the first to the second parameter list. Is this also intended behaviour? 3. Is there a way to make my first attempt work without introducing a dummy argument? Thanks, Markus </pre> MP 2012-05-25T11:09:54 http://comments.gmane.org/gmane.comp.lang.scala.user/53568 <pre>I'm just like to revive a pretty ancient thread [1] about interest in a collection of Scala puzzlers by pointing out that http://scalapuzzlers.com is finally live. Feedback, comments and, of course, submissions much appreciated! ap [1] http://www.scala-lang.org/node/3247 </pre> Andrew Phillips 2012-05-24T23:59:53 http://comments.gmane.org/gmane.comp.lang.scala.user/53546 <pre>Dear all, I'm trying to model the following AST: An expression is either an operation or a value. An operation is reducible to a value via `eval` method. Concrete operations have expressions as parameters. It should be possible to restrict those parameters to expressions that evaluate to some concrete types of values. The problem: a method that processes a map[String, Value] doesn't compile (Scala 2.9.2): scala&gt; :paste // Entering paste mode (ctrl-D to finish) sealed abstract class Expr[T &lt;: Value[_]] {def eval: T} sealed abstract class Op[T &lt;: Value[_]] extends Expr[T] sealed abstract class Value[T &lt;: Value[_]] extends Expr[T] {def eval = this.asInstanceOf[T]} def rename(s: String): String = "xxx" def process(m: Map[String, Value[_]]): Map[String, Value[_]] = m map {t =&gt; (rename(t._1), t._2)} // Exiting paste mode, now interpreting. &lt;console&gt;:12: error: type mismatch; found : scala.collection.immutable.Iterable[(java.lang.String, Value[_$4]) forSome { type _$4 }] required: Map[String,Value[_]] def process(m: Map[String, Value[_]]): Map[String, Value[_]] = m map {t =&gt; (rename(t._1), t._2)} ^ Can you help me to solve this riddle? Perhaps, a better definition for Expr-Op-Value hierarchy? Thank you, Eugen </pre> Eugen Labun 2012-05-24T11:21:30 http://comments.gmane.org/gmane.comp.lang.scala.user/53545 <pre> I'm rather confused by this: Welcome to Scala version 2.9.2 (Java HotSpot(TM) Server VM, Java 1.6.0_18).Type in expressions to have them evaluated.Type :help for more information. scala&gt; import math.Ordering.Implicits._import math.Ordering.Implicits._ scala&gt; "a" min "b"&lt;console&gt;:11: error: type mismatch; found : java.lang.String("b") required: Ordering[?] "a" min "b" ^ And yet... scala&gt; implicitly[Ordering[String]]res1: Ordering[String] = scala.math.Ordering$String$&lt; at &gt;19dbc3b what does it means "required: Ordering[?]". Is this a bug? Chris </pre> Chris Marshall 2012-05-24T11:10:48 http://comments.gmane.org/gmane.comp.lang.scala.user/53539 <pre>I've seen some references &lt; at &gt;deprecated("Scala Actors are beeing removed from the standard library. Please refer to the migration guide.", "2.10") Does anyone know where to find this guide, if it exists? Google fails me. best regards, Scott Morrison </pre> Scott Morrison 2012-05-24T06:01:00 http://comments.gmane.org/gmane.comp.lang.scala.user/53537 <pre>Hi, I want to use a Java TreeMap with a Comparator to sort the entries in the Map in order of their values, in Scala 2.9.2. I have the following code. var map = new TreeMap[String, Int](cmp) val cmp: Comparator[String] = new Comparator[String] { def compare(a: String, b: String): Int = map.get(a).compare(map.get(b)) } map.put("name",1) map.put("email",3) map.put("key",89) println(map firstKey) But when I run the above segment I get the output as email where as I was expecting key as the output. What am I doing wrong? Thanks, Sankha </pre> Sankha Narayan Guria 2012-05-24T03:34:17 http://comments.gmane.org/gmane.comp.lang.scala.user/53536 <pre>Hi all, I just discovered to my dismay that it's not possible to write a method that takes a GenSeq argument, and then have (for example) .map calls on that argument be run in parallel depending on whether the passed argument was actually a ParSeq or not! To see this, note that (0 until 1000).par.asInstanceOf[scala.collection.GenSeq[Int]].map({ _ + 1 }) doesn't actually run the map in parallel. This is because of the implementation of ParIterableLike.map&lt;https://github.com/scala/scala/blob/v2.9.2/src/library/scala/collection/parallel/ParIterableLike.scala#L504&gt;is def map[S, That](f: T =&gt; S)(implicit bf: CanBuildFrom[Repr, S, That]): That = bf ifParallel { pbf =&gt; executeAndWaitResult(new Map[S, That](f, pbf, splitter) mapResult { _.result }) } otherwise seq.map(f)(bf2seq(bf)) and once you've "forgotten" from the ParSeq down to a GenSeq, there's no longer any way for the compiler to provide an implicit CanBuildFrom argument which is parallel. In the snippet above, the implicit CanBuildFrom is provided by the implicit on GenSeq implicit def canBuildFrom[A] = new GenericCanBuildFrom[A] whereas we really need something like ParSeq's implicit def canBuildFrom[T]: CanCombineFrom[Coll, T, ParSeq[T]] = new GenericCanCombineFrom[T] Is there any way around this? I can duplicate all of my code, for example instead of writing def foo(x: GenSeq[Int]) = x.map(_ + 1) I could write def foo(x: GenSeq[Int]) = { x match { case x: ParSeq[_] =&gt; x.asInstanceOf[ParSeq[Int]].map(_ + 1) case _ =&gt; x.map(_ + 1) } } but this gets pretty tedious when writing complicated algorithms! Is there any better solution? I'd really like to just be able to take a GenSeq argument, and have map, reduce, filter, etc work "as expected". Is there any magic implicit incantation that ensures that calls to map are provided with better CanBuildFrom instances than the GenSeq object can provide? best regards, Scott Morrison </pre> Scott Morrison 2012-05-24T01:19:27 http://comments.gmane.org/gmane.comp.lang.scala.user/53535 <pre>The following two refiy invocations create expressions representing an immutable and mutable map respectively: and they seem to work as expected when evaluated: But when I use show or showRaw, they give exactly the same results: I would have expected that show and showRaw would give different results? In particular, I would expect that instead of newTypeName("HashMap") one would make reference to collection.immutable.HashMap and the other would make reference to collection.mutable.HashMap? -- paul.butcher-&gt;msgCount++ Snetterton, Castle Combe, Cadwell Park... Who says I have a one track mind? http://www.paulbutcher.com/ LinkedIn: http://www.linkedin.com/in/paulbutcher MSN: paul-q9qwgYRQEc9WkMItezQGDw&lt; at &gt;public.gmane.org AIM: paulrabutcher Skype: paulrabutcher </pre> Paul Butcher 2012-05-23T22:27:32 http://comments.gmane.org/gmane.comp.lang.scala.user/53531 <pre>Hi, I'm trying to convert traits with type parameters (together with self types) to traits with abstract type members. Here's an example: object TP { trait A[X,AA &lt;: A[X,AA]] { self: AA =&gt; def a: AA = this } trait A1[X,AA &lt;: A1[X,AA]] extends A[X,AA] { self: AA =&gt; def a1: AA = this } } Note that traits A and A1 in object TP (Type Parameters) have self type references. It is important that methods a and a1 return different abstract traits, with different type bounds. (a: AA &lt;: A and a1: AA &lt;: A1) I've tried to translate TP to AT (Abstract Types) but that doesn't compile: object AT { trait A { type AA &lt;: A def a: AA = this } trait A1 extends A { type AA &lt;: A1 def a1: AA = this } } How to translate TP without using type parameters? or more generally: Can traits with type parameters can always be translated to traits with abstract type members, and vice versa. or specifically: Can https://github.com/rapido/oer/blob/master/src/oer/AbstractImmutableOrderedSet.scala be simplified? Thanks, Robbert. </pre> Robbert van Dalen 2012-05-23T19:10:24 http://comments.gmane.org/gmane.comp.lang.scala.user/53529 <pre>Http://www.virtual-clouddrive.org - Data emancipation for the rest of us. Feel free to ask for help - this is important to me on a moral level. Based on Voldemort for the metadata stores that actually protect you with a Lift front end (that could use a tasteful designer :-). All written in Scala. Enjoy, Maarten </pre> maarten 2012-05-23T18:13:17 http://comments.gmane.org/gmane.comp.lang.scala.user/53521 <pre>Hi all, Scala is a great language with first-class functions and support for functional programming. The IFL conference is interested to hear from researchers engaged in the implementation and application of functional and function-based programming languages. You can show what Scala can do in this area by submitting either a draft paper or an extended abstract describing work to be presented at the symposium. ------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2012 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze-6XCrzUfQPq02Hvz0r4duyA&lt; at &gt;public.gmane.org Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze-6XCrzUfQPq02Hvz0r4duyA&lt; at &gt;public.gmane.org For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea José Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US </pre> Daniel James 2012-05-23T10:52:21 http://comments.gmane.org/gmane.comp.lang.scala.user/53513 <pre>Not sure how many users here use hadoop. But, I am writing to this group as the test case i have is the HelloWorld of MapReduce, the word count and believe its more of a Scala/Java interop issue. I narrowed it down to my Map task implementation. I say this because when i reference and use a Java implementation of a equivalent( seemingly so) Java version, everything works fine. Java version public class TokenCounterMapperJava extends Mapper&lt;LongWritable, Text, Scala version class TokenCounterMapper extends Mapper[LongWritable, Text, Text, Here is a link to the full page of code in Scala. https://gist.github.com/2773592 I get the following error. FYI, I get this error when i run it locally, not even on a cluster. ############ java.io.IOException: Type mismatch in key from map: expected org.apache.hadoop.io.Text, recieved org.apache.hadoop.io.LongWritable at org.apache.hadoop.mapred.MapTask$MapOutputBuffer.collect(MapTask.java:871) at org.apache.hadoop.mapred.MapTask$NewOutputCollector.write(MapTask.java:574) at org.apache.hadoop.mapreduce.TaskInputOutputContext.write(TaskInputOutputContext.java:80) at org.apache.hadoop.mapreduce.Mapper.map(Mapper.java:124) at org.apache.hadoop.mapreduce.Mapper.run(Mapper.java:144) at org.apache.hadoop.mapred.MapTask.runNewMapper(MapTask.java:647) at org.apache.hadoop.mapred.MapTask.run(MapTask.java:323) at org.apache.hadoop.mapred.LocalJobRunner$Job.run(LocalJobRunner.java:210) ########### I am using hadoop 0.20.2 specifically cdh3u4 thanks Arun </pre> Arun Ramakrishnan 2012-05-23T07:02:49 http://comments.gmane.org/gmane.comp.lang.scala.user/53509 <pre>Hi, I run across a very weird situation (using scala 2.9.1). Following code crashes at last line. For some reason Sub1 does not crash while almost identical Sub2 does with java.lang.NullPointerException: abstract class Base { val t:String val n=t.head def p=println(t,n) } //cannot use "case class" since no arguments class Sub1(val t:String) extends Base { } class Sub2 extends Base { val t="" } //this does not crash new Sub1("bb") //this crashes new Sub2() What could be a reason of different behaviour? Thx, Andy </pre> Andy Coolware 2012-05-23T05:30:53 http://comments.gmane.org/gmane.comp.lang.scala.user/53507 <pre>Hi! I'm working with OSGI and Apache Karaf. I cannot install scala-compiler as a bundle because it depends on org.apache.ant. I get the following message: Unresolved constraint in bundle scala-compiler [81]: Unable to resolve 81.0: missing requirement [81.0] osgi.wiring.bundle; (osgi.wiring.bundle=org.apache.ant) I tried with ant 1.8.3 distribution without success. Don't know what am I supposed to install then (which is the bundle "org.apache.ant" I'm supposed to install? Where can I get it?) Any help would be appreciated. </pre> oscarvarto 2012-05-23T01:50:15 http://comments.gmane.org/gmane.comp.lang.scala.user/53501 <pre>Hi All, I've recently introduced a few Scala tests into a large java code base. I've been experiencing an issue compiling the code. The compiler behavior seems non-deterministic and my attempts to produce a test case are failing so far. The behavior seems very similar to the following JIRA ticket https://issues.scala-lang.org/browse/SI-2940 . The exception happens on various platforms and in various environments, but sporadically (mac, windows, eclipse plugin, command line). The java interface that is listed in the exception is a part of an extensive generics+inheritance hierarchy. Here is the stack trace. Exception thrown while creating override indicators for XXXTest.scala java.lang.AssertionError: assertion failed: unsatisfiable cyclic dependency in 'trait XXXXX-MY-JAVA-INTERFACE-HERE' at scala.tools.nsc.symtab.classfile.ClassfileParser.parse(ClassfileParser.scala: 69) at scala.tools.nsc.symtab.SymbolLoaders $ClassfileLoader.doComplete(SymbolLoaders.scala:308) at scala.tools.nsc.symtab.SymbolLoaders $SymbolLoader.complete(SymbolLoaders.scala:111) at scala.tools.nsc.symtab.SymbolLoaders $SymbolLoader.load(SymbolLoaders.scala:130) at scala.tools.nsc.symtab.Symbols $Symbol.typeParams(Symbols.scala:913) at scala.tools.nsc.symtab.Types $TypeMap.mapOver(Types.scala:3117) at scala.tools.nsc.symtab.Types $SubstSymMap.apply(Types.scala:3607) at scala.tools.nsc.symtab.Types $SubstSymMap.apply(Types.scala:3592) at scala.tools.nsc.symtab.Types $TypeMap.mapOver(Types.scala:3160) at scala.tools.nsc.symtab.Types $SubstMap.apply(Types.scala:3567) at scala.tools.nsc.symtab.Types $SubstSymMap.apply(Types.scala:3611) at scala.tools.nsc.symtab.Types $Type.substSym(Types.scala:593) at scala.tools.nsc.symtab.Types$$anonfun $typeParamsToExistentials$1.apply(Types.scala:3341) at scala.tools.nsc.symtab.Types$$anonfun $typeParamsToExistentials$1.apply(Types.scala:3341) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.symtab.Types $class.typeParamsToExistentials(Types.scala:3341) at scala.tools.nsc.symtab.SymbolTable.typeParamsToExistentials(SymbolTable.scala: 13) at scala.tools.nsc.symtab.classfile.ClassfileParser.processClassType $1(ClassfileParser.scala:763) at scala.tools.nsc.symtab.classfile.ClassfileParser.sig2type $1(ClassfileParser.scala:777) at scala.tools.nsc.symtab.classfile.ClassfileParser.sig2typeBounds $1(ClassfileParser.scala:822) at scala.tools.nsc.symtab.classfile.ClassfileParser.scala$tools$nsc$symtab $classfile$ClassfileParser$$sigToType(ClassfileParser.scala:837) at scala.tools.nsc.symtab.classfile.ClassfileParser.parseAttribute $1(ClassfileParser.scala:883) at scala.tools.nsc.symtab.classfile.ClassfileParser.parseAttributes(ClassfileParser.scala: 1092) at scala.tools.nsc.symtab.classfile.ClassfileParser.parseClass(ClassfileParser.scala: 560) at scala.tools.nsc.symtab.classfile.ClassfileParser.parse(ClassfileParser.scala: 99) at scala.tools.nsc.symtab.SymbolLoaders $ClassfileLoader.doComplete(SymbolLoaders.scala:308) at scala.tools.nsc.symtab.SymbolLoaders $SymbolLoader.complete(SymbolLoaders.scala:111) at scala.tools.nsc.symtab.SymbolLoaders $SymbolLoader.complete(SymbolLoaders.scala:85) at scala.tools.nsc.symtab.Symbols $Symbol.info(Symbols.scala:730) at scala.tools.nsc.symtab.Types $TypeRef.baseTypeSeq(Types.scala:1943) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:869) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:909) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:909) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getClassParts$1(Implicits.scala:872) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:903) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$2.apply(Implicits.scala:922) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$2.apply(Implicits.scala:922) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:922) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits$ImplicitSearch $$anonfun$getParts$1$1.apply(Implicits.scala:910) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.getParts$1(Implicits.scala:910) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.companionImplicitMap(Implicits.scala:937) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.scala$tools$nsc$typechecker$Implicits$ImplicitSearch$ $implicitsOfExpectedType(Implicits.scala:1036) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.implicitManifestOrOfExpectedType(Implicits.scala:1154) at scala.tools.nsc.typechecker.Implicits $ImplicitSearch.bestImplicit(Implicits.scala:1181) at scala.tools.nsc.typechecker.Implicits $class.inferImplicit(Implicits.scala:67) at scala.tools.nsc.Global$analyzer $.inferImplicit(Global.scala:351) at scala.tools.nsc.typechecker.Typers $Typer.wrapImplicit$1(Typers.scala:168) at scala.tools.nsc.typechecker.Typers $Typer.inferView(Typers.scala:172) at scala.tools.nsc.typechecker.Typers $Typer.adaptToMember(Typers.scala:992) at scala.tools.nsc.typechecker.Typers$Typer.doAdapt $1(Typers.scala:1013) at scala.tools.nsc.typechecker.Typers $Typer.adaptToArguments(Typers.scala:1023) at scala.tools.nsc.typechecker.Typers $Typer.tryTypedApply$1(Typers.scala:3334) at scala.tools.nsc.typechecker.Typers$Typer.typedApply $1(Typers.scala:3371) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:4106) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers $Typer.typedArg(Typers.scala:2191) at scala.tools.nsc.typechecker.Typers $Typer.typedArgToPoly$1(Typers.scala:2479) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $32.apply(Typers.scala:2487) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $32.apply(Typers.scala:2487) at scala.Tuple2$Zipped$$anonfun$map $1.apply(Tuple2.scala:65) at scala.Tuple2$Zipped$$anonfun$map $1.apply(Tuple2.scala:63) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.Tuple2$Zipped.map(Tuple2.scala:63) at scala.tools.nsc.typechecker.Typers $Typer.doTypedApply(Typers.scala:2487) at scala.tools.nsc.typechecker.Typers$Typer.typedApply $1(Typers.scala:3373) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:4106) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers $Typer.typedQualifier(Typers.scala:4352) at scala.tools.nsc.typechecker.Typers $Typer.typedQualifier(Typers.scala:4358) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:4146) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $typedApply$1$1.apply(Typers.scala:3355) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $typedApply$1$1.apply(Typers.scala:3355) at scala.tools.nsc.typechecker.Typers $Typer.silent(Typers.scala:624) at scala.tools.nsc.typechecker.Typers$Typer.typedApply $1(Typers.scala:3355) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:4106) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers $Typer.typedBlock(Typers.scala:1920) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:3953) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers $Typer.transformedOrTyped(Typers.scala:4430) at scala.tools.nsc.typechecker.Typers $Typer.typedDefDef(Typers.scala:1760) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:3921) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers$Typer.typedStat $1(Typers.scala:2100) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $24.apply(Typers.scala:2184) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $24.apply(Typers.scala:2184) at scala.collection.immutable.List.loop$1(List.scala: 148) at scala.collection.immutable.List.mapConserve(List.scala:164) at scala.tools.nsc.typechecker.Typers $Typer.typedStats(Typers.scala:2184) at scala.tools.nsc.typechecker.Typers $Typer.typedTemplate(Typers.scala:1512) at scala.tools.nsc.typechecker.Typers $Typer.typedClassDef(Typers.scala:1278) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:3912) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers$Typer.typedStat $1(Typers.scala:2100) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $24.apply(Typers.scala:2184) at scala.tools.nsc.typechecker.Typers$Typer$$anonfun $24.apply(Typers.scala:2184) at scala.collection.immutable.List.loop$1(List.scala: 148) at scala.collection.immutable.List.mapConserve(List.scala:164) at scala.tools.nsc.typechecker.Typers $Typer.typedStats(Typers.scala:2184) at scala.tools.nsc.typechecker.Typers $Typer.typed1(Typers.scala:3908) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4273) at scala.tools.nsc.typechecker.Typers $Typer.typed(Typers.scala:4333) at scala.tools.nsc.typechecker.Analyzer$typerFactory$ $anon$3.apply(Analyzer.scala:94) at scala.tools.nsc.Global $GlobalPhase.applyPhase(Global.scala:329) at scala.tools.nsc.interactive.Global$TyperRun$$anonfun $applyPhase$1.apply(Global.scala:1054) at scala.tools.nsc.interactive.Global$TyperRun$$anonfun $applyPhase$1.apply(Global.scala:1054) at scala.tools.nsc.symtab.SymbolTable.atPhase(SymbolTable.scala:95) at scala.tools.nsc.interactive.Global $TyperRun.applyPhase(Global.scala:1054) at scala.tools.nsc.interactive.Global $TyperRun.typeCheck(Global.scala:1047) at scala.tools.nsc.interactive.Global.scala$tools$nsc $interactive$Global$$typeCheck(Global.scala:556) at scala.tools.nsc.interactive.Global$$anonfun $backgroundCompile$5$$anonfun$apply$7.apply(Global.scala:473) at scala.tools.nsc.interactive.Global$$anonfun $backgroundCompile$5.apply(Global.scala:469) at scala.tools.nsc.interactive.Global$$anonfun $backgroundCompile$5.apply(Global.scala:469) at scala.collection.TraversableLike$WithFilter$$anonfun $foreach$1.apply(TraversableLike.scala:743) at scala.collection.LinearSeqOptimized $class.foreach(LinearSeqOptimized.scala:59) at scala.collection.immutable.List.foreach(List.scala: 76) at scala.collection.TraversableLike $WithFilter.foreach(TraversableLike.scala:742) at scala.tools.nsc.interactive.Global.backgroundCompile(Global.scala:469) at scala.tools.nsc.interactive.PresentationCompilerThread.run(PresentationCompilerThread.scala: 25) Help or pointers are appreciated. Thank you Rostic </pre> Rostic 2012-05-22T17:56:16 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.scala.user