Finding the intersect of two arrays in Fortran -


i'm trying generate intersect of 2 1-d arrays in fortran.

the intent use intersection mask in maxloc can pull max few elements 1 array (behavior analogous repeated root removal in max heap).

currently set value @ index found maxloc 0 after insert value @ index second array hoping fortran had clever mask-related method this. (it nice leave original array intact during procedure of max-retrieval)

i not quite sure mean. if want compare 2 arrays index index, can using ==, so:

integer :: a(4), b(4) logical :: inter(4)  = (/ 1, 2, 3, 4 /) b = (/ 4, 2, 3, 1 /) inter = (a == b)  ! (/ f, t, t, f /)

this not technically intersection, mask in maxloc needs array of logical, assumed that want.

if want test whether value of a anywhere in b, have use @ least 1 do loop, think:

do j = 1, size(a)     inter(j) = any(a(j) == b) end

if want find largest, say, n values, can use this:

function largest(vars, n)     implicit none     integer, intent(in) :: n     real, dimension(:), intent(in) :: vars     real, dimension(n) :: largest     integer ::     logical, dimension(size(vars)) :: m     integer :: mloc      m = .true.      = 1, n        mloc = maxloc(vars, dim=1, mask=m)        m(mloc) = .false.        largest(i) = vars(mloc)     end     return end function largest

basically uses mask true, every time reverts mask highest false not value again in next iteration.

of course, of order (n*size(var)), if n large, might quicker bubble sort until have n largest values accumulated @ end, , pick them up.


Comments

Post a Comment

Popular posts from this blog

c++ - Difference between pre and post decrement in recursive function argument -

i have following sample code used pre-decrement void function(int c) { if(c == 0) { return; } else { cout << "dp" << c << endl; function(--c); cout << c << endl; return; } } this function give output input 4 : dp3 dp2 dp1 dp0 0 1 2 3 but when use post decrement void function(int c) { if(c == 0) { return; } else { cout << "dp" << c << endl; function(c--); cout << c << endl; return; } } output goes in infinite loop dp4 can explain me in detail why happens ? this happens because function(c--) called same value of c , when finishes c decremented. recursively called, hence called same value no chance of return , hit stack overflow error. assume this, int x = 1, y = 0; y = x++ result y == 1 , x == 2. if y = ++x , bot x , y 2.
Read more

php - Nothing but 'run(); ' when browsing to my local project, how do I fix this? -

i added new project. made mistake in projectname.conf file in sites-available apache2, led me reinstalling apache2. after reinstalling , re-enabling projects on every page of every project .. <body> run(); </body> .. i've run composer update, restarted service, restarted pc, checked config files, tried disabling new project. there nothing in error log, , access.log: 127.0.0.1 - - [15/may/2015:01:40:47 +0200] "get / http/1.1" 304 181 "-" "mozilla/5.0 (x11; ubuntu; linux x86_64; rv:38.0) gecko/20100101 firefox/38.0" maybe i'm forgetting apache2 reinstall? don't think did different last time installed it. looks haven't setup php correctly. take @ this great guide , maybe you're forgetting link php config apache2.
Read more

php - How can I echo out this array? -

i don't know how go grabbing data in variable , put foreach loop. class tree{ private $info = array( array('name'=>'jim','state'=>'nu','company'=>'nu','phone'=>array('cell'=>'5615111111','office'=>'5611111111'),'email'=>array('primary'=>'exs@example.com','ex@there.com')), array('name'=>'joe smith','city'=>'phoenix','phone'=>'4805551111','email'=>'jsmith@some_email.com'), array('name'=>'john doe','city'=>'chandler','company'=>'doe co.','email'=>array('jdoe@gmail.com','personal'=>'email@email.com'),'phone'=>'6025550002') ); } if you're inside of class, can access private variable using $this->variablename . example, i...
Read more