scala deal with string and do accumulative -


i have variable:

val list= rows.sortby(- _._2).map{case (user , list) => list}.take(20).mkstring("::")

the result println(list) should be:

60::58::51::48::47::47::45::45::43::43::42::42::42::41::41::41::40::40::40::39

and have deal these numbers (like histogram concept)

if set break 10, should divide max number (60) 10 , make 6 buckets:

  • the scope between 0~ 10(0<x<=10) have 0 numbers match
  • the scope between 10~ 20(10<x<=20) have 0 numbers match
  • the scope between 20~ 30(20<x<=30) have 0 numbers match
  • the scope between 30~ 40(30<x<=40) have 4 numbers match
  • the scope between 40~ 50(40<x<=50) have 13 numbers match
  • the scope between 50~ 60(50<x<=60) have 3 numbers match

and have save 2 variables x , y :

x:  0~10::10~20::20~30::30~40::40~50::50~60 y:  0::0::0::4::13::3

how can this? 

val actuallist = list.split("::").map(_.toint).tolist val step = 10 val steps = step actuallist.max step //for each step, output count of items in list  //between current step , currentstep - stepval val counts = steps.map(x=>actuallist.count(y=>y <= x && y > x - step)) val stepsasstring = steps.map(x=>s"${x-step}~$x")

and can map them too:

steps.zip(counts).tomap

note made more performant if list sorted first, wouldn't worry tuning unless need it


-

Popular posts from this blog

c# - ODP.NET Oracle.ManagedDataAccess causes ORA-12537 network session end of file -

overview i want replace oracle.dataaccess orcale. managed dataaccess, opening connection latter throws ora-12537 network session end of file exception. exception message / stack trace {oracleinternal.network.networkexception (0x000030f9): ora-12537 : netzwerksession: dateiende @ oracleinternal.network.readerstream.read(orabuf ob) @ oracleinternal.ttc.orabufreader.getdatafromnetwork() @ oracleinternal.ttc.orabufreader.read(boolean bignoredata) @ oracleinternal.ttc.marshallingengine.unmarshalub1(boolean bignoredata) @ oracleinternal.ttc.ttcprotocolnegotiation.readresponse()} i trying connect oracle 11g database , not have client installed on local machine. working test application (unmanaged) using oracle.dataaccess works fine . using system; using oracle.dataaccess.client; namespace app.odp.unmanaged { internal class program { private static void main(string[] args) { //dummy connection string...
Read more

utf 8 - split utf-8 string into bytes in python -

i trying split utf-8 string bytes in python 3. problem is, when use bytearray, byte, encode etc functions array size of element 14 bytes, not 1 byte expected. need split text file sequence of bytes , send them byte after byte using sockets. tried this: infile = open (file, "r") str = infile.read() byte_str = bytes(str, 'utf-8') print("size of byte_str",sys.getsizeof(byte_str[0])) print gives me 14, need 1... suggestion? quoting official documentation : sys.getsizeof(object[, default]) return size of object in bytes. object can type of object. built-in objects return correct results, not have hold true third-party extensions implementation specific. only memory consumption directly attributed object accounted for, not memory consumption of objects refers to. if given, default returned if object not provide means retrieve size. otherwise typeerror raised. getsizeof() calls object’s __sizeof__ method , adds ...
Read more

matlab - Compression and Decompression of ECG Signal using HUFFMAN ALGORITHM -

i want compress , decompress ecg signal stored text message text file , find out file size, cr,prd ratio,and qs. here code compression , decompression of ecg signal using huffman algorithm. i'm trying find out file size, compression ratio,prd ratio,qs. but error i'm getting the ecg file in text format. %clearing variables , screen enter code here clear all; close all; clc; [file1]=uigetfile('*.txt'); %fprintf('enter ecg file name :%s',file1); p=file1; t=sprintf('%s',p); b1=dlmread([file1]); len=length(b1); lead=input('enter lead number :'); %lead=str2double(lead); col2=b1(1:end,lead); e=fix(sqrt(len)); m=1; i=1:e j=1:e g2(i,j)=fix(col2(m)*1000); %amplifying 1000 m=m+1; end end g3=g2; i=1:e j=1:e ...
Read more