python - IPv4Network object as key in dictionary -


i'm using ipv4network ipaddress module keys in dict. allows me duplication quickly, , note other data.

however, i'm curious if can stack in statements , keep away o(n) processing.

from ipaddress import ipv4network net1 = ipv4network('10.10.10.0/24') net2 = ipv4network('10.10.10.128/25') net3 = ipv4network('10.10.10.0/24')  dict1 = {net1: 'winner!'} print(dict1.get(net3)) winner!  if net3 in dict1:     print('yup') yup  # -------- doesn't work, looking way accomplish it. if net2.network_address in dict1:     print('wouldn't nice?) # --- yes can this. keys in dict1:     if net2.network_address in keys:          print(keys, 'i\'m inside you!')

any ideas clever trick? way restructure leverage built-in?

i want know if

  1. the key exists in duplicate (easy); and
  2. if ipv4network contained inside 1 of keys.

there's no simple way want. python's dictionary lookups use hashing efficiently find exact matches dictionary's keys. there's no way hash of network match addresses contains.

you might able write own logic test single network or address against multiple networks efficiently, code need know how ip addresses , network masks work. i'd suggest based on trie, special logic support host bits.

if want write looped code on single line, use any:

if any(net2.network_address in key key in dict1):     ...

but that's not nicer current code. it's not same, since any short circuits after finding single match. any code won't print multiple times if multiple keys contain net2's address. replicate any's behavior in original looping code putting break after print call in code.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more