selective deletions from list
up vote
2
down vote
favorite
I have a list:
lis = {{"b","x","d"},{"a","z","b"},{"a","x","b"},{"a","x","c"},{"b","z","d"}}
Certain consecutive elements of this list will have identical first and last members (in this example, "a"
and "b"
in lis[[2]]
and lis[[3]]
) and I would like to delete the element that has "x" as its middle element, to give:
res = {{"b","x","d"},{"a","z","b"},{"a","x","c"},{"b","z","d"}}
It seems like a job for SequenceCases, but am having no luck.
list-manipulation
add a comment |
up vote
2
down vote
favorite
I have a list:
lis = {{"b","x","d"},{"a","z","b"},{"a","x","b"},{"a","x","c"},{"b","z","d"}}
Certain consecutive elements of this list will have identical first and last members (in this example, "a"
and "b"
in lis[[2]]
and lis[[3]]
) and I would like to delete the element that has "x" as its middle element, to give:
res = {{"b","x","d"},{"a","z","b"},{"a","x","c"},{"b","z","d"}}
It seems like a job for SequenceCases, but am having no luck.
list-manipulation
1
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
Take a look atDeleteDuplicatesBy
.
– Kuba♦
2 hours ago
Another approach could be to start withSplit[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.
– That Gravity Guy
2 hours ago
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I have a list:
lis = {{"b","x","d"},{"a","z","b"},{"a","x","b"},{"a","x","c"},{"b","z","d"}}
Certain consecutive elements of this list will have identical first and last members (in this example, "a"
and "b"
in lis[[2]]
and lis[[3]]
) and I would like to delete the element that has "x" as its middle element, to give:
res = {{"b","x","d"},{"a","z","b"},{"a","x","c"},{"b","z","d"}}
It seems like a job for SequenceCases, but am having no luck.
list-manipulation
I have a list:
lis = {{"b","x","d"},{"a","z","b"},{"a","x","b"},{"a","x","c"},{"b","z","d"}}
Certain consecutive elements of this list will have identical first and last members (in this example, "a"
and "b"
in lis[[2]]
and lis[[3]]
) and I would like to delete the element that has "x" as its middle element, to give:
res = {{"b","x","d"},{"a","z","b"},{"a","x","c"},{"b","z","d"}}
It seems like a job for SequenceCases, but am having no luck.
list-manipulation
list-manipulation
asked 2 hours ago
Suite401
969312
969312
1
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
Take a look atDeleteDuplicatesBy
.
– Kuba♦
2 hours ago
Another approach could be to start withSplit[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.
– That Gravity Guy
2 hours ago
add a comment |
1
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
Take a look atDeleteDuplicatesBy
.
– Kuba♦
2 hours ago
Another approach could be to start withSplit[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.
– That Gravity Guy
2 hours ago
1
1
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
Take a look at
DeleteDuplicatesBy
.– Kuba♦
2 hours ago
Take a look at
DeleteDuplicatesBy
.– Kuba♦
2 hours ago
Another approach could be to start with
Split[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.– That Gravity Guy
2 hours ago
Another approach could be to start with
Split[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.– That Gravity Guy
2 hours ago
add a comment |
2 Answers
2
active
oldest
votes
up vote
6
down vote
SequenceReplace[lis, {OrderlessPatternSequence[{a_, "x", c_}, {a_, b_, c_}]} :> {a, b, c}]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
up vote
0
down vote
One approach is to look at the differences between adjacent elements, find those which equal {0,0,x_}, and remove them from the list.
lis[[Complement[Range[Length[lis]],Flatten@Position[Differences[lis], {0, 0, x_}]]]]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
6
down vote
SequenceReplace[lis, {OrderlessPatternSequence[{a_, "x", c_}, {a_, b_, c_}]} :> {a, b, c}]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
up vote
6
down vote
SequenceReplace[lis, {OrderlessPatternSequence[{a_, "x", c_}, {a_, b_, c_}]} :> {a, b, c}]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
up vote
6
down vote
up vote
6
down vote
SequenceReplace[lis, {OrderlessPatternSequence[{a_, "x", c_}, {a_, b_, c_}]} :> {a, b, c}]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
SequenceReplace[lis, {OrderlessPatternSequence[{a_, "x", c_}, {a_, b_, c_}]} :> {a, b, c}]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
answered 2 hours ago
kglr
175k9197402
175k9197402
add a comment |
add a comment |
up vote
0
down vote
One approach is to look at the differences between adjacent elements, find those which equal {0,0,x_}, and remove them from the list.
lis[[Complement[Range[Length[lis]],Flatten@Position[Differences[lis], {0, 0, x_}]]]]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
up vote
0
down vote
One approach is to look at the differences between adjacent elements, find those which equal {0,0,x_}, and remove them from the list.
lis[[Complement[Range[Length[lis]],Flatten@Position[Differences[lis], {0, 0, x_}]]]]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
add a comment |
up vote
0
down vote
up vote
0
down vote
One approach is to look at the differences between adjacent elements, find those which equal {0,0,x_}, and remove them from the list.
lis[[Complement[Range[Length[lis]],Flatten@Position[Differences[lis], {0, 0, x_}]]]]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
One approach is to look at the differences between adjacent elements, find those which equal {0,0,x_}, and remove them from the list.
lis[[Complement[Range[Length[lis]],Flatten@Position[Differences[lis], {0, 0, x_}]]]]
{{"b", "x", "d"}, {"a", "z", "b"}, {"a", "x", "c"}, {"b", "z", "d"}}
answered 19 mins ago
bill s
52.5k375149
52.5k375149
add a comment |
add a comment |
Thanks for contributing an answer to Mathematica Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f187725%2fselective-deletions-from-list%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
elements 1 and 5 also have identical first and last members...Shouldn't you erase the first element, too?
– J42161217
2 hours ago
Take a look at
DeleteDuplicatesBy
.– Kuba♦
2 hours ago
Another approach could be to start with
Split[lis, #1[[1]] == #2[[1]] && #1[[3]] == #2[[3]] &]
to group the consecutive elements.– That Gravity Guy
2 hours ago