How do I run a ruby function inside an ActiveRecord query?











up vote
0
down vote

favorite












City.all.sample{rand(1..3)} I want the random function to generate the sample count. This always returns one record.






ruby activerecord ruby-on-rails-5







share|improve this question






















  • @iGian couple of hundred times. Less than a thousand.
    – tambakoo
    13 hours ago






  • 1




    [1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
    – iGian
    13 hours ago










  • @iGian that was super simple! Thanks.
    – tambakoo
    13 hours ago










  • sample is not an active record query, though.
    – Sergio Tulentsev
    13 hours ago






  • 1




    @tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
    – Sergio Tulentsev
    13 hours ago

















up vote
0
down vote

favorite












City.all.sample{rand(1..3)} I want the random function to generate the sample count. This always returns one record.






ruby activerecord ruby-on-rails-5







share|improve this question






















  • @iGian couple of hundred times. Less than a thousand.
    – tambakoo
    13 hours ago






  • 1




    [1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
    – iGian
    13 hours ago










  • @iGian that was super simple! Thanks.
    – tambakoo
    13 hours ago










  • sample is not an active record query, though.
    – Sergio Tulentsev
    13 hours ago






  • 1




    @tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
    – Sergio Tulentsev
    13 hours ago















up vote
0
down vote

favorite









up vote
0
down vote

favorite











City.all.sample{rand(1..3)} I want the random function to generate the sample count. This always returns one record.






ruby activerecord ruby-on-rails-5







share|improve this question













City.all.sample{rand(1..3)} I want the random function to generate the sample count. This always returns one record.






ruby activerecord ruby-on-rails-5




ruby activerecord ruby-on-rails-5






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 14 hours ago









tambakoo

5510




5510












  • @iGian couple of hundred times. Less than a thousand.
    – tambakoo
    13 hours ago






  • 1




    [1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
    – iGian
    13 hours ago










  • @iGian that was super simple! Thanks.
    – tambakoo
    13 hours ago










  • sample is not an active record query, though.
    – Sergio Tulentsev
    13 hours ago






  • 1




    @tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
    – Sergio Tulentsev
    13 hours ago




















  • @iGian couple of hundred times. Less than a thousand.
    – tambakoo
    13 hours ago






  • 1




    [1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
    – iGian
    13 hours ago










  • @iGian that was super simple! Thanks.
    – tambakoo
    13 hours ago










  • sample is not an active record query, though.
    – Sergio Tulentsev
    13 hours ago






  • 1




    @tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
    – Sergio Tulentsev
    13 hours ago


















@iGian couple of hundred times. Less than a thousand.
– tambakoo
13 hours ago




@iGian couple of hundred times. Less than a thousand.
– tambakoo
13 hours ago




1




1




[1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
– iGian
13 hours ago




[1, 2, 3, 4, 5, 6, 7].sample(rand(1..3))
– iGian
13 hours ago












@iGian that was super simple! Thanks.
– tambakoo
13 hours ago




@iGian that was super simple! Thanks.
– tambakoo
13 hours ago












sample is not an active record query, though.
– Sergio Tulentsev
13 hours ago




sample is not an active record query, though.
– Sergio Tulentsev
13 hours ago




1




1




@tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
– Sergio Tulentsev
13 hours ago






@tambakoo: that it is, but you are not passing your logic to it. It runs unaltered. And then sample acts on the results. And in general, you can't "pass a ruby function to be used in a query". That's the whole point of the databases: to filter/sort/return data with maximum efficiency.
– Sergio Tulentsev
13 hours ago














1 Answer
1






active

oldest

votes

















up vote
0
down vote













I'd suggest this way, to avoid retrieving all records:



n.times.map.with_object() { |_, a| a << City.find(City.ids.sample) }


It returns an array of records.



Of course, n can be a random integer.






share|improve this answer





















  • Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
    – Sebastian Palma
    13 hours ago










  • @SebastianPalma: terrible performance for larger tables.
    – Sergio Tulentsev
    13 hours ago










  • You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
    – mu is too short
    5 hours ago











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53371941%2fhow-do-i-run-a-ruby-function-inside-an-activerecord-query%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote













I'd suggest this way, to avoid retrieving all records:



n.times.map.with_object() { |_, a| a << City.find(City.ids.sample) }


It returns an array of records.



Of course, n can be a random integer.






share|improve this answer





















  • Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
    – Sebastian Palma
    13 hours ago










  • @SebastianPalma: terrible performance for larger tables.
    – Sergio Tulentsev
    13 hours ago










  • You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
    – mu is too short
    5 hours ago















up vote
0
down vote













I'd suggest this way, to avoid retrieving all records:



n.times.map.with_object() { |_, a| a << City.find(City.ids.sample) }


It returns an array of records.



Of course, n can be a random integer.






share|improve this answer





















  • Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
    – Sebastian Palma
    13 hours ago










  • @SebastianPalma: terrible performance for larger tables.
    – Sergio Tulentsev
    13 hours ago










  • You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
    – mu is too short
    5 hours ago













up vote
0
down vote










up vote
0
down vote









I'd suggest this way, to avoid retrieving all records:



n.times.map.with_object() { |_, a| a << City.find(City.ids.sample) }


It returns an array of records.



Of course, n can be a random integer.






share|improve this answer












I'd suggest this way, to avoid retrieving all records:



n.times.map.with_object() { |_, a| a << City.find(City.ids.sample) }


It returns an array of records.



Of course, n can be a random integer.







share|improve this answer












share|improve this answer



share|improve this answer










answered 13 hours ago









iGian

2,3842620




2,3842620












  • Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
    – Sebastian Palma
    13 hours ago










  • @SebastianPalma: terrible performance for larger tables.
    – Sergio Tulentsev
    13 hours ago










  • You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
    – mu is too short
    5 hours ago


















  • Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
    – Sebastian Palma
    13 hours ago










  • @SebastianPalma: terrible performance for larger tables.
    – Sergio Tulentsev
    13 hours ago










  • You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
    – mu is too short
    5 hours ago
















Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
– Sebastian Palma
13 hours ago




Why not City.order('RAND()').limit(rand(1..3))? (RAND(), RANDOM()) depending the DB.
– Sebastian Palma
13 hours ago












@SebastianPalma: terrible performance for larger tables.
– Sergio Tulentsev
13 hours ago




@SebastianPalma: terrible performance for larger tables.
– Sergio Tulentsev
13 hours ago












You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
– mu is too short
5 hours ago




You could also City.find(City.ids.sample(n)) to reduce the number of queries and get a unique set of cities but you'd still be pull all the ids out of the cities table to do the sampling in Ruby and you'd still have an array. City.where(id: City.ids.sample(n)) would give you a relation but, again, you're still pulling all the ids out of the database.
– mu is too short
5 hours ago


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53371941%2fhow-do-i-run-a-ruby-function-inside-an-activerecord-query%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

Image
28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
Read more

Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

Image
up vote 13 down vote favorite 1 After the 2018 errata, the disintegrate spell description now reads: A creature targeted by this spell must make a Dexterity saving throw. On a failed save, the target takes 10d6 + 40 force damage. The target is disintegrated if this damage leaves it with 0 hit points. If you were to polymorph an enemy into a rat and then disintegrate it, would the enemy be disintegrated or would it just return to its original form? I know that for Druids, it’s not an instant kill anymore, but is this the case for polymorph as well? dnd-5e spells polymorph errata share | improve this question edited 18 hours ago
Read more

A Topological Invariant for $pi_3(U(n))$

Image
3 3 $begingroup$ Recently, I saw a construction of topological invariant for $pi_3(U(n))$ with $ngeq 2$ : $$ N=frac{1}{24pi^2}int_{S^3} d^3x epsilon^{ijk} Tr[(U^{-1}partial_{x_i}U)(U^{-1}partial_{x_j}U)(U^{-1}partial_{x_k}U)] , $$ where $Uin U(n)$ depends on $boldsymbol{x}=(x_1,x_2,x_3)in S^3$ , $epsilon^{ijk}$ is the Levi-Civita symbol, $i,j,k=1,2,3$ , and the duplicated indexes are summed over. It is claimed that $N$ is an integer, but why? Update 02/02/2019 I think I got an argument for $n=2$ . In this case, $U=e^{i varphi} q$ with $qin SU(2)$ . Due to the trace and the Levi-Civita symbol in $N$ , $varphi$ does not contribute to $N$ . As $Tr[q^{dagger}partial_i q]=0$ and $(q^{dagger}partial_i q)^{dagger}=-q^{dagger}partial_i q$ , $q^{dagger}partial_i q$ in geneeral has the form $q^{dagger}partia
Read more