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
1.进度增加N,出一片叶子,但是每次出的时候判断一下上一片叶子距离初始位置的距离,如果太近,就不出了,保证两片叶子不会太近或者重叠 2.单位时间内,每出N片叶子,或者进度增加N,风扇速度值增加 N*系数,不出叶子,就减少一个值,然后有上限和下限。 我基于这个思路实现了一个效果,但是效果比较渣,偶尔会一卡一卡的,可能是系数没有掌握好
The text was updated successfully, but these errors were encountered:
可以到这个 QQ 群 277582728,群主是 LeafLoading 的原始作者。
Sorry, something went wrong.
No branches or pull requests
1.进度增加N,出一片叶子,但是每次出的时候判断一下上一片叶子距离初始位置的距离,如果太近,就不出了,保证两片叶子不会太近或者重叠
2.单位时间内,每出N片叶子,或者进度增加N,风扇速度值增加 N*系数,不出叶子,就减少一个值,然后有上限和下限。
我基于这个思路实现了一个效果,但是效果比较渣,偶尔会一卡一卡的,可能是系数没有掌握好
The text was updated successfully, but these errors were encountered: