html - positioning two elements inside a parent to be the same height -


i have 2 divs need position inside containing div need both same height no matter content goes in either of them, need take height of tallest 1 hence absolutes , top bottom set 0, container div #three collapses , hides 2 thumb divs content.

section#three {      width: 100%;      max-width: 1050px;      margin: 0 auto;      padding: 70px 0px 70px 0px;      position: relative;  }    section#three div.thumb-container {      width: 40%;      top: 0;      bottom: 0;      position: absolute;      clear: both;  }    section#three div#left-thumb-container {      left: 5%;  }    section#three div#right-thumb-container {      right: 5%;  }
<section id="three">      <div class="thumb-container" id="left-thumb-container">          content here expand divs      </div>        <div class="thumb-container" id="right-thumb-container">          content here expand divs      </div>  </section>

i recommend use flexbox solve issue. https://codepen.io/imohkay/pen/gpard can see example there. 

#three {    display: flex;  }    .thumb-container {    background: gray;    border-left: 1px solid #fff;    flex: 1 0;    padding: 30px;  }
<section id="three">      <div class="thumb-container" id="left-thumb-container">          content here expand divs          <p>lorem ipsum dolor sit amet, consectetur adipisicing elit. sapiente beatae nulla earum error reiciendis molestias praesentium, doloribus esse provident harum illum, voluptate vero ratione unde fugit repellendus laboriosam ad officiis.</p>      </div>        <div class="thumb-container" id="right-thumb-container">          content here expand divs      </div>  </section>


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