performance - SCALA: Which data structures are optimal in which siutations when using ".contains()" or ".exists()"? -

-

i know in situations data structures optimal using "contains" or "exists" checks.

i ask because come python background , used using if x in something: expressions everything. example, expressions evaluated quickest:

val m = map(1 -> 1, 2 -> 2, 3 -> 3, 4 -> 4)                                           //> m  : scala.collection.immutable.map[int,int] = map(1 -> 1, 2 -> 2, 3 -> 3, 4                                           //|  -> 4) val l = list(1,2,3,4)                     //> l  : list[int] = list(1, 2, 3, 4) val v = vector(1,2,3,4)                   //> v  : scala.collection.immutable.vector[int] = vector(1, 2, 3, 4)  m.exists(_._1 == 3)                       //> res0: boolean = true m.contains(3)                             //> res1: boolean = true l.exists(_ == 3)                          //> res2: boolean = true l.contains(3)                             //> res3: boolean = true v.exists(_ == 3)                          //> res4: boolean = true v.contains(3)                             //> res5: boolean = true

intuitively, assume vectors should quickest random checks, , lists quickest if 1 knows value checked in beginning of list , there lot of data. however, confirmation or correction welcome. also, please feel free expand other data structures.

note: please let me know if feel question vague i'm not sure phrasing correctly.

set , map (with default hash table implementation) far fastest @ contains since compute hash value , jump right location immediately. example, if want find arbitrary string out of list of thousand, contains on set 100x faster contains on list or vector or array.

with exists, care how fast collection traverse--you have traverse anyway. there, list champ (unless want traverse array hand), set , on particularly bad (e.g. exists on list ~8x faster on set when each have 1000 elements). others within 2.5x of list (usually 1.5x, vector has underlying tree structure not fast traverse).


Comments

Post a Comment

Popular posts from this blog

java - Jmockit String final length method mocking Issue -

-
using jmockit 1.2 jar, trying mock string's length method getting unexpected invocation exception: failed: test java.lang.illegalstateexception: missing invocation mocked type @ point; please make sure such invocations appear after declaration of suitable mock field or parameter @ stringdemo.testa$1.<init>(testa.java:17) @ stringdemo.testa.test(testa.java:13) i using testng: @test public void test() throws exception { new expectations() { @mocked("length") string astring; { astring.length(); result = 2; } }; system.out.println(a.showa("test")); } } actual class a: public class { public static int showa(string str){ int a= str.length(); return a; } } this wrong way of recording expected results. shouldn't mock , record string's length() method, record showa() instead. here solution @suppresswarnings("unused...
Read more

What is the difference between data design and data model(ERD) -

-
i have google question , find answer in day. know, data design many many table have list column,and mark pk , fk. why er-diagram have find this? data design process of designing database. main output of data design detailed logical data model of database. some people data design includes of needed logical , physical design choices , physical storage parameters needed generate design in data definition language. technically, database analysis, database analysts (dbas) trained do. while person can both data design , database analysis, these 2 different tasks. data design models data. database analysis takes model , applies 1 or more database engines (relational, hierarchical, nosql). a logical data model 1 of main outputs of data design. data model represented entity relationship diagram, or er diagram.
Read more

ios - Can NSManagedObject conform to NSCoding -

-
i need transfer single object across device. right converting nsmanagedobject dictionary , archiving , sending nsdata. upon receiving unarchiving it. transfer nsmanagedobject archiving , unarchiving instead of creating intermediate data object. @interface test : nsmanagedobject<nscoding> @property (nonatomic, retain) nsstring * title; @end @implementation test @dynamic title; - (id)initwithcoder:(nscoder *)coder { self = [super init]; if (self) { self.title = [coder decodeobjectforkey:@"title"]; //<crash } return self; } - (void)encodewithcoder:(nscoder *)coder { [coder encodeobject:self.title forkey:@"title"]; } @end nsdata *archivedobjects = [nskeyedarchiver archiveddatawithrootobject:testobj]; nsdata *objectsdata = archivedobjects; if ([objectsdata length] > 0) { nsarray *objects = [nskeyedunarchiver unarchiveobjectwithdata:objectsdata]; } the problem above code is. crashes @ self.title in initwithcoder sa...
Read more