We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Is there any solution to find space between visible marks.
when number of marks count is less than 40 ,the space between mark automatically increase.
can you please update regarding space between marks.
private void setupGaps(double step, double offset) { gaps[0] = (float) Math.sin(offset / 2); float sum = gaps[0]; double angle = offset; int n = 1; while (angle + step <= Math.PI) { gaps[n] = (float) Math.sin(angle + step / 2); sum += gaps[n]; angle += step; n++; } float lastGap = (float) Math.sin((Math.PI + angle) / 2); sum += lastGap; if (n != gaps.length) { gaps[gaps.length - 1] = -1; } float k = view.getWidth() / sum; for (int i = 0; i < gaps.length; i++) { if (gaps[i] != -1) { gaps[i] *= k; } } }
The text was updated successfully, but these errors were encountered:
Hi, @bhavinsetubridge Sorry, I don't fully understand what you mean. Maybe if you provide an example where you need this I will be able to help.
Sorry, something went wrong.
No branches or pull requests
Is there any solution to find space between visible marks.
when number of marks count is less than 40 ,the space between mark automatically increase.
can you please update regarding space between marks.
private void setupGaps(double step, double offset) { gaps[0] = (float) Math.sin(offset / 2); float sum = gaps[0]; double angle = offset; int n = 1; while (angle + step <= Math.PI) { gaps[n] = (float) Math.sin(angle + step / 2); sum += gaps[n]; angle += step; n++; } float lastGap = (float) Math.sin((Math.PI + angle) / 2); sum += lastGap; if (n != gaps.length) { gaps[gaps.length - 1] = -1; } float k = view.getWidth() / sum; for (int i = 0; i < gaps.length; i++) { if (gaps[i] != -1) { gaps[i] *= k; } } }
The text was updated successfully, but these errors were encountered: