c++ - Has this vector occured before -


i have lot of vectors (in order of 10^4, more!) , getting more vectors in input stream. so, example, have

  • v1 = 1 0 4 1 1
  • v2 = 1 1 2 5 3 6 2
  • v3 = 0 1 1 5 0

i have 10^4 such vectors now, in input vector v4 = 0 1 1 5 0, , want check if has appeared before or not, how suggest me this?

i list techniques have thought of, , errors accompany them:

  • to use std::map, or std::set same. but, std::map std::set not support vector argument.
  • to convert every integer in vector string type, append them in order , store string in map. error: case of v5 = 11 1 1 1 , v6 = 1 1 1 1 1 shown same.
  • similiar above, add delimiter after every integer. error: tedious code?

i wished know if can think of method achieve this?

edit: 10^4, it's achievable. new task requires me store upto 10^9. don't think stl have space, have thrown sigabrt error. know other efficient hashing method can work in case?

the simple method of doing store vectors in vector, , maintain order of std::sort() family of functions, using std::lexigraphical_compare sort predicate. allow binary searching list in o(log(n)) amortized time, @ expensive of semi-costly sort operation, can reduced playing games heapifying or partitioning list-of-vectors load it.

more efficient this, however, store vectors trie (https://en.wikipedia.org/wiki/trie), each path down trie stores unique sequence vectors. depending on variance in data, can more space-efficient, , both addition , search o(log(n)) operations.

take advice grain of salt, however, 10^4 elements tiny number. experience differences in efficiency sorting & searching algorithms start show on modern hardware when you're in 10^6-10^7 range data set. below scale, oft times simplest, cache-friendly algorithm wins out.

another alternative if you're going raw speed, , list of vectors scan known , static, use finite state machine accept/reject input. tools ragel can make short work of such problems.


Comments

Post a Comment

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

i'm implementing inapp billing in android app. works well, however, i'm trying decouple broadcast receiver activity manifest. suggestion in android's trivialdrive sample: // important: dynamically register broadcast messages updated purchases. // register receiver here instead of <receiver> in manifest // because call getpurchases() @ startup, therefore can ignore // broadcasts sent while app isn't running. // note: registering listener in activity bad idea, done here // because sample. regardless, receiver must registered after // iabhelper setup, before first call getpurchases(). currently there's class extends broadcastreceiver : public class iabbroadcastreceiver extends broadcastreceiver { /** * intent action receiver should filter for. */ public static final string action = "com.android.vending.billing.purchases_updated"; private final iabbroadcastlistener mlistener; public iabbroadcastreceiver(iabbroadcastlistener listener) { m...
Read more

python Tkinter Capturing keyboard events save as one single string -

is possible store keyboard events 1 string? code below stores 1 char , prints it. card reader or bar code reader, contains collection of character/ string not 1 character @ time. goal save char pressed text variable. from tkinter import * root = tk() def key(event): text= event.char text+= event.char print ("pressed", text) def callback(event): frame.focus_set() print ("clicked at", event.x, event.y) frame = frame(root, width=100, height=100) frame.bind("<key>", key) frame.bind("<button-1>", callback) frame.pack() root.mainloop() currently, creating text variable , everytime key() function gets called, , text stores last character typed. you can define text module level variable , , use module level text inside key function - text = '' def key(event): global text text+= event.char print("pressed", text)
Read more

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -

here tables: create table customer ( cid int primary key, name varchar(32) ) create table ord ( oid int primary key, cid int foreign key references customer, address varchar(20) ) here's linq-to-sql statement: var aaa = c in db.customer select new { c, o = c.ord.tolist() }; and here's inexplicable query generated linq-to-sql: select [t0].[cid] [cid], [t0].[name] [name], [t1].[oid] [oid], [t1].[cid] [cid2], [t1].[address] [address], (select count(*) [dbo].[ord] [t2] [t2].[cid] = [t0].[cid]) [value] [dbo].[customer] [t0] left outer join [dbo].[ord] [t1] on [t1].[cid] = [t0].[cid] order [t0].[cid], [t1].[oid] i want understand how rid of count(*) part. it's entirely uncalled for! linq needs count(*) in order determine number of entries returned o = c.ord.tolist() .
Read more