similar to: js .closest

Hello, I have select field which after a choice happened, feeds another select field. Using the gem Cocoon to duplicate this set of select fields. My problem now is to find a solution that the coffee script supplies values for each select field-set separately. My code: form <%= render 'usergroup_fields', :f => usergroup %> <%= link_to_add_association "Add

Hi.. I need some support... table: week_id, user_id, project_id, hours ex. => 33, 2, 1, 10 34, 2,1,15 33, 2, 2, 20 35, 3, 1,20 etc. Want to display a sum of hours per week_id per user_id I have: @hours = HourUser.includes(:user).group_by { |h| h.week_id } @hours.keys.sort.each do |hour| @hours[hour].collect(&:stunden).sum Hours are summed up, but not sorted by user_id.. How to get

Hi, I'm using AMP and its dialparties.agi as most important script in system. I'd like to port configuration to more embedded system, where I don't have Perl available. So I'd like to implement dialparties.agi functionality as closest as possible with dialplan language..... Are there any existing dialplan scripts-examples that are close related to dialparties.agi

On 06/04/2017 10:29 AM, Jos Vos wrote: > Hi, > > Do CentOS 7 installs not automatically use a closest mirror for > installing like Fedora does, or is that due to the way I'm starting > the install (virt-install)? > > Background: > > I'm trying to find the best way to do installs using basic local media > (network install, but *without* the need to download

The original problem I posed was Let x = real vector of length n y = real vector of length n w = real vector of length m, m typically less than n/2 but can be > n z = real vector of length m For w[i], i=1,,,m, find the value of x that is closest to w[i]. In the case of ties, select one (optimally at random or just take the first match). Let z[i] = value of y corresponding to the

Hello, What would be in R the closest match to a c-struct? e.g. data.frame requires all elements to be of the same length ... or is there a way to circumvent this? TIA, Best regards, Giovanni

Dear R-user, For the "matplot" of the following data drawn by >matplot(t, pch=1) structure(c(2372L, 2494L, 2170L, 2238L, 1918L, 715L, 1573L, 2437L, 2481L, 1881L, 440L, 2165L, 343L, 121L, 597L, 1163L, 1459L, 2093L, 1454L, 1761L, 1872L, 174L, 2040L, 552L, 1403L, 6381L, 1649L, 4136L, 4415L, 10650L, 12111L, 4397L, 9593L, 7040L, 3888L, 8340L, 11475L, 11413L, 3985L, 1077L, 7723L, 1392L,

Hi, I want to take a SRPM that is available for various versions of Fedora and rebuild it on a CentOS 4 system. Which release of Fedora is the closest to CentOS 4? In other words, which would be the best FC to take the SRPM for? Cheers Tony -- Tony Mountifield Work: tony at softins.co.uk - http://www.softins.co.uk Play: tony at mountifield.org - http://tony.mountifield.org

Dear R-users, i have a simple problem maybe, but i don't see the solution. i want to find the entry-wise closest element of an vector compared with another. ind1<-c(1,4,10) ind2<-c(3,5,11) for (i in length(ind2):1) { print(which.min(abs(ind1-ind2[i]))) } for ind2[3] it should be ind1[3] 10, for ind2[2] it should be ind1[2] 4 and for ind2[1] it should be ind1[1] 1. but with the

I'v got working Samba ADS servers, but "net ads info" shows most of them are associated with Win2K3 domain controllers that are in different sites than the ones the Samba servers are in (we have a large WAN with DCs in every site). I'm not configuring "password server" as I want Samba to be more fault tolerant than pointing it at one DC - when there are many to choose

R folks, I am somewhat new to R and have started to stumble... I have a set of data that I am trying to model, so that I can predict on a much larger set - and I have been using loess to get a model.. but it is not what I would like to see. For instance, I know from the nature of the data that the shape of this line should only decrease, and yet the loess is being affected by the sample

Hello, I have this command: x.axis <- seq(from=0.5, to=4.5, length.out=13112) How can I which of the x.axis components is the closest to a given value, for example 3.2? Best, Dani -- Daniel Valverde Saub? Grup de Biologia Molecular de Llevats Facultat de Veterin?ria de la Universitat Aut?noma de Barcelona Edifici V, Campus UAB 08193 Cerdanyola del Vall?s- SPAIN Centro de Investigaci?n

Hi, Do CentOS 7 installs not automatically use a closest mirror for installing like Fedora does, or is that due to the way I'm starting the install (virt-install)? Background: I'm trying to find the best way to do installs using basic local media (network install, but *without* the need to download the squashfs.img for every install) but without a full local mirror. On Fedora (25), it

Hi, I have to match names where names can be recorded with errors or additions. Now I am searching for a string search function which returns always the "closest" match. E.g. searching for "Washington" it should return only Washington but not Washington, D.C. But it also could be that the list contains only "Hamburg" but the record I am searching for is

I have a long list of numbers [3.4,5.4,3.67,....], and I basically want to find the index of the number closest to this number that I have, let's say 5.43. How would I do this without writing a for loop (I have to do this many times for several lists)? Is there a "lookup" function in R? Thanks! -- View this message in context:

Hi, I have 2 date vectors d1 and d2. d1 <- structure(c(14526, 14495, 14464, 14433, 14402, 14371, 14340, 14309, 14278, 14247, 14216, 14185), class = "Date") d2 <- structure(c(14526, 14509, 14488, 14466, 14453, 14441, 14396, 14388, 14343, 14333, 14310, 14281), class = "Date") I would like to create another dataframe with columns d1 and d2, where d1 is the original d1

Hi I have a table with ID (1 to 183) and Location (144 to -22). My problem is that I want to select the 10 ID's that are closest in Location to ID 1, ID 2 and so on. Also, some ID have the same Location. Say, if 11 ID's are closest to ID 100 I want to randomly choose one of the ID's to select 10 ID's total. Thank you -- View this message in context:

If anyone has a very fast vectorized method for doing the following I would appreciate some help. I want to avoid outer() to limit memory problems for very large n. Let x = real vector of length n y = real vector of length n w = real vector of length m, m typically less than n/2 but can be > n z = real vector of length m For w[i], i=1,,,m, find the value of x that is closest to w[i]. In

Art (and group), I'm doing this as a form of missing value analysis. Approximately 30% of the cases are missing data for one variable. To impute values for those cases, I'd like to match those cases that are missing the variable to all other cases and then take an average of those to infill. I realize there are many methods for imputing data. I'm not well versed on any in

I am trying to do a search for a crazy problem. Anyways, the search can only contain one word and the database it''s searching contains one word per row. Basically if someone tries to search for a word I want to find the closest match. Ex: If someone types "cat" and "cat" is not in my database, but "bat" is, how could I select bat? Also, if someone