Lines Matching defs:info
2809 TreeInfo info = new TreeInfo();
2810 head.study(info);
2811 if (info.maxValid == false) {
2818 new BehindS(head, info.maxLength,
2819 info.minLength) :
2820 new Behind(head, info.maxLength,
2821 info.minLength));
2824 new NotBehindS(head, info.maxLength,
2825 info.minLength) :
2826 new NotBehind(head, info.maxLength,
2827 info.minLength));
2893 TreeInfo info = new TreeInfo();
2894 if (head.study(info)) { // Deterministic
3362 boolean study(TreeInfo info) {
3364 return next.study(info);
3366 return info.deterministic;
3397 TreeInfo info = new TreeInfo();
3398 next.study(info);
3399 minLength = info.minLength;
3418 boolean study(TreeInfo info) {
3419 next.study(info);
3420 info.maxValid = false;
3421 info.deterministic = false;
3633 boolean study(TreeInfo info) {
3634 next.study(info);
3635 return info.deterministic;
3674 boolean study(TreeInfo info) {
3675 next.study(info);
3676 return info.deterministic;
3701 boolean study(TreeInfo info) {
3702 info.minLength++;
3703 info.maxLength++;
3704 return next.study(info);
3844 boolean study(TreeInfo info) {
3845 info.minLength += buffer.length;
3846 info.maxLength += buffer.length;
3847 return next.study(info);
4091 boolean study(TreeInfo info) {
4093 int minL = info.minLength;
4094 atom.study(info);
4095 info.minLength = minL;
4096 info.deterministic = false;
4097 return next.study(info);
4099 atom.study(info);
4100 return next.study(info);
4211 boolean study(TreeInfo info) {
4212 // Save original info
4213 int minL = info.minLength;
4214 int maxL = info.maxLength;
4215 boolean maxV = info.maxValid;
4216 boolean detm = info.deterministic;
4217 info.reset();
4219 atom.study(info);
4221 int temp = info.minLength * cmin + minL;
4225 info.minLength = temp;
4227 if (maxV & info.maxValid) {
4228 temp = info.maxLength * cmax + maxL;
4229 info.maxLength = temp;
4231 info.maxValid = false;
4234 info.maxValid = false;
4237 if (info.deterministic && cmin == cmax)
4238 info.deterministic = detm;
4240 info.deterministic = false;
4242 return next.study(info);
4285 // Notify GroupTail there is no need to setup group info
4420 boolean study(TreeInfo info) {
4421 // Save original info
4422 int minL = info.minLength;
4423 int maxL = info.maxLength;
4424 boolean maxV = info.maxValid;
4425 boolean detm = info.deterministic;
4426 info.reset();
4428 atom.study(info);
4430 int temp = info.minLength * cmin + minL;
4434 info.minLength = temp;
4436 if (maxV & info.maxValid) {
4437 temp = info.maxLength * cmax + maxL;
4438 info.maxLength = temp;
4440 info.maxValid = false;
4443 info.maxValid = false;
4446 if (info.deterministic && cmin == cmax) {
4447 info.deterministic = detm;
4449 info.deterministic = false;
4452 return next.study(info);
4468 boolean study(TreeInfo info) {
4469 return info.deterministic;
4509 boolean study(TreeInfo info) {
4510 int minL = info.minLength;
4511 int maxL = info.maxLength;
4512 boolean maxV = info.maxValid;
4517 info.reset();
4519 atoms[n].study(info);
4520 minL2 = Math.min(minL2, info.minLength);
4521 maxL2 = Math.max(maxL2, info.maxLength);
4522 maxV = (maxV & info.maxValid);
4528 info.reset();
4529 conn.next.study(info);
4531 info.minLength += minL;
4532 info.maxLength += maxL;
4533 info.maxValid &= maxV;
4534 info.deterministic = false;
4583 boolean study(TreeInfo info) {
4584 info.maxValid = false;
4585 info.deterministic = false;
4586 return next.study(info);
4623 // group info because it isn't really a group.
4641 boolean study(TreeInfo info) {
4642 return loop.study(info);
4711 boolean study(TreeInfo info) {
4712 info.maxValid = false;
4713 info.deterministic = false;
4771 boolean study(TreeInfo info) {
4772 info.maxValid = false;
4773 info.deterministic = false;
4812 boolean study(TreeInfo info) {
4813 info.maxValid = false;
4814 return next.study(info);
4867 boolean study(TreeInfo info) {
4868 info.maxValid = false;
4869 return next.study(info);
4901 boolean study(TreeInfo info) {
4902 atom.study(info);
4903 info.maxValid = false;
4904 info.deterministic = false;
4905 return next.study(info);
4923 boolean study(TreeInfo info) {
4924 int minL = info.minLength;
4925 int maxL = info.maxLength;
4926 boolean maxV = info.maxValid;
4927 info.reset();
4928 yes.study(info);
4930 int minL2 = info.minLength;
4931 int maxL2 = info.maxLength;
4932 boolean maxV2 = info.maxValid;
4933 info.reset();
4934 not.study(info);
4936 info.minLength = minL + Math.min(minL2, info.minLength);
4937 info.maxLength = maxL + Math.max(maxL2, info.maxLength);
4938 info.maxValid = (maxV & maxV2 & info.maxValid);
4939 info.deterministic = false;
4940 return next.study(info);
5384 boolean study(TreeInfo info) {
5385 info.minLength += buffer.length;
5386 info.maxValid = false;
5387 return next.study(info);