Comments (6)
Of course assertions only compile on debug.
Let's define our own assertion that compiles according to a flag. We can
make it pause execution with a message (i.e. print something and then call
getchar) to get our attention.
Obviously we'll turn it off before submitting.
2012/8/27 noaminbar510 [email protected]
Having the following assumptions:
- Source, targets, and all aditional targets are sampled with both
connectors and layers.- Every motion_step is inside fsc's and therfore every point in a motion
step belongs to a node(or an edge?) in the graph.Thus, connect to graph should do nothing, and in myplanner::query",
perturbed_source == source, perturbed_target==target.
Should add an assertion/log message when connect_to_graph does return
differnt points.—
Reply to this email directly or view it on GitHubhttps://github.com//issues/25.
from hqmp.
I looked on "assert.h" code and felt a bit sad, show me this tommorow first thing on the morning, as there are more pending task needed to be asserted.
from hqmp.
Implemented in f79fdf6
2012/8/28 noaminbar510 [email protected]
I looked on "assert.h" code and felt a bit sad, show me this tommorow
first thing on the morning, as there are more pending task needed to be
asserted.—
Reply to this email directly or view it on GitHubhttps://github.com//issues/25#issuecomment-8070971.
from hqmp.
Can we close this issue?
from hqmp.
Ping.
from hqmp.
removed incorrect assertion on commit 0313a24.
closing the issue.
from hqmp.
Related Issues (20)
- Find out what ROI is all about!! HOT 2
- Implement edges weight function for finding path in roadmap HOT 7
- Add bool function returns TRUE iff source can connect to one of the targets HOT 2
- Better handling in connecting points created in "additional preprocessing" HOT 1
- Try to implement path merging HOT 3
- understand parameters "min/max_area_of_small_feature" HOT 3
- Make sure application works with ro without all our special configuraion parameters
- Make fast computation mode for situation where our player is the first HOT 2
- Cache the Minkowsky-summed dynamic obstacle HOT 2
- Run our player in a profiler
- Better preprocess for adidtional targets (sudar G) HOT 4
- Check out tunnel scenario
- Introduce roi as a parameter for generate_connector funciton HOT 1
- Cache the copy of the planner with the dynamic obstacle HOT 1
- Fix a bug in Oren's path planner in intervals HOT 3
- follow_polygon_edges crashes HOT 1
- Planner crashes on attempt to find bbox of unbounded polygon
- FastCopyingPlayer::move crash on line 92
- Cache dual graph - are we doing this? same idea as on old init_graph HOT 2
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from hqmp.