-
Notifications
You must be signed in to change notification settings - Fork 849
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[QST] Recusively Generating AST Expressions (C++ libcudf) #15653
Comments
@shriramch You can use an owning object like a |
For an example of constructing an expression tree, see this benchmark: cudf/cpp/benchmarks/ast/transform.cpp Lines 65 to 87 in 23bb2ed
|
FWIW we'd also be OK with changing the current model, see #10744. If you would like to make that change, a PR is welcome! |
@bdice Thank you, this approach worked. |
@vyasr Sure, I'd like to try this. |
@shriramch OK great! Feel free to post here if you need help in getting a development environment set up for cudf! |
@vyasr Is it possible to get a remote development environment? Unfortunately I can't do this on my current PC. |
Would you be able to spin up an EC2 or GCP instance for this? I think getting access on one of the cloud services would be the easiest. Paperspace is another good option. |
I would like to implement a function that can generate AST expressions, for example, by recursively converting a different expression class, such as an Apache Arrow
arrow::compute::expression
object, to acudf::ast::expression
object.Is this even possible? libcudf's AST expression classes only accept references that are owned by the caller function; this is a problem since we can not recurse anymore. Is there any way to do this, to implement functions that can generate AST expressions instead of hardcoding expressions in a caller?
The text was updated successfully, but these errors were encountered: